Sciweavers

2 search results - page 1 / 1
» Bin Completion Algorithms for Multicontainer Packing, Knapsa...
Sort
View
JAIR
2007
141views more  JAIR 2007»
13 years 4 months ago
Bin Completion Algorithms for Multicontainer Packing, Knapsack, and Covering Problems
Many combinatorial optimization problems such as the bin packing and multiple knapsack problems involve assigning a set of discrete objects to multiple containers. These problems ...
Alex S. Fukunaga, Richard E. Korf
FOCS
2006
IEEE
13 years 10 months ago
Improved approximation algorithms for multidimensional bin packing problems
In this paper we introduce a new general framework for set covering problems, based on the combination of randomized rounding of the (near-)optimal solution of the Linear Programm...
Nikhil Bansal, Alberto Caprara, Maxim Sviridenko