Description

Book Synopsis
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.

Table of Contents
History (A. Hoffman and P. Wolfe).
Motivation and Modeling (R. Garfinkel).
Computational Complexity (D. Johnson and C. Papadimitriou).
Well-Solved Special Cases (P. Gilmore, et al.).
Performance Guarantees for Heuristics (D. Johnson and C.Papadimitriou).
Probabilistic Analysis of Heuristics (R. Karp and J. Steele).
Empirical Analysis of Heuristics (B. Golden and W. Stewart).
Polyhedral Theory (M. Grotschel and M. Padberg).
Polyhedral Algorithms (M. Padberg and M. Grotschel).
Branch and Bound Methods (E. Balas and P. Toth).
Hamiltonian Cycles (V. Chvatal).
Vehicle Routing (N. Christofides).
Bibliography.

The Traveling Salesman Problem

    Product form

    A Hardback by E. L. Lawler, Jan Karel Lenstra, A. H. G. Rinnooy Kan

    £357.26

    Includes FREE delivery

    RRP £396.95 – you save £39.69 (9%)

    Order before 4pm tomorrow for delivery by Wed 4 Nov 2026.

      Trusted by thousands of customers. See 2,385+ Customer Reviews

      View other formats and editions of The Traveling Salesman Problem by E. L. Lawler

      Book details

      Publisher John Wiley & Sons Inc
      Published 28 August 1985
      ISBN-13 9780471904137
      978-0471904137
      ISBN-10 0471904139
      Also in:
      Mathematics

      Description

      Book Synopsis
      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.

      Table of Contents
      History (A. Hoffman and P. Wolfe).
      Motivation and Modeling (R. Garfinkel).
      Computational Complexity (D. Johnson and C. Papadimitriou).
      Well-Solved Special Cases (P. Gilmore, et al.).
      Performance Guarantees for Heuristics (D. Johnson and C.Papadimitriou).
      Probabilistic Analysis of Heuristics (R. Karp and J. Steele).
      Empirical Analysis of Heuristics (B. Golden and W. Stewart).
      Polyhedral Theory (M. Grotschel and M. Padberg).
      Polyhedral Algorithms (M. Padberg and M. Grotschel).
      Branch and Bound Methods (E. Balas and P. Toth).
      Hamiltonian Cycles (V. Chvatal).
      Vehicle Routing (N. Christofides).
      Bibliography.

      Recently viewed products

      © 2026 Book Curl

        • American Express
        • Apple Pay
        • Diners Club
        • Discover
        • Google Pay
        • Maestro
        • Mastercard
        • PayPal
        • Shop Pay
        • Union Pay
        • Visa

        Login

        Forgot your password?

        Don't have an account yet?
        Create account