Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
From MaRDI portal
Publication:6067889
DOI10.1111/itor.12703WikidataQ122112912 ScholiaQ122112912MaRDI QIDQ6067889
Ernesto G. Birgin, Mateus Martin, Pedro Augusto Munari, Reinaldo Morabito, Rafael D. Lobato
Publication date: 17 November 2023
Published in: International Transactions in Operational Research (Search for Journal in Brave)
integer programming modelscutting and packing problemsbranch-and-Benders-cut algorithmconstrained two-dimensional guillotine cuts
Related Items
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 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
Cites Work
- GLOMIQO: global mixed-integer quadratic optimizer
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Classification and literature review of integrated lot-sizing and cutting stock problems
- An integer programming model for two- and three-stage two-dimensional cutting stock problems
- Exact solutions for constrained two-dimensional cutting problems
- Partitioning procedures for solving mixed-variables programming problems
- Solution for the constrained Guillotine cutting problem by simulated annealing
- Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
- An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
- Integer linear programming models for 2-staged two-dimensional knapsack problems
- Introduction to cutting and packing optimization. Problems, modeling approaches, solution methods
- A branch-and-Benders-cut algorithm for the crew scheduling and routing problem in road restoration
- The Benders decomposition algorithm: a literature review
- The value of integrating loading and routing
- Exact algorithms for the two-dimensional guillotine knapsack
- A survey on Benders decomposition applied to fixed-charge network design problems
- Dynamic programming and hill-climbing techniques for constrained two-dimensional cutting stock problems
- A polyhedral branch-and-cut approach to global optimization
- An improved version of Wang's algorithm for two-dimensional cutting problems
- Two-dimensional packing problems: a survey
- Analyzing the computational impact of MIQCP solver components
- Connections between cutting-pattern sequencing, VLSI design, and flexible machines
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- ANTIGONE: algorithms for coNTinuous/Integer global optimization of nonlinear equations
- An enumeration scheme to generate constrained exact checkerboard patterns
- A branch-and-cut-and-price algorithm for one-dimensional stock cutting and two-dimensional two-stage cutting
- 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
- Modeling Two-Dimensional Guillotine Cutting Problems via Integer Programming
- 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
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- A New Linear Programming Approach to the Cutting Stock Problem
- An Algorithm for Two-Dimensional Cutting Problems
- Best-First Search Methods for Constrained Two-Dimensional Cutting Stock Problems
- Checkerboard pattern: proposals for its generation
- Multistage Cutting Stock Problems of Two and More Dimensions
- Linear models for 1-group 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
