Murty, Katta G., 1936-
Network programming / Katta G. Murty.
— Englewood Cliffs, N.J. : Prentice Hall, c1992. xvi, 623 p. : il. ; 25 cm.
Incluye referencias bibliográficas e índice.
Contenido: 1. Network definitions and formulations — 2. Single commodity maximum value flow problems in pure networks — 3. Primal-dual and dual algorithms for the assignment and transportation problems — 4. Shortest chain algorithms — 5. Algorithms for minimum cost flow problems in pure networks — 6. Single commodity flows with additional linear constraints — 7. Critical path methods in project networks — 8. Generalized network flows — 9. The minimum cost spanning tree problem — 10. Blossom algorithms for 1-matching/edge covering problems in undirected networks.
ISBN 013615493X
|