Bibliography of Computational Integer Programming Lecture

Get BibTeX file   Get DjVu-plugin   Get Ghostscript   Get Xpdf   Visit Math-Net   How to make a page like this

Articlesare marked blue
Booksare marked red
Reportsare marked grey

[2006] [2005] [2003] [2002] [1998] [1994] [1991] [1988] [1985] [1979] 
[1960] [1954] 


Authors      David L. Applegate, Robert E. Bixby, Vasek Chvátal, William J. Cook
TitleThe Traveling Salesman Problem: A Computational Study
PublishedPrinceton University Press, 2006
FilesGet BibTeX entry  


Authors      Mathieu Van Vyve, Lawrence Wolsey
TitleApproximate extended formulations
JournalMathematical Programming, 105 (2005) 501-522
FilesGet BibTeX entry  


Authors      Tobias Polzin
TitleAlgorithms for the Steiner Problems in Networks
FilesGet BibTeX entry  


Authors      Hans Jürgen Prömel, Angelika Steger
TitleThe Steiner Tree Problem
PublishedVieweg, 2002
FilesGet BibTeX entry  


Authors      Thorsten Koch, Alexander Martin
TitleSolving Steiner tree problems in graphs to optimality
JournalNetworks, 32 (1998) 207-232
FilesGet BibTeX entry  


Authors      Sunil Chopra, M. Rao
TitleThe Steiner Tree Problem II: Properties and Classes of Facets
JournalMathematical Programming, 64:2 (1994) 231-246
FilesGet BibTeX entry  
Authors      Sunil Chopra, M. Rao
TitleThe Steiner Tree Problem I: Formulations, Compositions and Extension of Facets
JournalMathematical Programming, 64:2 (1994) 209-229
FilesGet BibTeX entry  


Authors      Manfred Padberg, Ting-Yi Sung
TitleAn analytical comparison of different formulations of the travelling salesman problem
JournalMathematical Programming, 52 (1991) 315-357
FilesGet BibTeX entry  


Authors      Martin Grötschel, László Lovász, Alexander Schrijver
TitleGeometric Algorithms and Combinatorial Optimization
PublishedSpringer Verlag, 1988
FilesGet BibTeX entry  


TitleThe Traveling Salesman Problem
EditorsE. L. Lawler, Jan Karel Lenstra, Alexander H. G. Rinnooy Kan, David B. Shmoys
PublishedJohn Wiley & Sons Ltd., 1985
FilesGet BibTeX entry  


Authors      M. R. Garey, D. S. Johnson
TitleComputers and Intractability: A Guide to the Theory of NP-Completeness
PublishedW. H. Freeman and Company, 1979
FilesGet BibTeX entry  


Authors      C. E. Miller, A. W. Tucker, R. A. Zemlin
TitleInteger programming formulations and traveling salesman problems
JournalJ. Assoc. Comput. Mach., 7 (1960) 326-329
FilesGet BibTeX entry  


Authors      G. B. Dantzig, D. R. Fulkerson, S. M. Johnson
TitleSolution of a large-scale traveling-salesman problem
JournalOperations Research, 3 (1954) 393-410
FilesGet BibTeX entry  

Valid XHTML 1.1! Valid CSS! Best viewed with any browser

Last Update $Date: 14.09.2011 $ by Ralf Borndörfer
© 2011 by Ralf Borndörfer, Imprint