Exact Solution Methods for a Generalized Assignment Problem with Location/Allocation Considerations

Published Online:https://doi.org/10.1287/ijoc.2016.0700

References

  • Amrouche N, Zaccour G (2007) Shelf-space allocation of national and private brands. Eur. J. Oper. Res. 180(2):648–663.CrossrefGoogle Scholar
  • Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWF, Vance PH (1998) Branch-and-price. Column generation for solving huge integer programs. Oper. Res. 46(3):316–329.LinkGoogle Scholar
  • Borin N, Farris PW, Freeland JR (1994) A model for determining retail product category assortment and shelf space allocation. Decision Sci. 25(3):359–384.CrossrefGoogle Scholar
  • Botsali AR (2007) Retail facility layout design. Doctoral dissertation, Texas A&M University, College Station, TX.Google Scholar
  • Cattrysse D, Van Wassenhove L (1992) A survey of algorithms for the generalized assignment problem. Eur. J. Oper. Res. 60(3):260–272.CrossrefGoogle Scholar
  • Chu PC, Beasley JE (1997) A genetic algorithm for the generalised assignment problem. Comput. Oper. Res. 24(1):17–23.CrossrefGoogle Scholar
  • Corstjens M, Doyle P (1981) A model for optimizing retail space allocations. Management Sci. 27(7):822–833.LinkGoogle Scholar
  • Cox KK (1970) The effect of shelf space upon sales of branded products. J. Marketing Res. 7(1):55–58.CrossrefGoogle Scholar
  • Flamand T, Ghoniem A, Maddah B (2016) Promoting impulse buying by allocating retail shelf space to grouped products. J. Oper. Res. Soc., ePub ahead of print February 3, http://dx.doi.org/10.1057/jors.2015.120.CrossrefGoogle Scholar
  • Garey MR, Johnson DS (1979) Computers and Intractability: A Guide to the Theory of NP-Completeness (W. H. Freeman & Co., New York).Google Scholar
  • Ghoniem A, Sherali HD (2009) Complementary column generation and bounding approaches for set partitioning formulations. Optim. Lett. 3(1):123–136.CrossrefGoogle Scholar
  • Ghoniem A, Flamand T, Haouari M (2016) Optimization-based very large-scale neighborhood search for generalized assignment problems with location/allocation considerations. INFORMS J. Comput. Forthcoming.Google Scholar
  • Hübner AH, Kuhn H (2012) Retail category management: State-of-the-art review of quantitative research and software applications in assortment and shelf space management. Omega 40(2):199–209.CrossrefGoogle Scholar
  • Ke W, Van Ryzin G (2011) Optimization of product placement in a retail environment. Working paper, Graduate School of Business, Columbia University, New York.Google Scholar
  • Martello S, Toth P (1990) Knapsack Problems Algorithms and Computer Implementations (John Wiley & Sons, New York).Google Scholar
  • Nemhauser GL, Wolsey LA (1999) Integer and Combinatorial Optimization, 2nd ed. (Wiley-Interscience, New York).Google Scholar
  • Öncan T (2007) A survey of the generalized assignment problem and its applications. INFOR 45(3):123–141.Google Scholar
  • Pentico D (2007) Assignment problems: A golden anniversary survey. Eur. J. Oper. Res. 176(2):774–793.CrossrefGoogle Scholar
  • Savelsbergh MWP (1997) A branch-and-price algorithm for the generalized assignment problem. Oper. Res. 45(6):831–841.LinkGoogle Scholar
INFORMS site uses cookies to store information on your computer. Some are essential to make our site work; Others help us improve the user experience. By using this site, you consent to the placement of these cookies. Please read our Privacy Statement to learn more.