Procedures for solving a 1-dimensional cutting problem

DOI10.1016/0377-2217(94)90035-3zbMath0810.90106OpenAlexW2040988942MaRDI QIDQ1333482

Albert Corominas, Joaquín Bautista

Publication date: 15 September 1994

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(94)90035-3

zbMATH Keywords

heuristicsinteger linear programmingcutting stockcutting probleminventory holding cost

Mathematics Subject Classification ID

Integer programming (90C10) Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39)

Cites Work

• The trim-loss and assortment problems: A survey
• 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
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
• Formalisation et résolution des problèmes de découpes linéaires
• 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: Procedures for solving a 1-dimensional cutting problem