Approximations for Maximum Transportation with Permutable Supply Vector and Other Capacitated Star Packing Problems

Author： Arkin Esther M.   Hassin Refael   Rubinstein Shlomi   Sviridenko Maxim  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.39, Iss.2, 2004-02, pp. : 175-187

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Related content

Resolution of a capacitated transportation problem with four subscripts

By Zitouni R   Keraghel A  

Kybernetes: The International Journal of Systems & Cybernetics, Vol. 32, Iss. 9-10, 2003-10 ,pp. : 1450-1463

Emerald Group Publishing Ltd

Access to resources Recommend Favorite

A column generation approach to capacitated p-median problems

By Lorena L.A.N.   Senne E.L.F.  

Computers and Operations Research, Vol. 31, Iss. 6, 2004-05 ,pp. : 863-876

Elsevier

Access to resources Recommend Favorite

Maximum tree-packing in time O(n 52 )

By Lingas A.  

Theoretical Computer Science, Vol. 181, Iss. 2, 1997-07 ,pp. : 307-316

Elsevier

Access to resources Recommend Favorite

Cardinality constrained bin-packing problems

By Kellerer H.   Pferschy U.  

Annals of Operations Research, Vol. 92, Iss. 1, 1999-01 ,pp. : 335-348

Springer Publishing Company

Access to resources Recommend Favorite

An effective evolutionary algorithm for the practical capacitated vehicle routing problems

By Wang Chung-Ho   Lu Jiu-Zhang  

Journal of Intelligent Manufacturing, Vol. 21, Iss. 4, 2010-08 ,pp. : 363-375

Springer Publishing Company

Access to resources Recommend Favorite