Bin packing with rejection revisited
type: Item
instance of: scholarly article
title: Bin packing with rejection revisited
zbMATH Open document ID: 1187.68719
author: Leah Epstein
published in: Algorithmica
publication date: 2010-02-23T00:00:00Z
Mathematics Subject Classification ID: 68W27
Mathematics Subject Classification ID: 68W25
zbMATH DE Number: 5674259
zbMATH Keywords: bin packing
zbMATH Keywords: approximation schemes
zbMATH Keywords: online algorithms
MaRDI profile type: Publication
full work available at URL: s00453-008-9188-9
OpenAlex ID: W2063647078
cites work: Algorithms - ESA 2003
cites work: Multiprocessor Scheduling with Rejection
cites work: A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
cites work: Approximation schemes for ordered vector packing problems
cites work: Q3347319
cites work: Resource augmentation for online bounded space bin packing
cites work: Bin packing can be solved within 1+epsilon in linear time
cites work: The Tight Bound of First Fit Decreasing Bin-Packing Algorithm Is FFD(I) ≤ 11/9OPT(I) + 6/9
cites work: Bin packing problems with rejection penalties and their dual problems
cites work: Techniques for scheduling with rejection
cites work: AFPTAS Results for Common Variants of Bin Packing: A New Method for Handling the Small Items
cites work: Q4198056
cites work: Q2753942
cites work: Fast algorithms for bin packing
cites work: Worst-Case Performance Bounds for Simple One-Dimensional Packing Algorithms
cites work: A simple on-line bin-packing algorithm
cites work: On-line bin packing in linear time
cites work: On the online bin packing problem
cites work: Q4290987
cites work: Toeplitz Matrices Associated with a Semi-Infinite Laurent Series
cites work: An improved lower bound for on-line bin packing algorithms
cites work: New Algorithms for Bin Packing
cites work: A simple proof of the inequality \(\text{FFD}(L)\leq {11 \over 9} \text{OPT}(L)+1\), \(\forall L\) for the FFD bin-packing algorithm
cites work: Linear time-approximation algorithms for bin packing
DOI: 10.1007/S00453-008-9188-9
Recommended article: Bin Packing with Rejection Revisited
Recommended article: Computing and Combinatorics
Recommended article: Bin packing problems with rejection penalties and their dual problems
Recommended article: A Fast Asymptotic Approximation Scheme for Bin Packing with Rejection
Recommended article: A fast asymptotic approximation scheme for bin packing with rejection
Recommended article: Q4901211
Recommended article: Bin packing with divisible item sizes and rejection penalties
Recommended article: Batched bin packing revisited
Recommended article: Bin packing with fixed number of bins revisited
Recommended article: Bin Packing with Fixed Number of Bins Revisited
description: scientific article; zbMATH DE number 5674259