Procedures for solving a 1-dimensional cutting problem

DOI10.1016/0377-2217(94)90035-3MaRDI QIDQ1333482zbMATH OpenOpenAlexFDO

Authors 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

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

Recommendations

• One-dimensional cutting stock problems and solution procedures
• The cutting stock problem with mixed objectives: Two heuristics based on dynamic programming
• Near-optimal solutions to one-dimensional cutting stock problems
• Cutting stock problems and solution procedures
• The cutting stock problem

Cites work

• A Linear Programming Approach to the Cutting Stock Problem—Part II
• A Linear Programming Approach to the Cutting-Stock Problem
• A one-dimensional cutting stock problem in the aluminium industry and its solution
• A typology of cutting and packing problems
• Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
• Formalisation et résolution des problèmes de découpes linéaires
• Optimal solutions for the cutting stock problem
• Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
• The trim-loss and assortment problems: A survey

Cited in

(5)

• One-dimensional cutting stock problems and solution procedures
• Integer linear programming for a cutting problem in the wood-processing industry: a case study
• Solving sequential interval cutting problems via dynamic programming
• A sequential heuristic procedure for one-dimensional cutting
• Evaluation of algorithms for one-dimensional cutting

This page was built for publication: Procedures for solving a 1-dimensional cutting problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1333482)