Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
From MaRDI portal
Publication:6067890
DOI10.1111/itor.12687OpenAlexW2948563589WikidataQ127791152 ScholiaQ127791152MaRDI QIDQ6067890
Aantonio Sforza, Mauro Russo, Maurizio Boccia, Claudio Sterle
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/itor.12687
integer programmingcombinatorial optimizationcutting problemscutting stockliterature reviewbounding strategiesupper-bound categorization
Related Items (11)
Two dimensional guillotine cutting stock and scheduling problem in printing industry ⋮ An introduction to the two‐dimensional rectangular cutting and packing problem ⋮ Cutting and packing problems under uncertainty: literature review and classification framework ⋮ Exact approaches for the unconstrained two-dimensional cutting problem with defects ⋮ A cutting stock problem in the wood products industry: a two‐stage solution approach ⋮ Mathematical models for the two-dimensional variable-sized cutting stock problem in the home textile industry ⋮ Keep your distance: land division with separation ⋮ 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 ⋮ 2DPackLib: a two-dimensional cutting and packing library
Cites Work
- Unnamed Item
- Unnamed Item
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- Three insertion heuristics and a justification improvement heuristic for two-dimensional bin packing with guillotine cuts
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- A column generation heuristic for the two-dimensional two-staged guillotine cutting stock problem with multiple stock size
- Improving the efficiency of a best-first bottom-up approach for the constrained 2D cutting problem
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A constructive bin-oriented heuristic for the two-dimensional bin packing problem with guillotine cuts
- A recursive branch-and-bound algorithm for constrained homogeneous T-shape cutting patterns
- A general framework for bounds for higher-dimensional orthogonal packing problems.
- Classification and literature review of integrated lot-sizing and cutting stock problems
- The minimum raster set problem and its application to the \(d\)-dimensional orthogonal packing problem
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- Characterization and modelling of guillotine constraints
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- An agent-based approach to the two-dimensional guillotine bin packing problem
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- A branch and bound algorithm for the strip packing problem
- A recursive algorithm for constrained two-dimensional cutting problems
- Exact solutions for constrained two-dimensional cutting problems
- Dynamic programming algorithms for the zero-one knapsack problem
- A recursive exact algorithm for weighted two-dimensional cutting
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- 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
- A best-first branch and bound algorithm for unconstrained two-dimensional cutting problems.
- On the two-dimensional knapsack problem
- A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- Exact algorithms for the two-dimensional guillotine knapsack
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Conservative scales in packing problems
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Optimization and decision science: methodologies and applications. ODS, Sorrento, Italy, September 4--7, 2017
- An EDA for the 2D knapsack problem with guillotine constraint
- Simple block patterns for the two-dimensional cutting problem
- Sequential heuristic for the two-dimensional bin-packing problem
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- Models and algorithms for three-stage two-dimensional bin packing
- An integrated cutting stock and sequencing problem
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- One-dimensional cutting stock with a limited number of open stacks: bounds and solutions from a new integer linear programming model
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Heuristics for the combined cut order planning two-dimensional layout problem in the apparel industry
- An Exact Approach to the Strip-Packing Problem
- GRASP and Path Relinking for the Two-Dimensional Two-Stage Cutting-Stock Problem
- An Exact Algorithm for the Two-Dimensional Stage-Unrestricted Guillotine Cutting/Packing Decision Problem
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- An improved best-first branch-and-bound algorithm for unconstrained two-dimensional cutting problems
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- One-dimensional relaxations and LP bounds for orthogonal packing
- Using Wang's two-dimensional cutting stock algorithm to optimally solve difficult problems
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A new upper bound for unconstrained two-dimensional cutting and packing
- Checkerboard pattern: proposals for its generation
- The G4-Heuristic for the Pallet Loading Problem
- New upper bounds for the two-dimensional orthogonal non-guillotine cutting stock problem
- The Meet-in-the-Middle Principle for Cutting and Packing Problems
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Linear models for 1-group two-dimensional guillotine cutting problems
- The Theory and Computation of Knapsack Functions
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- The multiperiod two‐dimensional non‐guillotine cutting stock problem with usable leftovers
- A heuristic for the skiving and cutting stock problem in paper and plastic film industries
This page was built for publication: Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
