Approximation algorithm for the oriented two-dimensional bin packing problem
type: Item
instance of: scholarly article
title: Approximation algorithm for the oriented two-dimensional bin packing problem
zbMATH Open document ID: 0937.90121
DOI: 10.1016/S0377-2217(97)00388-3
author: Andrea Lodi
author: Daniele Vigo
author: Silvano Martello
published in: European Journal of Operational Research
publication date: 2000-06-14T00:00:00Z
Mathematics Subject Classification ID: 90C59
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1358458
zbMATH Keywords: packing
zbMATH Keywords: cutting
zbMATH Keywords: heuristic
zbMATH Keywords: tabu search
MaRDI profile type: Publication
cites work: A typology of cutting and packing problems
cites work: On Packing Two-Dimensional Bins
cites work: Two-Dimensional Finite Bin-Packing Algorithms
cites work: Hybrid next-fit algorithm for the two-dimensional rectangle bin-packing problem
cites work: A Search-Based Heuristic For The Two-Dimensional Bin-Packing Problem
cites work: Exact solution of the two-dimensional finite bin packing problem
cites work: Packing problems
cites work: Q4398379
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: An Algorithm for Two-Dimensional Cutting Problems
cites work: Algorithms for Unconstrained Two-Dimensional Guillotine Cutting
cites work: An Exact Two-Dimensional Non-Guillotine Cutting Tree Search Procedure
description: scientific article; zbMATH DE number 1358458