An algorithm to solve the proportional network flow problem

Author： Morrison David   Sauppe Jason   Jacobson Sheldon  

Publisher： Springer Publishing Company

ISSN： 1862-4472

Source： Optimization Letters, Vol.8, Iss.3, 2014-03, pp. : 801-809

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

Genetic algorithm to solve the p -centre and p -radius problem on a network

By Abu Nayeem SK.   Pal Madhumangal  

International Journal of Computer Mathematics, Vol. 82, Iss. 5, 2005-05 ,pp. : 541-550

Taylor & Francis Ltd

Access to resources Recommend Favorite

An Optimal Algorithm to Solve 2-Neighbourhood Covering Problem on Interval Graphs

By Mondal Sukumar   Pal Madhumangal   Pal Tapan K.  

International Journal of Computer Mathematics, Vol. 79, Iss. 2, 2002-01 ,pp. : 189-204

Taylor & Francis Ltd

Access to resources Recommend Favorite

New Imperialist Competitive Algorithm to solve the travelling salesman problem

By Yousefikhoshbakht Majid  

International Journal of Computer Mathematics, Vol. 90, Iss. 7, 2013-07 ,pp. : 1495-1505

Taylor & Francis Ltd

Access to resources Recommend Favorite

An efficient approximation algorithm for the survivable network design problem

By Gabow H.N.   Goemans M.X.   Williamson D.P.  

Mathematical Programming, Vol. 82, Iss. 1, 1998-06 ,pp. : 13-40

Elsevier

Access to resources Recommend Favorite

A New Mixed Iterative Algorithm to Solve the Fuel-Optimal Linear Impulsive Rendezvous Problem

By Arzelier D.   Louembet C.   Rondepierre A.   Kara-Zaitri M.  

Journal of Optimization Theory and Applications, Vol. 159, Iss. 1, 2013-10 ,pp. : 210-230

Springer Publishing Company

Access to resources Recommend Favorite