Sciweavers

106 search results - page 6 / 22
» An Improved Algorithm for Optimal Bin Packing
Sort
View
WAOA
2010
Springer
256views Algorithms» more  WAOA 2010»
13 years 6 months ago
The Train Delivery Problem - Vehicle Routing Meets Bin Packing
Abstract. We consider the train delivery problem which is a generalization of the bin packing problem and is equivalent to a one dimensional version of the vehicle routing problem ...
Aparna Das, Claire Mathieu, Shay Mozes
IPCO
2008
129views Optimization» more  IPCO 2008»
13 years 9 months ago
A Polynomial Time Approximation Scheme for the Square Packing Problem
Given a set Q of squares with positive pro ts, the square packing problem is to select and pack a subset of squares of maximum pro t into a rectangular bin R. We present a polynomi...
Klaus Jansen, Roberto Solis-Oba
STOC
2005
ACM
143views Algorithms» more  STOC 2005»
14 years 1 months ago
On strip packing With rotations
We present an asymptotic fully polynomial time approximation scheme for two-dimensional strip packing with rotations. In this problem, a set of rectangles need to be packed into a...
Klaus Jansen, Rob van Stee
TCS
2008
13 years 8 months ago
Bincoloring
We introduce a new problem that was motivated by a (more complicated) problem arising in a robotized assembly environment. The bin coloring problem is to pack unit size colored it...
Sven Oliver Krumke, Willem de Paepe, Jörg Ram...
CORR
2006
Springer
91views Education» more  CORR 2006»
13 years 8 months ago
Improved results for a memory allocation problem
We consider a memory allocation problem. This problem can be modeled as a version of bin packing where items may be split, but each bin may contain at most two (parts of) items. T...
Leah Epstein, Rob van Stee