Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
SWAT
2010
Springer
294views Algorithms» more  SWAT 2010»
10 years 11 months ago
Bin Packing with Fixed Number of Bins Revisited
As Bin Packing is NP-hard already for k = 2 bins, it is unlikely to be solvable in polynomial time even if the number of bins is a fixed constant. However, if the sizes of the item...
Klaus Jansen, Stefan Kratsch, Dániel Marx, ...
CP
2010
Springer
11 years 1 days ago
Propagating the Bin Packing Constraint Using Linear Programming
The state-of-the-art global constraint for bin packing is due to Shaw. We compare two linear continuous relaxations of the bin packing problem, based on the DP-flow and Arc-flow ...
Hadrien Cambazard, Barry O'Sullivan
SIAMCOMP
2008
132views more  SIAMCOMP 2008»
11 years 1 months ago
An APTAS for Generalized Cost Variable-Sized Bin Packing
Bin packing is a well known problem which has a large number of applications. Classical bin packing is a simple model where all bins are identical. In the bin packing problem with...
Leah Epstein, Asaf Levin
CORR
2010
Springer
97views Education» more  CORR 2010»
11 years 1 months ago
Bin Packing via Discrepancy of Permutations
A well studied special case of bin packing is the 3-partition problem, where n items of size > 1 4 have to be packed in a minimum number of bins of capacity one. The famous Kar...
Friedrich Eisenbrand, Dömötör P&aac...
ALGORITHMICA
2010
155views more  ALGORITHMICA 2010»
11 years 1 months ago
Bin Packing with Rejection Revisited
We consider the following generalization of bin packing. Each item is associated with a size bounded by 1, as well as a rejection cost, that an algorithm must pay if it chooses not...
Leah Epstein
IJCAI
2003
11 years 2 months ago
An Improved Algorithm for Optimal Bin Packing
Given a set of numbers, and a set of bins of fixed capacity, the NP-complete problem of bin packing is to find the minimum number of bins needed to contain the numbers, such that ...
Richard E. Korf
SODA
2001
ACM
166views Algorithms» more  SODA 2001»
11 years 2 months ago
Better approximation algorithms for bin covering
Bin covering takes as input a list of items with sizes in (0 1) and places them into bins of unit demand so as to maximize the number of bins whose demand is satis ed. This is in ...
János Csirik, David S. Johnson, Claire Keny...
ESA
1993
Springer
140views Algorithms» more  ESA 1993»
11 years 5 months ago
Fully Dynamic Algorithms for Bin Packing: Being (mostly) Myopic Helps
The problem of maintaining an approximate solution for one-dimensional bin packing when items may arrive and depart dynamically is studied. In accordance with various work on fully...
Zoran Ivkovic, Errol L. Lloyd
WAOA
2004
Springer
142views Algorithms» more  WAOA 2004»
11 years 6 months ago
This Side Up!
Abstract. We consider two- and three-dimensional bin packing problems where 90◦ rotations are allowed. We improve all known asymptotic performance bounds for these problems. In p...
Leah Epstein, Rob van Stee
FCT
2005
Springer
11 years 7 months ago
The Maximum Resource Bin Packing Problem
Usually, for bin packing problems, we try to minimize the number of bins used or in the case of the dual bin packing problem, maximize the number or total size of accepted items. ...
Joan Boyar, Leah Epstein, Lene M. Favrholdt, Jens ...
books