A hybrid approach for optimization of one-dimensional cutting
From MaRDI portal
Publication:1809853
DOI10.1016/S0377-2217(98)00329-4zbMath0945.90049MaRDI QIDQ1809853
Gortan Resinovič, Miroljub Kljajić, Miro Gradisar
Publication date: 25 November 1999
Published in: European Journal of Operational Research (Search for Journal in Brave)
Related Items (max. 100)
Cutting optimization of structural tubes to build agricultural light aircrafts ⋮ A heuristic for the one-dimensional cutting stock problem with usable leftover ⋮ Improving competitiveness in veneers production by a simple-to-use DSS. ⋮ Simultaneously determining the mix of space launch vehicles and the assignment of satellites to rockets ⋮ Renovation of the cutting stock process ⋮ Strips minimization in two-dimensional cutting stock of circular items ⋮ The one-dimensional cutting stock problem with usable leftover - a heuristic approach ⋮ Augmented neural networks and problem structure-based heuristics for the bin-packing problem ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
Uses Software
Cites Work
- Unnamed Item
- Cutting and packing. Special issue
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- Cutting stock problems and solution procedures
- 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
- 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
This page was built for publication: A hybrid approach for optimization of one-dimensional cutting
