Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach

DOI10.1007/978-3-642-00142-0_14MaRDI QIDQ5391994zbMATH OpenOpenAlexFDO

Authors Vera Neidlein, Andrea Carla G. Vianna, Gerhard Wäscher, Marcos N. Arenales

Publication date 7 April 2011

Published in Operations Research Proceedings 2008 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-00142-0_14

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Recommendations

• An and-or-graph approach for two-dimensional cutting problems
• An AND/OR-graph approach to the solution of two-dimensional non-guillotine cutting problems
• 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
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects

Cited in

(8)

• 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
• Staged and constrained two-dimensional guillotine cutting problems: an AND/OR-graph approach
• A MIP model and a biased random-key genetic algorithm based approach for a two-dimensional cutting problem with defects
• SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
• A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
• Exact approaches for the unconstrained two-dimensional cutting problem with defects
• One-dimensional stock cutting resilient against singular random defects

This page was built for publication: Two-dimensional guillotineable-layout cutting problems with a single defect -- an AND/OR-graph approach

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5391994)