✦ LIBER ✦

On strongly polynomial variants of the network simplex algorithm for the maximum flow problem

✍ Scribed by Donald Goldfarb; Jianxiu Hao

Publisher: Elsevier Science
Year: 1991
Tongue: English
Weight: 324 KB
Volume: 10
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(91)90039-r

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On a capacity scaling algorithm for the

On a capacity scaling algorithm for the constrained maximum flow problem

✍ Cenk Çalışkan 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 64 KB

A Parallel Implementation of the Push-Re

A Parallel Implementation of the Push-Relabel Algorithm for the Maximum Flow Problem

✍ R. Anderson; J.C. Setubal 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 1002 KB

We describe an efficient parallel implementation of the pushrelabel maximum flow algorithm for a shared-memory multiprocessor. Our main technical innovation is a method that allows the "global relabeling" heuristic to be executed concurrently with the main algorithm; this heuristic is essential for

Flow variant of the sweep method for dif

Flow variant of the sweep method for difference problems with strongly varying coefficients

✍ L.M. Degtyarev; A.P. Favorskii 📂 Article 📅 1969 🏛 Elsevier Science ⚖ 422 KB

The complexity of some polynomial networ

The complexity of some polynomial network consistency algorithms for constraint satisfaction problems

✍ Alan K. Mackworth; Eugene C. Freuder 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 475 KB

Notes on an algorithm of the simplex met

Notes on an algorithm of the simplex method for problems of large dimensionality

✍ A.-I.A Stanevichyus; P.E Shklyar 📂 Article 📅 1982 🏛 Elsevier Science ⚖ 740 KB

On the asymptotic optimality of algorith

On the asymptotic optimality of algorithms for the flow shop problem with release dates

✍ Hui Liu; Maurice Queyranne; David Simchi-Levi 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB