A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

Author： Ahuja Ravindra K.   Hochbaum Dorit S.   Orlin James B.  

Publisher： Springer Publishing Company

ISSN： 0178-4617

Source： Algorithmica, Vol.39, Iss.3, 2004-04, pp. : 189-208

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

A least-squares minimum-cost network flow algorithm

By Gopalakrishnan Balaji   Kong Seunghyun   Barnes Earl   Johnson Ellis   Sokol Joel  

Annals of Operations Research, Vol. 186, Iss. 1, 2011-06 ,pp. : 119-140

Springer Publishing Company

Access to resources Recommend Favorite

A particle swarm optimization-based hybrid algorithm for minimum concave cost network flow problems

By Yan Shangyao   Shih Yu-Lin   Lee Wang-Tsang  

Journal of Global Optimization, Vol. 49, Iss. 4, 2011-04 ,pp. : 539-559

Springer Publishing Company

Access to resources Recommend Favorite

Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k-Way Cut Problem

By Xiao Mingyu   Cai Leizhen   Yao Andrew  

Algorithmica, Vol. 59, Iss. 4, 2011-04 ,pp. : 510-520

Springer Publishing Company

Access to resources Recommend Favorite

Minimum Manhattan Network Problem in Normed Planes with Polygonal Balls: A Factor 2.5 Approximation Algorithm

By Catusse N.   Chepoi V.   Nouioua K.   Vaxès Y.  

Algorithmica, Vol. 63, Iss. 1-2, 2012-06 ,pp. : 551-567

Springer Publishing Company

Access to resources Recommend Favorite

A compact genetic algorithm for the network coding based resource minimization problem

By Xing Huanlai  

Applied Intelligence, Vol. 36, Iss. 4, 2012-06 ,pp. : 809-823

Springer Publishing Company

Access to resources Recommend Favorite