W. Cook, W. Cunningham, W. Pulleyblank, A. Schrijver, Combinatorial Optimization, Wiley, 1998. ISBN 0-471-55894-X QA402.5.C54523

J.R. Evens and E. Minieka, Optimization Algorithms for Networks and Graphs, Marcel Dekker, 1992. ISBN 0-8247-8602-5 QA166.E92

L.R. Foulds, Combinatorial Optimization for Undergraduates, Undergraduate Texts in Mathematics, Springer, 1984. QA164.F68

W. Lawler, Combinatorial Optimization: Networks and Matroids, Holt, 1976 (Out-of print)

C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover.1998 (Originally by Prentice-Hall 1982).

T.H.Cormen, Introduction to Algorithms, MIT Press 1990 (on reserve in the library)

S. Even, Graph Algorithms, Computer Science Press, 1979. ISBN 0-914894-21-8 QA166.E94

S. Even, Algorithmic Combinatorics, Macmillan, 1973. QA164.E88

A. Gibbons, Algorithmic Graph Theory, Cambridge Uni. Press, 1985. ISBN 0-521-28881-9 QA166.G53

M. Syslo, N.Deo, J.Kowalik, Discrete Optimization Algorithms, Prentice-Hall 1983. ISBN 0-13-215509-5 QA402.5 S94.

C.R. Reeves (ed.), Modern Heuristic Techniques for Combinatorial Problems, Halstead Press, 1983. ISBN 0-470-22079-1 QA402.5 M62

Andrew Goldberg and Satish Rao, "Beyond the Flow Decomposition Barrier", J. A.C.M. 45 (1998) 783-797.

Dan Gusfield, "Very Simple Methods for All Pairs Network Flow Analysis", SIAM J. Comput 19 (1990) 143-155.

A. Ephremides, and S. Verdu, "Control and Optimization Methods in Communiation Network Problems", IEEE Trans Automatic Control, 34 (1989)

Ash, Cardwell and Murray, "Design and Optimization of Networks with Dynamic Routing", Bell System Tech J. 60 (1981) 1787–1820.