Sciweavers

28 search results - page 1 / 6
» Bin packing with controllable item sizes
Sort
View
IANDC
2008
111views more  IANDC 2008»
13 years 4 months ago
Bin packing with controllable item sizes
We consider a natural resource allocation problem in which we are given a set of items, where each item has a list of pairs associated with it. Each pair is a configuration of an a...
José R. Correa, Leah Epstein
IPL
2008
132views more  IPL 2008»
13 years 4 months ago
Asymptotic fully polynomial approximation schemes for variants of open-end bin packing
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
Leah Epstein, Asaf Levin
ESA
1993
Springer
140views Algorithms» more  ESA 1993»
13 years 8 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
ESA
2008
Springer
148views Algorithms» more  ESA 2008»
13 years 6 months ago
Selfish Bin Packing
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by se...
Leah Epstein, Elena Kleiman
DISOPT
2008
59views more  DISOPT 2008»
13 years 4 months ago
More on online bin packing with two item sizes
We follow the work of [7] and study the online bin packing problem, where every item has one of two possible sizes which are known in advance. We focus on the parametric case, whe...
Leah Epstein, Asaf Levin