A combined approach to the solution to the general one-dimensional cutting stock problem
From MaRDI portal
Publication:1777156
DOI10.1016/j.cor.2003.11.028zbMath1074.90045MaRDI QIDQ1777156
Publication date: 12 May 2005
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2003.11.028
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
90C30: Nonlinear programming
90C59: Approximation methods and heuristics in mathematical programming
Related Items
One-dimensional cutting stock optimization in consecutive time periods, Optimization of a line-cutting procedure for ship hull construction by an effective tabu search
Uses Software
Cites Work
- Unnamed Item
- A sequential heuristic procedure for one-dimensional cutting
- Cutting and packing. Special issue
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- An algorithm for the determination of optimal cutting patterns
- Optimization of roll cutting in clothing industry
- Exact algorithms for the guillotine strip cutting/packing problem.
- Row and column generation technique for a multistage cutting stock problem
- Evaluation of algorithms for one-dimensional cutting
- A typology of cutting and packing problems
- An LP-based approach to cutting stock problems with multiple objectives
- LP models for bin packing and cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- A Linear Programming Approach to the Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
