Solving binary cutting stock problems by column generation and branch-and-bound
- 1 May 1994
- journal article
- research article
- Published by Springer Science and Business Media LLC in Computational Optimization and Applications
- Vol. 3 (2), 111-130
- https://doi.org/10.1007/bf01300970
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A New Optimization Algorithm for the Vehicle Routing Problem with Time WindowsOperations Research, 1992
- Cutting stock problems and solution proceduresEuropean Journal of Operational Research, 1991
- The pickup and delivery problem with time windowsEuropean Journal of Operational Research, 1991
- A Note on Bounding a Class of Linear Programming Problems, Including Cutting Stock ProblemsOperations Research, 1990
- Optimal solutions for the cutting stock problemEuropean Journal of Operational Research, 1990
- A Column Generation Approach to the Urban Transit Crew Scheduling ProblemTransportation Science, 1989
- Methods for routing with time windowsEuropean Journal of Operational Research, 1986
- Routing with time windows by column generationNetworks, 1984
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961