Efficient algorithms for the maximum concurrent flow problem

Publisher： John Wiley & Sons Inc

E-ISSN： 1097-0037|65|1|56-67

ISSN： 0028-3045

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

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 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

Efficient Parallel Algorithms for the Minimum Cost Flow Problem

By Beraldi P.   Guerriero F.   Musmanno R.  

Journal of Optimization Theory and Applications, Vol. 95, Iss. 3, 1997-12 ,pp. : 501-530

Springer Publishing Company

Access to resources Recommend Favorite

Efficient Algorithms for the Smallest Enclosing Ball Problem

By Zhou Guanglu   Tohemail Kim-Chuan   Sun Jie  

Computational Optimization and Applications, Vol. 30, Iss. 2, 2005-02 ,pp. : 147-160

Springer Publishing Company

Access to resources Recommend Favorite

Algorithms to solve the knapsack constrained maximum spanning tree problem

By Takeo Yamada   Kohtaro Watanabe   Seiji Kataoka  

International Journal of Computer Mathematics, Vol. 82, Iss. 1, 2005-01 ,pp. : 23-34

Taylor & Francis Ltd

Access to resources Recommend Favorite

Algorithms for the maximum k-club problem in graphs

By Shahinpour Shahram   Butenko Sergiy  

Journal of Combinatorial Optimization, Vol. 26, Iss. 3, 2013-10 ,pp. : 520-554

Springer Publishing Company

Access to resources Recommend Favorite