Sciweavers

50 search results - page 4 / 10
» Approximation schemes for multidimensional packing
Sort
View
WAOA
2005
Springer
90views Algorithms» more  WAOA 2005»
14 years 2 months ago
Approximation Schemes for Packing with Item Fragmentation
Hadas Shachnai, Tami Tamir, Omer Yehezkely
WEA
2007
Springer
107views Algorithms» more  WEA 2007»
14 years 2 months ago
Trunk Packing Revisited
For trunk packing problems only few approximation schemes are known, mostly designed for the European standard DIN 70020 [6] with equally sized boxes [8, 9, 11, 12]. In this paper ...
Ernst Althaus, Tobias Baumann, Elmar Schömer,...
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
WADS
2001
Springer
86views Algorithms» more  WADS 2001»
14 years 29 days ago
Practical Approximation Algorithms for Separable Packing Linear Programs
Abstract. We describe fully polynomial time approximation schemes for generalized multicommodity flow problems arising in VLSI applications such as Global Routing via Buffer Block...
Feodor F. Dragan, Andrew B. Kahng, Ion I. Mandoiu,...