Evaluation of algorithms for one-dimensional cutting
From MaRDI portal
Publication:1603317
DOI10.1016/S0305-0548(01)00025-9zbMath1008.90049OpenAlexW1979197535MaRDI QIDQ1603317
Miroljub Kljajić, Gortan Resinovič, Miro Gradisar
Publication date: 11 July 2002
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0305-0548(01)00025-9
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Cutting optimization of structural tubes to build agricultural light aircrafts, An improved typology of cutting and packing problems, One-dimensional cutting stock optimization in consecutive time periods, A combined approach to the solution to the general one-dimensional cutting stock problem, Renovation of the cutting stock process, A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem, An effective solution for a real cutting stock problem in manufacturing plastic rolls, New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
Uses Software
Cites Work
- 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
- Optimization of roll cutting in clothing industry
- Branch-and-price algorithms for the one-dimensional cutting stock problem
- A two-phase roll cutting problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A typology of cutting and packing problems
- Optimal solutions for the cutting stock problem
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- A Linear Programming Approach to the Cutting Stock Problem—Part II