Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
From MaRDI portal
Publication:1001001
DOI10.1016/j.cor.2008.07.001zbMath1179.90292OpenAlexW2057543533MaRDI QIDQ1001001
Kelly Cristina Poldi, Marcos Nereu Arenales
Publication date: 12 February 2009
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2008.07.001
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
A residual recombination heuristic for one-dimensional cutting stock problems, Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem, An exact scalarization method with multiple reference points for bi-objective integer linear optimization problems, Solving real-world cutting stock-problems in the paper industry: mathematical approaches, experience and challenges, One-dimensional stock cutting: optimization of usable leftovers in consecutive orders, Exact and approximate methods for the score-constrained packing problem, A heuristic approach to minimize the number of saw cycles in small-scale furniture factories, Heuristic algorithms based on column generation for an online product shipping problem, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Cutting uncertain stock and vehicle routing in a sustainability forestry harvesting problem, The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic, Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost, Efficient algorithms for real-life instances of the variable size bin packing problem, A two-objective mathematical model without cutting patterns for one-dimensional assortment problems, Classification and literature review of integrated lot-sizing and cutting stock problems, Two-stage two-dimensional guillotine cutting stock problems with usable leftover, Modified greedy heuristic for the one-dimensional cutting stock problem, The one-dimensional cutting stock problem with due dates, Heuristic for the rectangular two-dimensional single stock size cutting stock problem with two-staged patterns, The one-dimensional cutting stock problem with usable leftovers -- a survey
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The modified integer round-up property of the one-dimensional cutting stock problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- The trim-loss and assortment problems: A survey
- Cutting stock problems and solution procedures
- A new model for complete solutions to one-dimensional cutting stock problems.
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- LP models for bin packing and cutting stock problems
- A cutting plane algorithm for the one-dimensional cutting stock problem with multiple stock lengths
- Decomposition approaches for solving the integer one-dimensional cutting stock problem with different types of standard lengths
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- An improved typology of cutting and packing problems
- Accelerating column generation for variable sized bin-packing problems
- A Linear Programming Approach to the Cutting-Stock Problem
- Pattern reduction in one-dimensional cutting stock problems
- A guide to vehicle routing heuristics
- A Linear Programming Approach to the Cutting Stock Problem—Part II
- Multistage Cutting Stock Problems of Two and More Dimensions
