Two-dimensional bin packing with one-dimensional resource augmentation
type: Item
instance of: scholarly article
title: Two-dimensional bin packing with one-dimensional resource augmentation
zbMATH Open document ID: 1278.90325
author: N. Bansal
author: Maxim Sviridenko
published in: Discrete Optimization
publication date: 2008-01-18T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 5228527
zbMATH Keywords: bin packing
zbMATH Keywords: approximation scheme
MaRDI profile type: MaRDI publication profile
full work available at URL: j.disopt.2006.09.001
OpenAlex ID: W2087645523
cites work: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
cites work: Approximation algorithms for NP-hard problems.
cites work: Bin Packing with Discrete Item Sizes, Part I: Perfect Packing Theorems and the Average Case Behavior of Optimal Packings
cites work: Performance Bounds for Level-Oriented Two-Dimensional Packing Algorithms
cites work: Online algorithms. The state of the art
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: A near-optimal solution to a two-dimensional cutting stock problem
cites work: Two-dimensional packing problems: a survey
DOI: 10.1016/J.DISOPT.2006.09.001
Recommended article: New approximability and inapproximability results for 2-dimensional bin packing
Recommended article: New approximability results for two-dimensional bin packing
Recommended article: Bin Packing in Multiple Dimensions: Inapproximability Results and Approximation Schemes
Recommended article: Two for One: Tight Approximation of 2D Bin Packing
description: scientific article; zbMATH DE number 5228527