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

被引：11

作者：

Arkin, EM ^{[1
]}

Hassin, R

Rubinstein, S

Sviridenko, M

机构：

[1] SUNY Stony Brook, Dept Appl Math & Stat, Stony Brook, NY 11794 USA

[2] Tel Aviv Univ, Dept Stat & Operat Res, IL-69978 Tel Aviv, Israel

[3] IBM Corp, Thomas J Watson Res Ctr, Yorktown Hts, NY 10598 USA

来源：

关键词：

transportation problem; approximation algorithm; NP-complete problem;

D O I：

10.1007/s00453-004-1087-0

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

We describe approximation algorithms for the maximum transportation with permutable supply vector and related problems.

引用

页码：175 / 187

页数：13

共 3 条

[1] Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems
Esther M. Arkin
Refael Hassin
Shlomi Rubinstein
Maxim Sviridenko
Algorithmica , 2004, 39 : 175 - 187
[2] Approximations for maximum transportation problem with permutable supply vector and other capacitated star packing problems
Arkin, EM
Hassin, R
Rubinstein, S
Sviridenko, M
ALGORITHM THEORY - SWAT 2002, 2002, 2368 : 280 - 287
[3] Packing problems in Transportation and Supply Chain: new problems and trends
Perboli, Guido
Gobbato, Luca
Perfetti, Francesca
TRANSPORTATION: CAN WE DO MORE WITH LESS RESOURCES? - 16TH MEETING OF THE EURO WORKING GROUP ON TRANSPORTATION - PORTO 2013, 2014, 111 : 672 - 681