New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
type: Item
instance of: scholarly article
title: New and improved level heuristics for the rectangular strip packing and variable-sized bin packing problems
zbMATH Open document ID: 1177.90349
author: Frank G. Ortmann
author: Nthabiseng Ntene
author: J. H. van Vuuren
published in: European Journal of Operational Research
publication date: 2009-12-21T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90C59
zbMATH DE Number: 5650824
zbMATH Keywords: bin packing
zbMATH Keywords: strip packing
MaRDI profile type: Publication
full work available at URL: j.ejor.2009.07.024
OpenAlex ID: W2078833192
cites work: A computational study of LP-based heuristic algorithms for two-dimensional guillotine cutting stock problems
cites work: A tabu search algorithm for large-scale guillotine (un)constrained two-dimensional cutting problems
cites work: A GRASP algorithm for constrained two-dimensional non-guillotine cutting problems
cites work: A tabu search algorithm for a two-dimensional non-guillotine cutting problem
cites work: Reactive GRASP for the strip-packing problem
cites work: A algorithm for two-dimensional packing
cites work: Orthogonal Packings in Two Dimensions
cites work: One-dimensional heuristics adapted for two-dimensional rectangular strip packing
cites work: An algorithm for a cutting stock problem on a strip
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: A genetic algorithm for the two-dimensional strip packing problem with rectangular pieces
cites work: A New Placement Heuristic for the Orthogonal Stock-Cutting Problem
cites work: The Bottomn-Left Bin-Packing Heuristic: An Efficient Implementation
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: On Packing Two-Dimensional Bins
cites work: A new exact method for the two-dimensional bin-packing problem with fixed orientation
cites work: Q3002852
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Average-case analysis of cutting and packing in two dimensions
cites work: Heuristic and exact algorithms for generating homogeneous constrained three-staged cutting patterns
cites work: A recursive branch-and-bound algorithm for the rectangular guillotine strip packing problem
cites work: A typology of cutting and packing problems
cites work: The trim problem
cites work: An application of simulated annealing to the cutting stock problem
cites work: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
cites work: Variable Sized Bin Packing
cites work: A Linear Programming Approach to the Cutting-Stock Problem
cites work: A Linear Programming Approach to the Cutting Stock Problem—Part II
cites work: Multistage Cutting Stock Problems of Two and More Dimensions
cites work: Performance Bound for Bottom-Left Guillotine Packing of Rectangles
cites work: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
cites work: Evaluation of algorithms for one-dimensional cutting
cites work: Constrained two-dimensional cutting: an improvement of Christofides and Whitlock's exact algorithm
cites work: An empirical investigation of meta-heuristic and heuristic algorithms for a 2D packing problem
cites work: A review of the application of meta-heuristic algorithms to 2D strip packing problems
cites work: On genetic algorithms for the packing of polygons
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: Algorithms for the variable sized bin packing problem
cites work: Mathematical methods of organizing and planning production. English translation by Robert W. Campbell and W. H. Marlow
cites work: An improved BL-algorithm for genetic algorithm of the orthogonal packing of rectangles
cites work: Two-dimensional packing problems: a survey
cites work: Q4495176
cites work: Approximation algorithm for the oriented two-dimensional bin packing problem
cites work: Heuristic and Metaheuristic Approaches for a Class of Two-Dimensional Bin Packing Problems
cites work: Recent advances on two-dimensional bin packing problems
cites work: Models and bounds for two-dimensional level packing problems
cites work: An exact approach to the strip-packing problem
cites work: Algorithms for packing and scheduling problems. (Abstract of thesis)
cites work: A survey and comparison of guillotine heuristics for the 2D oriented offline strip packing problem
cites work: The two-dimensional bin packing problem with variable bin sizes and costs
cites work: Using decomposition techniques and constraint programming for solving the two-dimensional bin-packing problem
cites work: Some experiments with a simple tabu search algorithm for the manufacturer's pallet loading problem
cites work: A 2.5 times optimal algorithm for packing in two dimensions
cites work: Cutting and Packing Problems: A Categorized, Application-Orientated Research Bibliography
cites work: Two Algorithms for Constrained Two-Dimensional Cutting Stock Problems
cites work: Data set generation for rectangular placement problems
cites work: An improved typology of cutting and packing problems
DOI: 10.1016/J.EJOR.2009.07.024
description: scientific article; zbMATH DE number 5650824