A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
type: Item
instance of: scholarly article
title: A best-fit branch-and-bound heuristic for the unconstrained two-dimensional non-guillotine cutting problem
zbMATH Open document ID: 1403.90493
author: Lijun Wei
author: Qian Hu
author: Qiang Liu
author: Andrew Lim
published in: European Journal of Operational Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B80
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 6902947
zbMATH Keywords: packing
zbMATH Keywords: cutting
zbMATH Keywords: branch and bound
zbMATH Keywords: non-guillotine
zbMATH Keywords: best-fit
MaRDI profile type: Publication
full work available at URL: j.ejor.2018.04.014
OpenAlex ID: W2800796761
cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
cites work: A tabu search algorithm for a two-dimensional non-guillotine cutting problem
cites work: A parallel branch-and-bound approach to the rectangular guillotine strip cutting problem
cites work: A cutting-plane approach for the two-dimensional orthogonal non-guillotine cutting problem
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: A population heuristic for constrained two-dimensional non-guillotine cutting
cites work: LP Bounds in an Interval-Graph Algorithm for Orthogonal-Packing Feasibility
cites work: A note on an L-approach for solving the manufacturer's pallet loading problem
cites work: A genetic algorithm for the two-dimensional knapsack problem with rectangular pieces
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: On the two-dimensional knapsack problem
cites work: Algorithms for two-dimensional cutting stock and strip packing problems using dynamic programming and column generation
cites work: An Exact Algorithm for the Two-Dimensional Orthogonal Packing Problem with Unloading Constraints
cites work: Heuristic approaches for the two- and three-dimensional knapsack packing problem
cites work: An efficient approach for large-scale two-dimensional guillotine cutting stock problems
cites work: An Exact Algorithm for Higher-Dimensional Orthogonal Packing
cites work: Recursive Computational Procedure for Two-dimensional Stock Cutting
cites work: The DH/KD algorithm: A hybrid approach for unconstrained two-dimensional cutting problems
cites work: Exact algorithms for large-scale unconstrained two and three staged cutting problems
cites work: A recursive exact algorithm for weighted two-dimensional cutting
cites work: Une amélioration de l'algorithme récursif de Herz pour le problème de découpe à deux dimensions
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A new heuristic algorithm for rectangle packing
cites work: Exact algorithms for the two-dimensional strip packing problem with and without rotations
cites work: Exhaustive approaches to 2D rectangular perfect packings
cites work: A hybrid simulated annealing metaheuristic algorithm for the two-dimensional knapsack packing problem
cites work: An L-approach for packing (ℓ, w)-rectangles into rectangular and L-shaped pieces
cites work: An exact approach to the strip-packing problem
cites work: The Three-Dimensional Bin Packing Problem
cites work: A simple and effective recursive procedure for the manufacturer's pallet loading problem
cites work: An and-or-graph approach for two-dimensional cutting problems
cites work: An effective tabu search approach with improved loading algorithms for the 3L-CVRP
cites work: An improved typology of cutting and packing problems
cites work: A bidirectional building approach for the 2D constrained guillotine knapsack packing problem
cites work: A skyline heuristic for the 2D rectangular packing and strip packing problems
cites work: An efficient intelligent search algorithm for the two-dimensional rectangular strip packing problem
cites work: A least wasted first heuristic algorithm for the rectangular packing problem
Wikidata QID: Q129956574
DOI: 10.1016/J.EJOR.2018.04.014
description: scientific article; zbMATH DE number 6902947