product iamge

The Traveling salesman problem : a guided tour of combinatorial optimization

This document was uploaded by one of our users. The uploader already confirmed that they had the permission to publish it. If you are author/publisher or own the copyright of this documents, please report to us by using this DMCA report form.

Download
Search on Amazon

Simply click on the Download Book button.

Yes, Book downloads on Ebookily are 100% Free.

Sometimes the book is free on Amazon As well, so go ahead and hit "Search on Amazon"

History / A.J. Hoffman, P. Wolfe -- Motivation and modeling / R.S. Garfinkel -- Computational complexity / D.S. Johnson, C.H. Papadimitriou -- Well-solved special cases / P.C. Gilmore, E.L. Lawler, D.B. Shmoys -- Performance guarantees for heuristics / D.S. Johnson, C.H. Papadimitriou -- Probabilistic analysis of heuristics / R.M. Karp, J.M. Steele -- Empirical analysis of heuristics / B.L. Golden, W.R. Stewart -- Polyhedral theory / M. Grötschel, M.W. Padberg -- Polyhedral computations / M.W. Padberg, M. Grötschel -- Branch and bound methods / E. Balas, P. Toth -- Hamiltonian cycles / V. Chvátal -- Vehicle routing / N. Christofides

Author(s): Lawler E.L., et al. (eds.)
Series: Wiley-Interscience series in discrete mathematics
Edition: Repr
Publisher: Wiley
Year: 1985

Language: English
Pages: 475
City: Chichester etc
Tags: Математика;Методы оптимизации;