A residual recombination heuristic for one-dimensional cutting stock problems
From MaRDI portal
Publication:2121621
DOI10.1007/s11750-021-00611-3zbMath1490.90237OpenAlexW3167915301MaRDI QIDQ2121621
Amanda O. C. Ayres, Washington A. Oliveira, Betania S. C. Campello, Carla T. L. S. Ghidini
Publication date: 4 April 2022
Published in: Top (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11750-021-00611-3
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items
Uses Software
Cites Work
- Unnamed Item
- Mathematical models and a heuristic method for the multiperiod one-dimensional cutting stock problem
- Bin packing and cutting stock problems: mathematical models and exact algorithms
- Classification and literature review of integrated lot-sizing and cutting stock problems
- Heuristics for the one-dimensional cutting stock problem with limited multiple stock lengths
- 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
- Exact solution of bin-packing problems using column generation and branch-and-bound
- Integer rounding and modified integer rounding for the skiving stock problem
- A one-dimensional cutting stock problem in the aluminium industry and its solution
- A typology of cutting and packing problems
- Heuristics for the integer one-dimensional cutting stock problem: A computational study
- Computational study of a column generation algorithm for bin packing and cutting stock problems
- Two heuristics for the capacitated multi-period cutting stock problem with pattern setup cost
- A matheuristic algorithm for the one-dimensional cutting stock and scheduling problem with heterogeneous orders
- The one-dimensional cutting stock problem with usable leftovers -- a survey
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- An improved typology of cutting and packing problems
- Mathematical Methods of Organizing and Planning Production
- Optimal Integer Solutions to Industrial Cutting-Stock Problems: Part 2, Benchmark Results
- A Linear Programming Approach to the Cutting-Stock Problem
- Optimal Integer Solutions to Industrial Cutting Stock Problems
- Pattern reduction in one-dimensional cutting stock problems
- The usable leftover one‐dimensional cutting stock problem—a priority‐in‐use heuristic
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- A Linear Programming Approach to the Cutting Stock Problem—Part II
