Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
From MaRDI portal
Publication:1278342
DOI10.1016/0377-2217(95)00128-XzbMATH Open0947.90537WikidataQ57719580 ScholiaQ57719580MaRDI QIDQ1278342FDOQ1278342
Authors: Reinaldo Morabito, Marcos N. Arenales 
Publication date: 8 November 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Recommendations
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An and-or-graph approach for two-dimensional cutting problems
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- An Exact Algorithm for Constrained Two-Dimensional Two-Staged Cutting Problems
- Algorithms for the constrained two-staged two-dimensional cutting problem
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems
- Modeling two-dimensional guillotine cutting problems via integer programming
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Cites Work
- Cutting and packing. Special issue
- Title not available (Why is that?)
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- A typology of cutting and packing problems
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- An Algorithm for Two-Dimensional Cutting Problems
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- Packing problems
- Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
- An AND/OR-graph approach to the container loading problem
- Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- An improved version of Wang's algorithm for two-dimensional cutting problems
- An and-or-graph approach for two-dimensional cutting problems
Cited In (40)
- Heuristic algorithm for a cutting stock problem in the steel bridge construction
- A note on linear models for two-group and three-group two-dimensional guillotine cutting problems
- A beam search algorithm for the biobjective container loading problem
- Exact solution techniques for two-dimensional cutting and packing
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- An introduction to the two‐dimensional rectangular cutting and packing problem
- Two-stage two-dimensional guillotine cutting stock problems with usable leftover
- Exact algorithm for generating two-segment cutting patterns of punched strips
- Strip generation algorithms for constrained two-dimensional two-staged cutting problems
- Models for the two‐dimensional rectangular single large placement problem with guillotine cuts and constrained pattern
- Optimising the cutting of wood fibre plates in the hardboard industry
- A linear optimization approach to the combined production planning model
- A parallel algorithm for two-staged two-dimensional fixed-orientation cutting problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
- Heuristic for constrained T-shape cutting patterns of rectangular pieces
- Queue-constrained packing: a vehicle ferry case study
- A cooperative algorithm for constrained two-staged two-dimensional cutting problems
- The cutting stock problem in a hardboard industry: A case study.
- Linear models for 1-group two-dimensional guillotine cutting problems
- A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem
- A recursive algorithm for constrained two-dimensional cutting problems
- A heuristic algorithm for container loading of pallets with infill boxes
- Combining dynamic programming with filtering to solve a four-stage two-dimensional guillotine-cut bounded knapsack problem
- An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
- An improved typology of cutting and packing problems
- An MIP-CP based approach for two- and three-dimensional cutting problems with staged guillotine cuts
- A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
- An EDA for the 2D knapsack problem with guillotine constraint
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- A new dynamic programming procedure for three-staged cutting patterns
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Approximate and exact algorithms for the double-constrained two-dimensional guillotine cutting stock problem
- A worst case analysis of a dynamic programming-based heuristic algorithm for 2D unconstrained guillotine cutting
- Heurísticas para os problemas de geração e sequenciamento de padrões de corte bidimensionais
- An and-or-graph approach for two-dimensional cutting problems
- Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
- An enumeration scheme to generate constrained exact checkerboard patterns
- An integrated cutting stock and sequencing problem
- Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach
- An exact algorithm for the two-dimensional stage-unrestricted guillotine cutting/packing decision problem
This page was built for publication: Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1278342)
