𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An advanced dual incremental network algorithm

✍ Scribed by Stephen R. Schmidt; Paul A. Jensen; J. Wesley Barnes

Publisher
John Wiley and Sons
Year
1982
Tongue
English
Weight
782 KB
Volume
12
Category
Article
ISSN
0028-3045

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

An incremental negamax algorithm
An incremental negamax algorithm
✍ Ingo AlthΓΆfer πŸ“‚ Article πŸ“… 1990 πŸ› Elsevier Science 🌐 English βš– 343 KB

In certain models of game trees with erroneous evaluation functions the minimax algorithm does not reduce errors, even under favourable assumptions about the size of the errors and the frequency of their occurrence. We present an incremental negamax algorithm, which uses estimates of all nodes in th

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