Volume 13, Issue 1 | Annals of Operations Research

Search all Annals of Operations Research articles

Volume 13, Issue 1

December 1988

Filter by

Volume:

Sort by

Date published:

New to old Old to new

8 articles in this issue

Introduction

EditorialNotes Pages: IX - XIV
Shortest path algorithms
Giorgio Gallo
Stefano Pallottino
Chapter I Shortest Paths Pages: 1 - 79
A computational comparison of the dinic and network simplex methods for maximum flow
Donald Goldfarb
Michael D. Grigoriadis
Chapter II Network Flows Pages: 81 - 123
The relax codes for linear minimum cost network flow problems
Dimitri P. Bertsekas
Paul Tseng
Chapter II Network Flows Pages: 125 - 190
Algorithms and codes for the assignment problem
Giorgio Carpaneto
Silvano Martello
Paolo Toth
Chapter III Assignment And Matching Pages: 191 - 223
Solving non-bipartite matching problems via shortest path techniques
Ulrich Derigs
Chapter III Assignment And Matching Pages: 225 - 261
Algorithms for finding optimum trees: Description, use and evaluation
P. M. Camerini
G. Galbiati
F. Maffioli
Chapter IV Spanning Trees Pages: 263 - 397
A hybrid algorithm for finding thekth smallest ofn elements in O(n) time
Matteo Fischetti
Silvano Martello
Appendix Pages: 399 - 419