{"product_id":"the-traveling-salesman-problem-isbn-9780471904137","title":"The Traveling Salesman Problem","description":"Provides an in-depth treatment of the Traveling Salesman problem--the archetypical problem in combinatorial optimization. Each chapter deals with a different aspect of the problem, and has been written by an acknowledged expert in the field. Focusses on the essential ideas in a self-contained manner. Includes exercises and an extensive bibliography. History (A. Hoffman and P. Wolfe).\u003cbr\u003e Motivation and Modeling (R. Garfinkel).\u003cbr\u003e Computational Complexity (D. Johnson and C. Papadimitriou).\u003cbr\u003e Well-Solved Special Cases (P. Gilmore, et al.).\u003cbr\u003e Performance Guarantees for Heuristics (D. Johnson and C.Papadimitriou).\u003cbr\u003e Probabilistic Analysis of Heuristics (R. Karp and J. Steele).\u003cbr\u003e Empirical Analysis of Heuristics (B. Golden and W. Stewart).\u003cbr\u003e Polyhedral Theory (M. Grotschel and M. Padberg).\u003cbr\u003e Polyhedral Algorithms (M. Padberg and M. Grotschel).\u003cbr\u003e Branch and Bound Methods (E. Balas and P. Toth).\u003cbr\u003e Hamiltonian Cycles (V. Chvatal).\u003cbr\u003e Vehicle Routing (N. Christofides).\u003cbr\u003e Bibliography.  \u003cp\u003eEugene Leighton Lawler was an American computer scientist, a professor of computer science at the University of California, Berkeley. Jan Karel Lenstra is the author of The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, published by Wiley.\u003c\/p\u003e","brand":"Wiley","offers":[{"title":"Default Title","offer_id":47990356902117,"sku":"NP9780471904137","price":622.95,"currency_code":"USD","in_stock":false}],"thumbnail_url":"\/\/cdn.shopify.com\/s\/files\/1\/1842\/7735\/files\/9780471904137.jpg?v=1761787494","url":"https:\/\/k12savings.com\/es\/products\/the-traveling-salesman-problem-isbn-9780471904137","provider":"K12savings","version":"1.0","type":"link"}