A note on handling residual lengths
From MaRDI portal
Publication:3974424
DOI10.1080/02331939108843687zbMath0739.90045OpenAlexW2085524297MaRDI QIDQ3974424
Publication date: 25 June 1992
Published in: Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02331939108843687
Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items (10)
A heuristic for the one-dimensional cutting stock problem with usable leftover ⋮ One-dimensional stock cutting: optimization of usable leftovers in consecutive orders ⋮ Integrated lot-sizing and one-dimensional cutting stock problem with usable leftovers ⋮ The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers ⋮ A heuristic for the skiving and cutting stock problem in paper and plastic film industries ⋮ A stochastic programming approach to the cutting stock problem with usable leftovers ⋮ The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic ⋮ Two-stage two-dimensional guillotine cutting stock problems with usable leftover ⋮ Integer linear programming for a cutting problem in the wood-processing industry: a case study ⋮ The one-dimensional cutting stock problem with usable leftovers -- a survey
Cites Work
- Unnamed Item
- A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems
- A Linear Programming Approach to the Cutting-Stock Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
This page was built for publication: A note on handling residual lengths