2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
From MaRDI portal
Publication:296590
DOI10.1016/j.ejor.2014.02.059zbMath1338.90355OpenAlexW2058830640MaRDI QIDQ296590
Elsa Silva, Gerhard Wäscher, José Fernando Oliveira
Publication date: 23 June 2016
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2014.02.059
Discrete geometry (52Cxx) Combinatorial optimization (90C27) Software, source code, etc. for problems pertaining to operations research and mathematical programming (90-04)
Related Items (14)
Heuristic-based energy landscape paving for the circular packing problem with performance constraints of equilibrium ⋮ A diversity-based genetic algorithm for scenario generation ⋮ A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ A heuristic approach to minimize the number of saw cycles in small-scale furniture factories ⋮ Ejection chain moves for automatic neighborhood synthesis in constrained cardinality‐minimization problems ⋮ The evolution of rectangular bin packing problem -- a review of research topics, applications, and cited papers ⋮ A mathematical modeling approach to optimize composite parts placement in autoclave ⋮ Applying machine learning for the anticipation of complex nesting solutions in hierarchical production planning ⋮ A new load balance methodology for container loading problem in road transportation ⋮ Exact methods for three-dimensional cutting and packing: a comparative study concerning single container problems ⋮ Exact solution techniques for two-dimensional cutting and packing ⋮ A bottom-up packing approach for modeling the constrained two-dimensional guillotine placement problem ⋮ Strip based compact formulation for two-dimensional guillotine cutting problems ⋮ 2DPackLib: a two-dimensional cutting and packing library
Uses Software
Cites Work
- Unnamed Item
- Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
- Heuristic approaches for the two- and three-dimensional knapsack packing problem
- CUTGEN1: A problem generator for the standard one-dimensional cutting stock problem
- On the two-dimensional knapsack problem
- A typology of cutting and packing problems
- A population heuristic for constrained two-dimensional non-guillotine cutting
- An improved typology of cutting and packing problems
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- A More Portable Fortran Random Number Generator
- A new uniform pseudorandom number generator
- Data set generation for rectangular placement problems
This page was built for publication: 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
