An Optimization Algorithm for the Ordered Open-End Bin-Packing Problem

References

• Balas E., Zemel E. An algorithm for large zero-one knapsack problems. Oper. Res. (1980) 28:1130–1154Link, Google Scholar
• Ceselli A., Righini G. A branch-and-price algorithm for the multilevel generalized assignment problem. (2004) . Technical report, Dipartimento di Tecnologie dell'Informazione, Università di Milano, Crema, ItalyGoogle Scholar
• Ceselli A., Righini G. A branch-and-price algorithm for the capacitated p-median problem. Networks (2005) 45(3):125–142Crossref, Google Scholar
• Coffman E. G., Garey M. R., Johnson D. S., Hochbaum D. Approximation algorithms for bin packing: A survey. Approximation Algorithms for NP-Hard Problems (1996) (PWS Publishing Company, Boston, MA) Google Scholar
• Desaulniers G., Desrosiers J., Solomon M. M.Column Generation (2005) (Springer, New York) Crossref, Google Scholar
• Held M., Wolfe P., Crowder H. P. Validation of subgradient optimization. Math. Programming (1974) 6:62–88Crossref, Google Scholar
• Leung J. Y. T., Dror M., Young G. H. A note on an open-end bin packing problem. J. Scheduling (2001) 4:201–207Crossref, Google Scholar
• Lodi A., Martello S., Monaci M. Two-dimensional packing problems: A survey. Eur. J. Oper. Res. (2002) 141:241–252Crossref, Google Scholar
• Lodi A., Martello S., Vigo D. Models and bounds for two-dimensional packing problems. J. Combin. Optim. (2004) 8:363–379Crossref, Google Scholar
• Pisinger D.Oper. Res. (1997) 45:0–1Link, Google Scholar
• Yang J., Leung J. Y. T. The ordered open-end bin-packing problem. Oper. Res. (2003) 51:759–770Link, Google Scholar