Livros: | Abrev | Notas | BM DMUC |
Cook, Cunningham, Pulleyblank and Schrijver, Combinatorial Optimization. Wiley, 1998 | CCPS | Link | 90C/Com.Coo |
Lee, A First Course in Combinatorial Optimization, Cambridge University Press, 2004 | L | 90C/LEE | |
L. Wolsey, Integer Programming, Wiley, New York, 1998 | Wo | Link | 90C/WOL |
Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin, Network Flows: Theory, Algorithms, and Applications, Hardcover, 1st ed., 846pp., ISBN: 013617549X, Prentice Hall, February 1993. | AMO | Link | 90C/AHU |
Artigos: | |||
Michael Kleber, The best card trick, in Mathematical Intelligencer 24 #1 (Winter 2002) | |||
Maciek Nowak, Marina A. Epelman, and Stephen Pollock, Assignment of Swimmers to Dual Meet Events, in Computers and Operations Research, 2004. | |||
Alvin E. Rothy, Tayfun Sönmezz and M. Utku Ünverx, Pairwise Kidney Exchange, Technical Report, February 14, 2005 | |||
A. Letchford, Separating a superclass of comb inequalities in planar graphs, in Mathematics of Operations Research, Vol. 25, No. 3, August 2000, pp. 443-454 | |||
Pataki, Gábor, Teaching integer programming formulations using the traveling salesman problem. SIAM Rev. 45 (2003), no. 1, 116--123 | |||
Fischetti, Matteo, Lodi, Andrea and Toth, Paolo, Exact methods for the asymmetric traveling salesman problem. The traveling salesman problem and its variations, 169--205, Comb. Optim., 12, Kluwer Acad. Publ., Dordrecht, 2002. | |||
A. Caprara, M. Fischetti, 0-1/2 Chvátal-Gomory Cuts, Mathematical Programming 74 (1996) 221-236 | .ps | ||
Kevin Cheung, W. H. Cunningham, and L. Tang, Optimal 3-Terminal Cuts and Linear Programming, to appear in Math. Programming A. | .ps | ||
Última actualização em 1 de Março de 2006