2DPackLib: a two-dimensional cutting and packing library
From MaRDI portal
Publication:2115308
DOI10.1007/s11590-021-01808-yzbMath1487.90557OpenAlexW3207862177MaRDI QIDQ2115308
Vinícius Loti de Lima, Manuel Iori, Michele Monaci, Silvano Martello
Publication date: 15 March 2022
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-021-01808-y
Related Items
Cutting and packing problems under uncertainty: literature review and classification framework, Exact solution of network flow models with strong relaxations, 2DPackLib
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- 2DCPackGen: a problem generator for two-dimensional rectangular cutting and packing problems
- An exact dynamic programming algorithm for large-scale unconstrained two-dimensional guillotine cutting problems
- A heuristic approach based on dynamic programming and and/or-graph search for the constrained two-dimensional guillotine cutting problem
- Recent advances on two-dimensional bin packing problems
- A library of local search heuristics for the vehicle routing problem
- QAPLIB-A quadratic assignment problem library
- A new exact algorithm for general orthogonal d-dimensional knapsack problems
- A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
- QAPLIB - a quadratic assignment problem library
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- BPPLIB: a library for bin packing and cutting stock problems
- New benchmark instances for the capacitated vehicle routing problem
- LP bounds in various constraint programming approaches for orthogonal packing
- An improved version of Wang's algorithm for two-dimensional cutting problems
- A typology of cutting and packing problems
- Two-dimensional packing problems: a survey
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Improved state space relaxation for constrained two-dimensional guillotine cutting problems
- Exact solution techniques for two-dimensional cutting and packing
- Approximation and online algorithms for multidimensional bin packing: a survey
- A new constraint programming approach for the orthogonal packing problem
- An improved typology of cutting and packing problems
- Arc-flow model for the two-dimensional guillotine cutting stock problem
- Exact Solution of the Two-Dimensional Finite Bin Packing Problem
- The pallet loading problem: a review of solution methods and computational experiments
- An Exact Approach to the Strip-Packing Problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- Two-Dimensional Finite Bin-Packing Algorithms
- An Algorithm for Two-Dimensional Cutting Problems
- Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Exact algorithms for large-scale unconstrained two and three staged cutting problems
- A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
- Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
