An efficient algorithm to allocate shelf space
暂无分享,去创建一个
[1] Yves Smeers,et al. A Branch-and-Bound Method for Reversed Geometric Programming , 1979, Oper. Res..
[2] Glen L. Urban,et al. A Mathematical Modeling Approach to Product Line Decisions , 1969 .
[3] Peter Doyle,et al. A Dynamic Model for Strategically Allocating Retail Space , 1983 .
[4] Hasan Pirkul,et al. Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality , 1985, Math. Program..
[5] Pierre Hansen,et al. Product selection and space allocation in supermarkets , 1979 .
[6] M. Eben-Chaime. Parametric solution for linear bicriteria knapsack models , 1996 .
[7] M. Corstjens,et al. A Model for Optimizing Retail Space Allocations , 1981 .
[8] S. Voß,et al. Some Experiences On Solving Multiconstraint Zero-One Knapsack Problems With Genetic Algorithms , 1994 .
[9] Fred S. Zufryden,et al. A Dynamic Programming Approach for Product Selection and Supermarket Shelf-Space Allocation , 1986 .
[10] Ronald C. Curhan. Shelf Space Allocation and Profit Maximization in Mass Retailing , 1973 .
[11] Joseph Barry Mason,et al. Modern retailing: Theory and practice , 1978 .
[12] Francis Buttle,et al. Retail Space Allocation , 1984 .
[13] Marilyn M. Helms,et al. COMPETITIVE STRATEGIES AND BUSINESS PERFORMANCE WITHIN THE RETAILING INDUSTRY , 1992 .
[14] Evan E. Anderson,et al. A Mathematical Model for Simultaneously Determining the Optimal Brand-Collection and Display-Area Allocation , 1974, Oper. Res..
[15] Stephen J. Hoch,et al. Shelf management and space elasticity , 1994 .