✦ LIBER ✦

A note on primal network flow algorithms

✍ Scribed by K. Hässig; P. Reiser; C. Stierlin

Publisher: Springer
Year: 1978
Tongue: English
Weight: 125 KB
Volume: 22
Category: Article
ISSN: 0340-9422
DOI: 10.1007/bf01917660

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Balanced network flows. VII. Primal-dual

Balanced network flows. VII. Primal-dual algorithms

✍ Christian Fremuth-Paeger; Dieter Jungnickel 📂 Article 📅 2001 🏛 John Wiley and Sons 🌐 English ⚖ 559 KB

## Abstract We discuss an adaptation of the famous primal‐dual 1‐matching algorithm to balanced network flows which can be viewed as a network flow description of capacitated matching problems. This method is endowed with a sophisticated start‐up procedure which eventually makes the algorithm stron

A note on the primal-dual and out-of-kil

A note on the primal-dual and out-of-kilter algorithms for network optimization problems

✍ J. F. Shapiro 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 341 KB 👁 1 views

Polynomial-time primal simplex algorithm

Polynomial-time primal simplex algorithms for the minimum cost network flow problem

✍ Donald Goldfarb; Jianxiu Hao 📂 Article 📅 1992 🏛 Springer 🌐 English ⚖ 882 KB

A note comparing glover's and young's si

A note comparing glover's and young's simplified primal algorithms

✍ Harvey M. Salkin 📂 Article 📅 1972 🏛 John Wiley and Sons 🌐 English ⚖ 245 KB

A primal algorithm for solving a capacit

A primal algorithm for solving a capacitated network flow problem with additional linear constraints

✍ S. Chen; R. Saigal 📂 Article 📅 1977 🏛 John Wiley and Sons 🌐 English ⚖ 768 KB

A note on monte carlo primality tests an

A note on monte carlo primality tests and algorithmic information theory

✍ Gregory J. Chaitin; Jacob T. Schwartz 📂 Article 📅 1978 🏛 John Wiley and Sons 🌐 English ⚖ 377 KB