✦ LIBER ✦

A least-squares minimum-cost network flow algorithm

✍ Scribed by Balaji Gopalakrishnan; Seunghyun Kong; Earl Barnes; Ellis L. Johnson; Joel S. Sokol

Publisher: Springer US
Year: 2011
Tongue: English
Weight: 795 KB
Volume: 186
Category: Article
ISSN: 0254-5330
DOI: 10.1007/s10479-011-0858-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Minimum cost flow algorithms for series-

Minimum cost flow algorithms for series-parallel networks

✍ Wolfgang W. Bein; Peter Brucker; Arie Tamir 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 439 KB

A simplex algorithm for minimum-cost net

A simplex algorithm for minimum-cost network-flow problems in infinite networks

✍ Thomas C. Sharkey; H.Edwin Romeijn 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 217 KB

A deterministic annealing algorithm for

A deterministic annealing algorithm for the minimum concave cost network flow problem

✍ Chuangyin Dang; Yabin Sun; Yuping Wang; Yang Yang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 292 KB

The existing algorithms for the minimum concave cost network flow problems mainly focus on the singlesource problems. To handle both the single-source and the multiple-source problem in the same way, especially the problems with dense arcs, a deterministic annealing algorithm is proposed in this pap

Minimum-cost flows in convex-cost networ

Minimum-cost flows in convex-cost networks

✍ T. C. Hu 📂 Article 📅 1966 🏛 John Wiley and Sons 🌐 English ⚖ 369 KB

On dual minimum cost flow algorithms

✍ Jens Vygen 📂 Article 📅 2002 🏛 Springer 🌐 English ⚖ 280 KB

Minimum cost flow-dependent communicatio

Minimum cost flow-dependent communication networks

✍ D.A. Thomas; J.F. Weng 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 171 KB