𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A shortest augmenting path algorithm for dense and sparse linear assignment problems

✍ Scribed by R. Jonker; A. Volgenant

Book ID
105524216
Publisher
Springer Vienna
Year
1987
Tongue
English
Weight
802 KB
Volume
38
Category
Article
ISSN
0010-485X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A shortest augmenting path method for so
A shortest augmenting path method for solving minimal perfect matching problems
✍ Ulrich Derigs πŸ“‚ Article πŸ“… 1981 πŸ› John Wiley and Sons 🌐 English βš– 551 KB

## Abstract An efficient procedure for solving minimum weight perfect matching problems is presented. Starting from the empty matching the optimal matching is constructed by successively augmenting along shortest augmenting paths. Such paths can be determined via a special labeling technique. The a

A dynamic programming algorithm for the
A dynamic programming algorithm for the shortest path problem with time windows and linear node costs
✍ Ioachim, Irina; GοΏ½linas, Sylvie; Soumis, FranοΏ½ois; Desrosiers, Jacques πŸ“‚ Article πŸ“… 1998 πŸ› John Wiley and Sons 🌐 English βš– 154 KB πŸ‘ 3 views

This paper presents an optimal dynamic programming algorithm, the first such algorithm in the literature to solve the shortest path problem with time windows and additional linear costs on the node service start times. To optimally solve this problem, we propose a new dynamic programming algorithm w

A steepest edge active set algorithm for
A steepest edge active set algorithm for solving sparse linear programming problems
✍ S. W. Sloan πŸ“‚ Article πŸ“… 1988 πŸ› John Wiley and Sons 🌐 English βš– 863 KB

A steepest edge active set algorithm is described which is suitable for solving linear programming problems where the constraint matrix is sparse and has more rows than columns. The algorithm uses a steepest edge criterion for selecting the search direction at each iteration and recurrence relations