SLOPPGEN: a problem generator for the two-dimensional rectangular single large object placement problem with defects
From MaRDI portal
Publication:2803261
DOI10.1111/itor.12119zbMath1335.90083OpenAlexW2103102443MaRDI QIDQ2803261
Vera Neidlein, Gerhard Wäscher, André Scholz
Publication date: 4 May 2016
Published in: International Transactions in Operational Research (Search for Journal in Brave)
Full work available at URL: http://www.fww.ovgu.de/fww_media/femm/femm_2012/2012_28.pdf
Related Items
Exact approaches for the unconstrained two-dimensional cutting problem with defects, A heuristic, dynamic programming-based approach for a two-dimensional cutting problem with defects
Uses Software
Cites Work
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- An and-or-graph approach for two-dimensional cutting problems
- 4-block heuristic for the rectangle packing problem
- An exact algorithm for general, orthogonal, two-dimensional knapsack problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An improved typology of cutting and packing problems
- 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
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- The Bin‐Packing Problem: A Problem Generator and Some Numerical Experiments with FFD Packing and MTP
- An Algorithm for Two-Dimensional Cutting Problems
- Multistage Cutting Stock Problems of Two and More Dimensions
- Two-Dimensional Guillotineable-Layout Cutting Problems with a Single Defect - An AND/OR-Graph Approach
- A new uniform pseudorandom number generator
- Recursive Computational Procedure for Two-dimensional Stock Cutting
