Procedures for solving a 1-dimensional cutting problem
From MaRDI portal
Publication:1333482
DOI10.1016/0377-2217(94)90035-3zbMATH Open0810.90106OpenAlexW2040988942MaRDI QIDQ1333482FDOQ1333482
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
Recommendations
Linear programming (90C05) Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10)
Cites Work
- A Linear Programming Approach to the Cutting-Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- A typology of cutting and packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- The trim-loss and assortment problems: A survey
- Optimal solutions for the cutting stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- Selection and Design of Heuristic Procedures for Solving Roll Trim Problems
- Formalisation et résolution des problèmes de découpes linéaires
Cited In (5)
- Evaluation of algorithms for one-dimensional cutting
- A sequential heuristic procedure for one-dimensional cutting
- One-dimensional cutting stock problems and solution procedures
- Solving sequential interval cutting problems via dynamic programming
- Integer linear programming for a cutting problem in the wood-processing industry: a case study
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)
