Lower bounds and algorithms for the 2-dimensional vector packing problem
- 1 August 2001
- journal article
- Published by Elsevier BV in Discrete Applied Mathematics
- Vol. 111 (3), 231-262
- https://doi.org/10.1016/s0166-218x(00)00267-5
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Computational study of a column generation algorithm for bin packing and cutting stock problemsMathematical Programming, 1999
- Properties of some ILP formulations of a class of partitioning problemsDiscrete Applied Mathematics, 1998
- Exact Solution of Cutting Stock Problems Using Column Generation and Branch-and-BoundInternational Transactions in Operational Research, 1998
- Multiple-type, two-dimensional bin packing problems: Applications and algorithmsAnnals of Operations Research, 1994
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- A branch-and-bound algorithm for the two-dimensional vector packing problemComputers & Operations Research, 1994
- Lower bounds and reduction procedures for the bin packing problemDiscrete Applied Mathematics, 1990
- New Algorithms for Bin PackingJournal of the ACM, 1980
- An algorithm for a class of loading problemsNaval Research Logistics Quarterly, 1978
- A general packing algorithm for multidimensional resource requirementsInternational Journal of Parallel Programming, 1977