Branch-and-Price Algorithms for the One-Dimensional Cutting Stock Problem
Author:
- 1 March 1998
- journal article
- Published by Springer Nature in Computational Optimization and Applications
- Vol. 9 (3) , 211-228
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- Solving binary cutting stock problems by column generation and branch-and-boundComputational Optimization and Applications, 1994
- 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
- The cutting stock problem and integer roundingMathematical Programming, 1985
- Computing Partitions with Applications to the Knapsack ProblemJournal of the ACM, 1974
- A Linear Programming Approach to the Cutting-Stock ProblemOperations Research, 1961