Variable Sized Bin Packing With Color Constraints

Electronic Notes in Discrete Mathematics - Tập 7 - Trang 154-157 - 2001
Milind Dawande1, Jayant Kalagnanam2, Jay Sethuraman3
1Univ. of Texas at Dallas, USA
2IBM T. J. Watson Research Center, USA
3Columbia Univ., USA

Tài liệu tham khảo

Murgolo, 1987, Efficient approximation scheme for Variable-sized bin packing, SIAM J. Computing, 149, 10.1137/0216012 Karmarkar, 1982, An efficient approximation scheme for the one-dimensional bin packing problem, IEEE FOCS, 312 Grotschel, 1981, The ellipsoid method and its consequences in combinatorial optimization, Combinatorial, 1, 169, 10.1007/BF02579273
Thông tin
Thông tin xuất bản

Electronic Notes in Discrete Mathematics

Tập 7

154-157

Thông tin tác giả