A least-squares minimum-cost network flow algorithm

Author： Gopalakrishnan Balaji Kong Seunghyun Barnes Earl Johnson Ellis Sokol Joel

ISSN： 0254-5330

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

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 Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem

By Ahuja Ravindra K. Hochbaum Dorit S. Orlin James B.

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

Springer Publishing Company

Access to resources Recommend Favorite

A Memetic Algorithm for Minimum-Cost Vertex-Biconnectivity Augmentation of Graphs

By Ljubić Ivana Raidl Günther R.

Journal of Heuristics, Vol. 9, Iss. 5, 2003-11 ,pp. : 401-427

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

A Distributed Least-Squares Algorithm in Wireless Sensor Networks With Unknown and Limited Communications

International Journal of Handheld Computing Research (IJHCR), Vol. 8, Iss. 3, 2017-07 ,pp. : 15-36

IGI Global_journal

Access to resources Recommend Favorite

A New Algorithm for Constrained Matrix Least Squares Approximations

By Yan W-Y.

Annals of Operations Research, Vol. 98, Iss. 1-4, 2000-12 ,pp. : 255-269

Springer Publishing Company

Access to resources Recommend Favorite