Improved state space relaxation for constrained two-dimensional guillotine cutting problems
From MaRDI portal
Publication:1991111
DOI10.1016/j.ejor.2018.06.016zbMath1403.90589OpenAlexW2884579014MaRDI QIDQ1991111
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
Applications of mathematical programming (90C90) Integer programming (90C10) Combinatorial optimization (90C27) Dynamic programming (90C39)
Related Items (8)
An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts ⋮ Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Enhanced formulation for the Guillotine 2D Cutting knapsack problem ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- A recursive algorithm for constrained two-dimensional cutting problems
- An and-or-graph approach for two-dimensional cutting problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Exact algorithms for the two-dimensional guillotine knapsack
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- A Minimal Algorithm for the Bounded Knapsack Problem
- Reactive GRASP: An Application to a Matrix Decomposition Problem in TDMA Traffic Assignment
- The G4-Heuristic for the Pallet Loading Problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
This page was built for publication: Improved state space relaxation for constrained two-dimensional guillotine cutting problems
