Near-optimal solutions to one-dimensional cutting stock problems
From MaRDI portal
Publication:1091269
DOI10.1016/0305-0548(86)90077-8zbMath0622.90066OpenAlexW1990897806MaRDI QIDQ1091269
Publication date: 1986
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0305-0548(86)90077-8
Numerical mathematical programming methods (65K05) Integer programming (90C10) Linear programming (90C05) Production models (90B30) Combinatorial optimization (90C27)
Related Items
Solving binary cutting stock problems by column generation and branch- and-bound, Solving a cutting problem based on existing patterns, Bin packing and cutting stock problems: mathematical models and exact algorithms, A comparison of two optimization procedures for 1- and 1\(1/2\)-dimensional cutting stock problems, Accelerating column generation for variable sized bin-packing problems, The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers, An investigation into two bin packing problems with ordering and orientation implications, Heuristic methods for gang-rip saw arbor design., A stabilized branch-and-price-and-cut algorithm for the multiple length cutting stock problem, Knowledge based approach to the cutting stock problem, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, A one-dimensional cutting stock problem in the aluminium industry and its solution, Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths, A solution procedure for a pattern sequencing problem as part of a one-dimensional cutting stock problem in the steel industry, A column generation procedure for gang-rip saw arbor design and scheduling, The one-dimensional cutting stock problem with usable leftovers -- a survey
Cites Work
