Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
From MaRDI portal
Publication:2960367
DOI10.1287/ijoc.2016.0710zbMath1355.90081WikidataQ57659040 ScholiaQ57659040MaRDI QIDQ2960367
Enrico Malaguti, Dimitri Thomopulos, Fabio Furini
Publication date: 8 February 2017
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/d82a32a6b420350d7fdf93b3745f0beca8325b25
Related Items
Enhanced Pseudo-polynomial Formulations for Bin Packing and Cutting Stock Problems, An introduction to the two‐dimensional rectangular cutting and packing problem, 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, Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry, Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem, Improved state space relaxation for constrained two-dimensional guillotine cutting problems, Exact solution techniques for two-dimensional cutting and packing, Enhanced formulation for the Guillotine 2D Cutting knapsack problem, Strip based compact formulation for two-dimensional guillotine cutting problems, Arc flow formulations based on dynamic programming: theoretical foundations and applications, Heuristics for packing semifluids, 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, A cutting plane method and a parallel algorithm for packing rectangles in a circular container, An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts, Two dimensional guillotine cutting stock and scheduling problem in printing industry, An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
Uses Software
Cites Work
- Models for the two-dimensional two-stage cutting stock problem with multiple stock size
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Characterization and modelling of guillotine constraints
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A recursive algorithm for constrained two-dimensional cutting problems
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- On the two-dimensional knapsack problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Two-dimensional packing problems: a survey
- LP models for bin packing and cutting stock problems
- A dynamic programming approach for consistency and propagation for knapsack constraints
- An improved typology of cutting and packing problems
- Models and algorithms for three-stage two-dimensional bin packing
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Using Decomposition Techniques and Constraint Programming for Solving the Two-Dimensional Bin-Packing Problem
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- 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
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Cutting and Reuse: An Application from Automobile Component Manufacturing
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- A New Linear Programming Approach to the Cutting Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- Multistage Cutting Stock Problems of Two and More Dimensions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
