Improved state space relaxation for constrained two-dimensional guillotine cutting problems
DOI10.1016/J.EJOR.2018.06.016zbMATH Open1403.90589OpenAlexW2884579014MaRDI QIDQ1991111FDOQ1991111
Authors: André Soares Velasco, Eduardo Uchoa 
Publication date: 30 October 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.06.016
Recommendations
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- A recursive exact algorithm for weighted two-dimensional cutting
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
Applications of mathematical programming (90C90) Combinatorial optimization (90C27) Dynamic programming (90C39) Integer programming (90C10)
Cites Work
- Multistage Cutting Stock Problems of Two and More Dimensions
- A recursive algorithm for constrained two-dimensional cutting problems
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- The G4-Heuristic for the Pallet Loading Problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A Minimal Algorithm for the Bounded Knapsack Problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Exact algorithms for the two-dimensional guillotine knapsack
- An and-or-graph approach for two-dimensional cutting problems
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
Cited In (8)
- Exact solution techniques for two-dimensional cutting and packing
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 2DPackLib: a two-dimensional cutting and packing library
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Uses Software
This page was built for publication: Improved state space relaxation for constrained two-dimensional guillotine cutting problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1991111)
