Efficient algorithm to allocate shelf space

European Journal of Operational Research

Volumn 131, Issue 1, 2001, Pages 107-118

  Yang, Ming Hsien ^a  

^a FU JEN CATHOLIC UNIVERSITY   (Taiwan)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; CONSTRAINT THEORY; HEURISTIC METHODS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION; STRATEGIC PLANNING;

KNAPSACK PROBLEMS; RETAILING;

OPERATIONS RESEARCH;

EID: 0035341801     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00448-8     Document Type: Article

References (19)

1. Anderson E.E., Amato H.N. A mathematical model for simultaneously determining the optimal brand collection and display area allocation. Operations Research. 22(1):1974;13-21.
2. Buttle F. Retail space allocation. International Journal of Physics Distribution and Material Management. 14(4):1984a;3-23.
3. Buttle F. Merchandising. European Journal of Marketing. 18(6):1984b;104-123.
4. Corstjens M., Doyle P. A model for optimizing retail space allocations. Management Science. 27(7):1981;822-833.
5. Corstjens M., Doyle P. A dynamic model for strategically allocating retail space. Journal of the Operational Research Society. 34(10):1983;943-951.
6. Curhan R.C. Shelf space allocation and profit maximization in mass retailing. Journal of Marketing. 37(3):1973;54-60.
7. Doyle P., Gidengil B.Z. A review of in-store experiments. Journal of Retailing. 53(2):1977;47-62.
8. Drexl A. A simulated annealing approach to the multiconstraint zero-one knapsack problem. Computing. 40:1988;1-8.
9. Dreze X., Hoch S.J., Purk M.E. Shelf management and space elasticity. Journal of Retailing. 70(4):1994;301-326.
10. Eben-Chaime M. Parametric solution for linear bicriteria knapsack models. Management Science. 42(11):1996;1565-1575.
11. Fancher L.A. Computerized space management: A strategic weapon. Discount Merchandiser. 31(3):1991;64-65.
12. Gavish B., Pirkul H. Efficient algorithms for solving multiconstraint zero-one knapsack problem to optimality. Mathematical Programming. 31:1985;78-105.
13. Gochet W., Smeers Y. A branch-and-bound method for reversed geometric programming. Operations Research. 27(5):1979;982-996.
14. Hansen P., Heinsbroek H. Product selection and space allocation in supermarkets. European Journal of Operational Research. 3(6):1979;58-63.
15. Helms N.M., Haynes P.J., Capple S.D. Competitive strategies and business performance within the retailing industry. International Journal of Retail and Distribution Management. 20(5):1992;3-14.
16. Mason, J.B., Mayer, M.L., 1990. Modern Retailing: Theory and Practice, Irwin, Boston.
17. Thiel J., Voss S. Some experiences on solving multiconstraint zero-one knapsack problems with genetic algorithms. INFOR. 32(4):1994;226-242.
18. Urban G.L. A mathematical modeling approach to product line decisions. Journal of Marketing Research. 6(1):1969;40-47.
19. Zufryden F.S. A dynamic programming approach for product selection and supermarket shelf-space allocation. Journal of Operations Research Society. 37(4):1986;413-422.