A computational comparison of the dinic and network simplex methods for maximum flow Donald GoldfarbMichael D. Grigoriadis Chapter II Network Flows Pages: 81 - 123
The relax codes for linear minimum cost network flow problems Dimitri P. BertsekasPaul Tseng Chapter II Network Flows Pages: 125 - 190
Algorithms and codes for the assignment problem Giorgio CarpanetoSilvano MartelloPaolo 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. CameriniG. GalbiatiF. Maffioli Chapter IV Spanning Trees Pages: 263 - 397
A hybrid algorithm for finding thekth smallest ofn elements in O(n) time Matteo FischettiSilvano Martello Appendix Pages: 399 - 419