Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- 10 May 2019
- journal article
- research article
- Published by Elsevier BV in EURO Journal on Computational Optimization
- Vol. 7 (3), 265-297
- https://doi.org/10.1007/s13675-019-00113-9
Abstract
No abstract availableKeywords
This publication has 28 references indexed in Scilit:
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problemDiscrete Optimization, 2018
- Solving the 3-Staged 2-Dimensional Cutting Stock Problem by Dynamic Programming and Variable Neighborhood SearchElectronic Notes in Discrete Mathematics, 2015
- Two‐stage two‐dimensional guillotine cutting stock problems with usable leftoverInternational Transactions in Operational Research, 2014
- A Variable Neighborhood Search Using Very Large Neighborhood Structures for the 3-Staged 2-Dimensional Cutting Stock ProblemLecture Notes in Computer Science, 2014
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cutsComputers & Operations Research, 2013
- Exact algorithms for the two-dimensional guillotine knapsackComputers & Operations Research, 2012
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generationEuropean Journal of Operational Research, 2008
- A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problemsOR Spectrum, 2002
- Two-Dimensional Finite Bin-Packing AlgorithmsJournal of the Operational Research Society, 1987
- Algorithms for Unconstrained Two-Dimensional Guillotine CuttingJournal of the Operational Research Society, 1985