Fluxo em Redes:  Livros

AMO		R.K. Ahuja, Th. L. Magnanti, J.B. Orlin, Network Flows: Theory, Algorithms, and Applications, Prentice Hall, 1993. [Há uma errata na página do Orlin.]
		AMO é mais um manual que um livro-texto. Tem uma grande quantidade de material, bons exercícios e muitas aplicações interessantes. Mas tem muitos erros. A notação é descuidada e por vezes inconsistente. A tipografia é de má qualidade. Os algoritmos são descritos de maneira imprecisa e alguns têm erros tipográficos. As condições de aplicabilidade dos algoritmos nem sempre estão claras. Os enunciados dos teoremas freqüentemente omitem hipóteses importantes. Vários capítulos começam por impor restrições ("assumptions") sobre as redes em estudo, mas no decorrer do capítulo nem sempre fica claro por que as restrições são necessárias.
CCPS		W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver, Combinatorial Optimization, John Wiley, 1998. [Excelente!]
JL		Jon Lee, A First Course in Combinatorial Optimization, Cambridge University Press, 2004. [Muito bom]
CLRS		T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein, Introduction to Algorithms, 2nd. edition, MIT Press e McGraw-Hill, 2001.
JH		Juraj Hromkovic, Algorithmics for Hard Problems, 2nd. edition, Springer, 2001.

Otimização Combinatória

(Livros não restritos a Fluxo em Redes.)

• C. H. Papadimitriou, K. Steiglitz,  Combinatorial Optimization: Algorithms and Complexity,  Prentice Hall, 1982.  [Também Dover, 1998.]
• Andras Frank,  Connections in Combinatorial Optimization,  WHSmith, 2011. (Oxford Lecture Series in Mathematics & Its Applications, 38.)
• Lap-Chi Lau, R. Ravi, Mohit Singh,  Iterative Methods in Combinatorial Optimization, Cambridge University Press.
• Cécile Murat, Vangelis Th. Paschos,  Probabilistic Combinatorial Optimization on Graphs, John Wiley, 2006.
• Vangelis Th. Paschos,  Paradigms of Combinatorial Optimization, John Wiley, 2010.
• Levent Tunçel,  Polyhedral and Semidefinite Programming Methods in Combinatorial Optimization, AMS (American Mathematical Society) and Fields Institute, 2010
• Bernhard Korte, Jens Vygen, Combinatorial Optimization: Theory and Algorithms, 3rd.ed.,  série "Algorithms and Combinatorics Vol. 21", Springer, 2002.
• A. Schrijver,  Theory of Linear and Integer Programming,  Wiley, 1986.
• A. Schrijver,  Combinatorial Optimization: Polyhedra and Efficiency,  (volumes A, B and C), Springer, 2003.
• G. L. Nemhauser, L. A. Wolsey,  Integer and Combinatorial Optimization,  Wiley, 1988.
• D.P. Bertsekas,  Network Optimization, Athena, 1998.
• Gérard Cornuéjols,  Combinatorial Optimization: Packing and Covering, CBMS-NSF Regional Conference Series in Applied Mathematics, 74, Society for Industrial and Applied Mathematics (SIAM), Philadelphia, 2001.
• William Kocay, Donald L. Kreher, Graphs, Algorithms, and Optimization, Discrete Mathematics and its Applications (Boca Raton). Chapman & Hall/CRC, 2005.
• V. Chvátal,  Linear Programming,  Freeman, 1983.
• Mokhtar S. Bazaraa, John J. Jarvis, Hanif D. Sherali, Linear Programming and Network Flows, 4th. edition. John Wiley & Sons, 2009.
• W. Hochstaettler, A. Schliep,  CATBox - An Interactive Course in Combinatorial Optimization, Springer, 2010.
• Cécile Murat, Vangelis Th. Paschos,  Probabilistic Combinatorial Optimization on Graphs,  Wiley Interscience, 2006.

Slides

• Min-Max Relations in Combinatorial Optimization, de José Soto, no MIT

Aplicações

• Duncan J. Watts,   Small Worlds: The Dynamics of Networks between Order and Randomness,  (Princeton Studies in Complexity),  Princeton University Press, 1999.

Software

• COIN-OR::LEMON: biblioteca de software para otimização combinatória, escrita em C++

  "LEMON is an open source C++ template library aimed at combinatorial optimization tasks, especially those working with graphs and networks. Its goal is to provide highly efficient, easy-to-use, and well cooperating fundamental software components that help implementing complex real-life optimization tasks. These components include graph implementations and related data structures, fundamental graph and network algorithms (such as graph search, shortest path, spanning tree and network flow algorithms) and various auxiliary tools."

• SYMPHONY: an open-source solver for mixed-integer linear programs (MILPs) written in C. It can be used in three different main modes (hosted by the COIN-OR Foundation)
• CPLEX Solver: software comercial para programação linear e programação linear-inteira
• Gurobi Solver: software livre para programação linear, inteira e quadrática