Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
From MaRDI portal
Cites work
- 2DPackLib: a two-dimensional cutting and packing library
- A New Linear Programming Approach to the Cutting Stock Problem
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A new constraint programming approach for the orthogonal packing problem
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Accelerated label setting algorithms for the elementary resource constrained shortest path problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- An improved typology of cutting and packing problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Characterization and modelling of guillotine constraints
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Comparative analysis of mathematical formulations for the two-dimensional guillotine cutting problem
- Dual-feasible functions for integer programming and combinatorial optimization. Basics, extensions and applications
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Exact solution techniques for two-dimensional cutting and packing
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- LP bounds in various constraint programming approaches for orthogonal packing
- Logic based Benders' decomposition for orthogonal stock cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- New reduction procedures and lower bounds for the two-dimensional bin packing problem with fixed orientation
- Packing by scheduling: using constraint programming to solve a complex 2D cutting stock problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- The two-dimensional bin packing problem with variable bin sizes and costs
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
This page was built for publication: Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7233314)
