Modeling two-dimensional guillotine cutting problems via integer programming
From MaRDI portal
Publication:2960367
DOI10.1287/IJOC.2016.0710zbMATH Open1355.90081OpenAlexW2529499916WikidataQ57659040 ScholiaQ57659040MaRDI QIDQ2960367FDOQ2960367
Authors: Fabio Furini, Enrico Malaguti, Dimitri Thomopulos 
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
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
- An improved typology of cutting and packing problems
- A New Bottom-Left-Fill Heuristic Algorithm for the Two-Dimensional Irregular Packing Problem
- Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
- LP models for bin packing and cutting stock problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two-dimensional packing problems: a survey
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A recursive algorithm for constrained two-dimensional cutting problems
- On the two-dimensional knapsack problem
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
- A Nested Decomposition Approach to a Three-Stage, Two-Dimensional Cutting-Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Approximate and exact algorithms for constrained (un)weighted two-dimensional two-staged cutting stock problems
- Characterization and modelling of guillotine constraints
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- A dynamic programming approach for consistency and propagation for knapsack constraints
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- An improvement of Viswanathan and Bagchi's exact algorithm for constrained two-dimensional cutting stock
- Models and algorithms for three-stage two-dimensional bin packing
- A New Linear Programming Approach to the Cutting Stock Problem
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- 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
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- Exact algorithms for the two-dimensional guillotine knapsack
- Cutting and Reuse: An Application from Automobile Component Manufacturing
Cited In (24)
- 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
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- 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
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Linear models for 1-group two-dimensional guillotine cutting problems
- 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
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Title not available (Why is that?)
- 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
- 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
- Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry
- A comparative numerical analysis for the guillotine two-dimensional cutting problem
- Enhanced formulation for the Guillotine 2D Cutting knapsack problem
Uses Software
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)
