✦ LIBER ✦

Algorithms for the minimum cost circulation problem based on maximizing the mean improvement

✍ Scribed by Refael Hassin

Publisher: Elsevier Science
Year: 1992
Tongue: English
Weight: 406 KB
Volume: 12
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(92)90048-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parallel algorithms for the assignment a

Parallel algorithms for the assignment and minimum-cost flow problems

✍ James B. Orlin; Clifford Stein 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 429 KB

On approximation algorithms for the mini

On approximation algorithms for the minimum satisfiability problem

✍ M.V. Marathe; S.S. Ravi 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 617 KB

An infeasibility pricing algorithm for t

An infeasibility pricing algorithm for the multicommodity minimum cost flow problem

✍ Mokhtar S. Bazaraa 📂 Article 📅 1978 🏛 Elsevier Science 🌐 English ⚖ 837 KB

A mean-variance model for the minimum co

A mean-variance model for the minimum cost flow problem with stochastic arc costs

✍ Stephen D. Boyles; S. Travis Waller 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 256 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

On the relationship of approximation alg

On the relationship of approximation algorithms for the minimum and the maximum traveling salesman problem

✍ Frank Korner 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 249 KB