Recent advances on two-dimensional bin packing problems
type: Item
instance of: scholarly article
title: Recent advances on two-dimensional bin packing problems
zbMATH Open document ID: 1022.90020
DOI: 10.1016/S0166-218X(01)00347-X
author: Daniele Vigo
author: Andrea Lodi
author: Silvano Martello
published in: Discrete Applied Mathematics
publication date: 2002-09-17T00:00:00Z
review text: The paper is the survey of recent advances obtained for the two-dimensional bin packing problem with special emphasis on exact algorithms and effective heuristic and metaheuristic approaches. The authors consider only off-line heuristic algorithms, for which it is assumed that the algorithm has full knowledge of the whole input. In particular it is presented some estimations of the optimal solution value. It is given the extensive list of the literature on this theme.
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 90B80
zbMATH DE Number: 1801738
zbMATH Keywords: bin packing problems
zbMATH Keywords: algorithms
zbMATH Keywords: survey
describes a project that uses: Tabu search
MaRDI profile type: Publication
cites work: Q4339078
cites work: A algorithm for two-dimensional packing
cites work: Orthogonal Packings in Two Dimensions
cites work: Shelf Algorithms for Two-Dimensional Packing Problems
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: An improved BL lower bound
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: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Q4035170
cites work: Packings in two dimensions: Asymptotic average-case analysis of algorithms
cites work: Online algorithms. The state of the art
cites work: A lower bound for the non-oriented two-dimensional bin packing problem
cites work: Optimal Scheduling of Tasks on Identical Parallel Processors
cites work: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
cites work: Q3840364
cites work: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
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: Q4354785
cites work: Performance Bounds for Orthogonal Oriented Two-Dimensional Packing Algorithms
cites work: An exact algorithm for general, orthogonal, two-dimensional knapsack problems
cites work: An exact algorithm for orthogonal 2-D cutting problems using guillotine cuts
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: A near-optimal solution to a two-dimensional cutting stock problem
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: Heuristic algorithms for the three-dimensional bin packing problem
cites work: Integer linear programming models for 2-staged two-dimensional knapsack problems
cites work: Q3993418
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: A 2.5 times optimal algorithm for packing in two dimensions
cites work: A Strip-Packing Algorithm with Absolute Performance Bound 2
description: scientific article; zbMATH DE number 1801738