A new strategy for the undirected two-commodity maximum flow problem

Author： Sedeño-Noda A.   González-Martín C.   Alonso-Rodríguez S.  

Publisher： Springer Publishing Company

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.47, Iss.2, 2010-10, pp. : 289-305

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

Abstract

Related content

A polynomial time approximation algorithm for the two-commodity splittable flow problem

By Eisenschmidt Elke   Haus Utz-Uwe  

Mathematical Methods of Operations Research, Vol. 77, Iss. 3, 2013-06 ,pp. : 381-391

Springer Publishing Company

Access to resources Recommend Favorite

A local search heuristic for the Multi-Commodity [TEX equation: k] -splittable Maximum Flow Problem

By Gamst M.  

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 919-937

Springer Publishing Company

Access to resources Recommend Favorite

Efficient algorithms for the maximum concurrent flow problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 56-67

John Wiley & Sons Inc

Access to resources Recommend Favorite

Locating Sources to Meet Flow Demands in Undirected Networks

By Arata K.   Iwata S.   Makino K.   Fujishige S.  

Journal of Algorithms, Vol. 42, Iss. 1, 2002-01 ,pp. : 54-68

Elsevier

Access to resources Recommend Favorite

A compact linear programming formulation of the maximum concurrent flow problem

By  

NETWORKS: AN INTERNATIONAL JOURNAL, Vol. 65, Iss. 1, 2015-01 ,pp. : 68-87

John Wiley & Sons Inc

Access to resources Recommend Favorite