On multi-dimensional packing problems

On multi-dimensional packing problems,10.1145/314500.314555,Chandra Chekuri,Sanjeev Khanna

On multi-dimensional packing problems   (Citations: 52)
BibTex | RIS | RefWorks Download
We study the approximability of multi-dimensional generalizationsof the classical problems of multiprocessor scheduling,bin packing and the knapsack problem. Specifically,we study the vector scheduling problem, its dual problem,namely, the vector bin packing problem, and a class of packinginteger programs. The vector scheduling problem is toschedule n d-dimensional tasks on m machines such that themaximum load over all dimensions and all machines is minimized.The vector bin packing...
Conference: ACM-SIAM Symposium on Discrete Algorithms - SODA , pp. 185-194, 1999
Cumulative Annual
View Publication
The following links allow you to view full publications. These links are maintained by other sources not affiliated with Microsoft Academic Search.
Sort by: