Modeling two-dimensional guillotine cutting problems via integer programming
From MaRDI portal
Recommendations
- Strip based compact formulation for two-dimensional guillotine cutting problems
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Linear models for 1-group two-dimensional guillotine cutting problems
Cites work
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- A New Linear Programming Approach to the Cutting Stock Problem
- A dynamic programming approach for consistency and propagation for knapsack constraints
- A recursive algorithm for constrained two-dimensional cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An Algorithm for Two-Dimensional Cutting Problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- 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
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- An improved typology of cutting and packing problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Characterization and modelling of guillotine constraints
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Exact algorithms for the two-dimensional guillotine knapsack
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- LP models for bin packing and cutting stock problems
- Models and algorithms for three-stage two-dimensional bin packing
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- Multistage Cutting Stock Problems of Two and More Dimensions
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- On the two-dimensional knapsack problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Two-dimensional packing problems: a survey
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
Cited in
(30)- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- Exact solution techniques for two-dimensional cutting and packing
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Strip based compact formulation for two-dimensional guillotine cutting problems
- 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
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- Pattern-based diving heuristics for a two-dimensional guillotine cutting-stock problem with leftovers
- Mixed-integer and constraint programming models for the two-dimensional guillotine cutting problem
- On guillotine separable packings for the two-dimensional geometric knapsack problem
- Linear models for 1-group two-dimensional guillotine cutting problems
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- scientific article; zbMATH DE number 3932795 (Why is no real title available?)
- Two dimensional guillotine cutting stock and scheduling problem in printing industry
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems
- EATKG: an open-source efficient \underline{E}xact \underline{A}lgorithm for the \underline{T}wo-dimensional \underline{K}napsack problem with \underline{G}uillotine constraints
- A cutting plane method and a parallel algorithm for packing rectangles in a circular container
- Heuristics for packing semifluids
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- Arc flow formulations based on dynamic programming: theoretical foundations and applications
- A polynomial mixed-integer linear programming model for two-dimensional guillotine strip packing problem
- Extending the reflect flow formulation to variable-sized one-dimensional cutting and skiving stock problems
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- Tight approximation algorithms for 2D guillotine strip packing
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
This page was built for publication: Modeling two-dimensional guillotine cutting problems via integer programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2960367)
