Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems

DOI10.1287/OPRE.47.4.495zbMath1041.90536OpenAlexW2012058818WikidataQ57186015 ScholiaQ57186015MaRDI QIDQ4545662

Chengbin Chu, Julien Antonio

Publication date: 30 October 2002

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.47.4.495

zbMATH Keywords

approximation algorithmscutting stock problems

Mathematics Subject Classification ID

Approximation methods and heuristics in mathematical programming (90C59) Discrete location and assignment (90B80) Approximation algorithms (68W25)

Related Items (12)

Combined cutting stock and lot-sizing problem with pattern setup ⋮ Two-dimensional skiving and cutting stock problem with setup cost based on column-and-row generation ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Solving two-dimensional cutting stock problem via a DNA computing algorithm ⋮ An iterative sequential heuristic procedure to a real-life 1.5-dimensional cutting stock problem ⋮ Constraint programming-based column generation ⋮ Constraint programming-based column generation ⋮ Integrating process optimization and inventory planning in cutting-stock with skiving option: an optimization model and its application ⋮ Integrated design and operation of remnant inventory supply chains under uncertainty ⋮ Dynamic-programming-based heuristic for multi-objective operating theater planning ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey

This page was built for publication: Approximation Algorithms to Solve Real-Life Multicriteria Cutting Stock Problems