Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2368, Issue , 2002, Pages 280-287

  Arkin, Esther M ^a   Hassin, Refael ^b   Rubinstein, Shlomi ^b   Sviridenko, Maxim ^c  

^a Stony Brook University   (United States)

^b TEL AVIV UNIVERSITY   (Israel)

^c IBM T J WATSON RESEARCH CENTER   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 1842549444     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45471-3_29     Document Type: Conference Paper

References (8)

1. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993.
2. E.M. Arkin and R. Hassin “On Local Search for Weighted k-set Packing”, Mathematics of Operations Research, 23 (1998), 640-648.
3. E.M. Arkin, R. Hassin, and M. Sviridenko “Approximating the Maximum Quadratic Assignment Problem”, Information Processing Letters 77 (2001), 13-16.
4. M. Hujter, B. Klinz and G. Woeginger, A note on the complexity of the transportation problem with a permutable demand vector, Math. Methods Oper. Res. 50 (1999), no. 1, 9–16.
5. S. Meusel, Minimizing the placement-time on printed circuit boards, Ph.D. Thesis, TU Bergakademie Freiberg, Fakultat fur Mathematik und Informatik, (1998).
6. S. Meusel and R. Burkard, A transportation problem with a permuted demand vector, Math. Methods Oper. Res. 50 (1999), no. 1, 1–7.
7. B. Steinbrecher, Ein Transportproblem mit permutiertem Bedarfsvektor, Master’s thesis, TU Bergakademie Freiberg, Fakultat fur Mathematik und Informatik, (1997).
8. L. A. Wolsey, “Maximizing real-valued submodular functions: primal and dual heuristics for location problems”, Mathematics of Operations Research 7, (1982) 410-425.