PUC-Rio
Departamento de Informática
Prof. Marcus Vinicius S. Poggi de Aragão
Período: 2005.1
Horário: 5as-feiras de 12 às 15 horas
ALGORITMOS, MODELOS E OTIMIZAÇÃO (INF 2914)
(Tópicos em Algoritmos, Paralelismo e Otimização (APO))
www.inf.puc-rio.br/ ~ poggi/amo051.html

Descrição: Objetivos:
CONTEÚDO

AVALIAÇÃO

Listas, seminários e trabalhos de implementação.

BIBLIOGRAFIA

  1. R.K. Ahuja, T.L. Magnanti e J.B.Orlin, Network Flows, Prentice Hall, 1993.

  2. G.L. Nemhauser e J. L.A. Wolsey, Integer and Combinatorial Optimization, John Wiley & Sons, 1988.

  3. W.J. Cook, W.H. Cunningham, W.R. Pulleyblank e A. Schrijver,Combinatorial Optimization, John Wiley and Sons, New York, 1998.

  4. J. L.A. Wolsey, Integer Programming, Wiley Interscience, 1998.

  5. C. Papadimitriou e K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, 1982.

  6. N. Christofides, Graph Theory: An Algorithmic Approach, Academic Press, 1975.

  7. E. Horowitz e S. Sahni, Fundamentals of Computer Algorithms, Computer Science Press, 1978-89.

  8. M. Garey e D. S. Johnson,Computers and Intractability: A Guide to the Theory of NP-Completeness W.H.Freeman and Company, 1979.

  9. U. Manber, Algorithms: A Creative Approach, Addison-Wesley, 1989.

  10. R.E. Tarjan, Data Structures and Network Algorithms, SIAM, 1983.

  11. P.A. Jensen e W. Barnes, Network Flow Programming, Wiley, 1980.

  12. M. Gondran e M. Minoux, Graphs and Algorithms, Wiley-Interscience, 1984.

  13. T.H. Cormen, C.E. Leiserson e R.L. Rivest, Introduction to Algorithms, McGraw-Hill, New York, 1990.

  14. G. Brassard e P. Bratley, Algorithmics: Theory and Practice, Prentice-Hall, 1988.

This document was translated from LATEX by HEVEA.