Exact and Asymptotically Exact Solutions for a Class of Assortment Problems

References

• Agrawal P. K. Determining stock-sheet-sizes to minimize trim loss. Eur. J. Oper. Res. (1993) 64:423–431Crossref, Google Scholar
• Arbib C., Marinelli F. An optimization model for trim loss minimization in an automotive glass plant. Eur. J. Oper. Res. (2007) 183(3):1421–1432Crossref, Google Scholar
• Atamtürk A. Cover and pack inequalities for (mixed) integer programming. Ann. Oper. Res. (2005) 139:31–38Crossref, Google Scholar
• Avella P., Sassano A., Vasil'ev I. Computational study of large-scale p-median problems. Math. Programming (2007) 109(1):89–114Crossref, Google Scholar
• Barnhart C., Johnson E. L., Nemhauser G. L., Savelsbergh M. W. P., Vance P. H. Branch-and-price: Column generation for solving huge integer programs. Oper. Res. (1998) 46:316–329Link, Google Scholar
• Beasley J. E. An algorithm for the two-dimensional assortment problem. Eur. J. Oper. Res. (1985) 19:253–261Crossref, Google Scholar
• Belov G., Scheithauer G. A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths. Eur. J. Oper. Res. (2002) 141:274–294Crossref, Google Scholar
• Chambers M. L., Dyson R. G. The cutting stock problem in the flat glass industry—Selection of resource types. Oper. Res. Quart. (1976) 27(4):949–957Crossref, Google Scholar
• Chen C.-S., Sarin S., Ram B. A mixed integer programming model for a class of assortment problems. Eur. J. Oper. Res. (1993) 65:362–367Crossref, Google Scholar
• du Merle O., Goffin J. L., Vial J. P. On improvements to the analytic centre cutting plane method. Comput. Optim. Appl. (1998) 11:37–52Crossref, Google Scholar
• du Merle O., Villeneuve D., Desrosiers J., Hansen P. Stabilized column generation. Discrete Math. (1999) 194:229–237Crossref, Google Scholar
• Dyckhoff H., Scheithauer G., Terno J., Dell'Amico M., Maffioli F., Martello S. Cutting and packing (C&P). Annotated Bibliographies in Combinatorial Optimization (1997) (Wiley, Chichester, UK) 393–413Google Scholar
• Frank C. R. A note on the assortment problem. Management Sci. (1965) 11:724–726Link, Google Scholar
• García-López F., Melián-Batista B., Moreno-Pérez J. A., Moreno-Vega J. M. The parallel variable neighborhood search for the p-median problem. J. Heuristics (2002) 8(3):375–388Crossref, Google Scholar
• Gilmore P. C., Gomory R. E. A linear programming approach to the cutting stock problem—Part II. Oper. Res. (1963) 11(6):863–888Link, Google Scholar
• Gochet W., Vandebroek M. A dynamic programming based heuristic for industrial buying of cardboard. Eur. J. Oper. Res. (1989) 38:104–112Crossref, Google Scholar
• Hale W. W., Pyke D. F., Rudi N. An assemble-to-order system with component substitution. Proc. 4th MSOM Conf. (2000) Ann Arbor, MIGoogle Scholar
• Holthaus O. On the best number of different standard lengths to stock for one-dimensional assortment problems. Internat. J. Production Econom. (2003) 83:233–246Crossref, Google Scholar
• Jones P. C., Lowe T. J., Muller G., Xu N., Ye Y., Zydiak J. L. Specially structured uncapacitatied facility location problems. Oper. Res. (1995) 43:661–669Link, Google Scholar
• Kellerer H., Pferschy U., Pisinger D.Knapsack Problems (2004) (Springer-Verlag, Berlin-Heidelberg) Crossref, Google Scholar
• Labbé M., Peeters D., Thisse J. F., Ball M. O., Magnanti T. L., Monma C. L., Nemhausher G. L. Location on networks. Network Routing—Handbooks in Operations Research/Management Science (1995) 8(Elsevier Science, B.V., Amsterdam) 551–624Google Scholar
• Li H.-L., Chang C.-T., Tsai J. F. Approximately global optimization for assortment problems using piecewise linearization techniques. Eur. J. Oper. Res. (2002) 140:584–589Crossref, Google Scholar
• Lübbecke M. E., Desrosiers J. Selected topics in column generation. Oper. Res. (2005) 53(6):1007–1023Link, Google Scholar
• Marsten R. M., Hogan W., Blankenship J. The boxstep method for large-scale optimization. Oper. Res. (1975) 23:389–405Link, Google Scholar
• Michel S., Perrot N., Vanderbeck F. Knapsack problems with setups. Eur. J. Oper. Res. (2008) . ePub ahead of print May 13Google Scholar
• Nelißen J. New approaches to the pallet loading problem. (1993) . Technical report, RWTH Aachen, Aachen, GermanyGoogle Scholar
• Pentico D. W. The assortment problem with nonlinear cost functions. Oper. Res. (1976) 24:1129–1142Link, Google Scholar
• Ragsdale C. T., Zobel C. W. The ordered cutting stock problem. Decision Sci. (2004) 35(1):83–100Crossref, Google Scholar
• Reese J. Methods for solving the p-median problem: An annotated bibliography. (2005) . Technical report, Department of Mathematics, Trinity University, San Antonio, TXGoogle Scholar
• Resende M. G. C., Werneck R. F. A hybrid heuristic for the $p$-median problem. J. Heuristics (2004) 10(1):59–88Crossref, Google Scholar
• Sarac T., Ozdemir M. S., Chung P. W. H., Hinde C. J., Ali M. A genetic algorithm for 1, 5-dimensional assortment problems with multiple objectives. IEA/AIE 2003, Lecture Notes in Artificial Intelligence (2003) 2718(Springer-Verlag, Berlin) 41–51Google Scholar
• Senne E. L. F., Lorena L. A. N., Pereira M. A. A branch-and-price approach to p-median location problems. Comput. Oper. Res. (2005) 32(6):1655–1664Crossref, Google Scholar
• Simpson T. W., Siddique Z., Jiao J. R.Product Platform and Product Family Design—Methods and Applications (2006) (Springer, New York) Crossref, Google Scholar
• Swain R. W. A parametric decomposition approach for the solution of uncapacitated location problems. Management Sci. (1974) 21:955–961Link, Google Scholar
• Thonemann U. W., Brandeau M. L. Optimal commonality in component design. Oper. Res. (2000) 48(1):1–19Link, Google Scholar
• Tripathy A., Süral H., Gerchak Y. Multidimensional assortment problem with an application. Networks (1999) 33(3):239–245Crossref, Google Scholar
• Vasko F. J., Wolf F. E., Stott K. L. A practical approach for determining rectangular resource type. J. Oper. Res. Soc. (1994) 45(3):281–286Crossref, Google Scholar
• Yanasse H. H. A search strategy for the one-size assortment problem. Eur. J. Oper. Res. (1994) 74:135–142Crossref, Google Scholar