Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem
Authors:
- Marc PeetersMPMarc Peeters
- Zeger DegraeveZDZeger Degraeve
- 1 April 2006
- journal article
- Published by Elsevier in European Journal of Operational Research
- Vol. 170 (2) , 416-439
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark ResultsINFORMS Journal on Computing, 2003
- Optimal Integer Solutions to Industrial Cutting Stock ProblemsINFORMS Journal on Computing, 1999
- Case Studies from Industry: Skiving Addition to the Cutting Stock Problem in the Paper IndustrySIAM Review, 1997
- A Column Generation Approach to the Urban Transit Crew Scheduling ProblemTransportation Science, 1989
- Probabilistic bounds for dual bin-packingActa Informatica, 1985
- Routing with time windows by column generationNetworks, 1984
- Bin packing: Maximizing the number of pieces packedActa Informatica, 1978
- Lagrangean relaxation for integer programming1974
- A Linear Programming Approach to the Cutting Stock Problem—Part IIOperations Research, 1963
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961