An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems

DOI10.1016/0377-2217(95)00026-MzbMath0928.90074OpenAlexW2054093527WikidataQ57719584 ScholiaQ57719584MaRDI QIDQ1127217

Reinaldo Morabito, Marcos Nereu Arenales

Publication date: 13 August 1998

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0377-2217(95)00026-m

zbMATH Keywords

AND/OR-graphunconstrained two-dimensional non-guillotine cutting

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items

A population heuristic for constrained two-dimensional non-guillotine cutting, A hybrid evolutionary algorithm for the two-dimensional packing problem, Solving the pallet loading problem, A hybrid genetic algorithm for the two-dimensional single large object placement problem, A tabu search algorithm for a two-dimensional non-guillotine cutting problem, The one dimensional Compartmentalised Knapsack problem: a case study, An integrated cutting stock and sequencing problem, An EDA for the 2D knapsack problem with guillotine constraint, A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects, Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation, A fast algorithm for two-dimensional pallet loading problems of large size, Um método heurístico baseado em relaxação Lagrangiana para o problema de carregamento de paletes do produtor, Classification and literature review of integrated lot-sizing and cutting stock problems, The pallet loading problem: a review of solution methods and computational experiments, Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach, A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces, The pinwheel pattern and its application to the manufacturer's pallet-loading problem, Applying genetic algorithms and neural networks to the container loading problem, Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem, An \(n\)-tet graph approach for non-guillotine packings of \(n\)-dimensional boxes into an \(n\)-container, An exact depth-first algorithm for the pallet loading problem, An efficient algorithm for searching implicit AND/OR graphs with cycles

Cites Work

• Network flows and non-guillotine cutting patterns
• An and-or-graph approach for two-dimensional cutting problems
• Packing problems
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• An exact algorithm for the pallet loading problem
• A typology of cutting and packing problems
• Efficient automated pallet loading
• The Three-Dimensional Pallet Chart: An Analysis of the Factors Affecting the Set of Feasible Layouts for a Class of Two-Dimensional Packing Problems
• An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
• Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
• An Algorithm for Two-Dimensional Cutting Problems
• Performance Of Two Heuristics For Solving Large Scale Two-Dimensional Guillotine Cutting Problems
• An AND/OR-graph approach to the container loading problem
• Multistage Cutting Stock Problems of Two and More Dimensions
• Recursive Computational Procedure for Two-dimensional Stock Cutting