Livros de Otimização Combinatória
Esses são os livros que serviram de base
para minhas notas de aula de Otimização Combinatória:
-
[CCPS]
W.J. Cook, W.H. Cunningham, W.R. Pulleyblank, A. Schrijver,
Combinatorial Optimization,
John Wiley, 1998.
-
[Sch17]
Alexander Schrijver,
A Course in Combinatorial Optimization,
2017.
URL: homepages.cwi.nl/~lex/files/dict.pdf.
-
[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.]
-
[BM08]
John A. Bondy,
U.S. Rama Murty,
Graph Theory,
Springer, 2008.
Referências adicionais
-
[GKT]
B. Guenin, J. Könemann, L. Tunçel,
A Gentle Introduction to Optimization,
Cambridge University Press, 2014.
-
[Sch03]
Alexander Schrijver,
Combinatorial Optimization: Polyhedra and Efficiency,
(volumes A, B, and C),
Springer, 2003.
(Uma verdadeira enciclopédia!)
-
[GLS]
M. Grötschel, L. Lovász, A. Schrijver,
Geometric Algorithms and Combinatorial Optimization,
Springer, first edition, 1988.
-
[PS]
C. H. Papadimitriou, K. Steiglitz,
Combinatorial Optimization: Algorithms and Complexity,
Prentice Hall, 1982.
(Também Dover, 1998.)
-
[CLRS]
T.H. Cormen, C.E. Leiserson, R.L. Rivest, C. Stein,
Introduction to Algorithms, 2nd. ed.,
MIT Press e McGraw-Hill, 2001.
Mais livros sobre otimização combinatória
-
Jon Lee,
A First Course in Combinatorial Optimization,
Cambridge University Press, 2004.
[Muito bom.]
-
Knut Reinert, Gunnar W. Klau,
Combinatorial Optimization and Integer Linear Programming,
2008.
-
William Kocay,
Donald L. Kreher,
Graphs, Algorithms, and Optimization,
Discrete Mathematics and its Applications,
Chapman & Hall / CRC, 2005.
-
Mokhtar S. Bazaraa,
John J. Jarvis,
Hanif D. Sherali,
Linear Programming and Network Flows,
4th. ed,
John Wiley & Sons, 2009.
-
Vangelis Th. Paschos,
Paradigms of Combinatorial Optimization,
John Wiley, 2010.
-
Bernhard Korte, Jens Vygen,
Combinatorial Optimization: Theory and Algorithms,
5th. ed.,
série Algorithms and Combinatorics Vol. 21,
Springer, 2012.
-
W. Hochstaettler, A. Schliep,
CATBox - An Interactive Course in Combinatorial Optimization,
Springer, 2010.
-
András Frank,
Connections in Combinatorial Optimization,
WHSmith,
2011.
(Oxford Lecture Series in Mathematics & Its Applications, 38.)
-
Levent Tunçel,
Polyhedral and Semidefinite Programming Methods
in Combinatorial Optimization,
AMS (American Mathematical Society) and Fields Institute,
2010.
Programação linear e inteira
-
V. Chvátal,
Linear Programming,
Freeman, 1983.
-
A. Schrijver,
Theory of Linear and Integer Programming,
Wiley, 1986.
-
G. Nemhauser, R. Garfinkel,
Integer Programming,
Wiley, New York, 1972.
-
G. L. Nemhauser, L. A. Wolsey,
Integer and Combinatorial Optimization,
Wiley, 1988.
-
D.P. Bertsekas,
Network Optimization,
Athena, 1998.
Artigos em revistas
-
W. Tutte,
The factorization of linear graphs
,
Journal of the London Mathematical Society,
1947.
-
L.R. Ford Jr.
and D.R. Fulkerson,
Maximal flow through a network
,
Canadian Journal of Mathematics, 1956
-
R.E. Gomory and T.C. Hu,
Multi-terminal network flows
,
Journal of the Society for Industrial and Applied Mathematics,
1961.
-
J. Edmonds,
Paths, trees, and flowers
,
Canadian Journal of Mathematics,
1965.
-
R. E. Tarjan,
Depth-first search and linear graph algorithms
,
SIAM Journal on Computing, 1972.
-
R. E. Tarjan,
Efficiency of a good but not linear set union algorithm
,
Journal of the ACM, 1975.
-
D. Gusfield and É. Tardos,
A faster parametric minimum-cut algorithm
,
Algorithmica,
1994.
-
Aardal, Hoesel, Lenstra, Stougie,
A decade of combinatorial optimization,
1997.