A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
From MaRDI portal
Publication:1651697
DOI10.1016/j.ejor.2018.04.014zbMath1403.90493OpenAlexW2800796761WikidataQ129956574 ScholiaQ129956574MaRDI QIDQ1651697
Qian Hu, Lijun Wei, Qiang Liu, Andrew E. B. Lim
Publication date: 12 July 2018
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2018.04.014
Related Items (2)
A cutting plane method and a parallel algorithm for packing rectangles in a circular container ⋮ Constrained two‐dimensional guillotine cutting problem: upper‐bound review and categorization
Cites Work
- An effective tabu search approach with improved loading algorithms for the 3L-CVRP
- A skyline heuristic for the 2D rectangular packing and strip packing problems
- A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
- A new heuristic algorithm for rectangle packing
- 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
- A least wasted first heuristic algorithm for the rectangular packing problem
- Exact algorithms for the two-dimensional strip packing problem with and without rotations
- An and-or-graph approach for two-dimensional cutting problems
- A recursive exact algorithm for weighted two-dimensional cutting
- The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
- On the two-dimensional knapsack problem
- An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
- A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
- A population heuristic for constrained two-dimensional non-guillotine cutting
- Exhaustive approaches to 2D rectangular perfect packings
- An improved typology of cutting and packing problems
- A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
- A tabu search algorithm for a two-dimensional non-guillotine cutting problem
- An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
- An Exact Approach to the Strip-Packing Problem
- A Parallel Branch-and-Bound Approach to the Rectangular Guillotine Strip Cutting Problem
- An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
- A simple and effective recursive procedure for the manufacturer's pallet loading problem
- An efficient approach for large-scale two-dimensional guillotine cutting stock problems
- A note on an L-approach for solving the manufacturer's pallet loading problem
- An Exact Algorithm for Higher-Dimensional Orthogonal Packing
- A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
- An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
- Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
- The Three-Dimensional Bin Packing Problem
- An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
- LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
- A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
- Recursive Computational Procedure for Two-dimensional Stock Cutting
- Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
- 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
This page was built for publication: A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
