ScholarLens Back to search
1986•Bulletin of the London Mathematical SocietyRequires access

THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization

Norman Biggs

Open publisher page 122 citations

Abstract

Edited By E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys: pp. 465. £39.95. (John Wiley & Sons Ltd, 1985).

About this research paper

What this paper is about

Edited By E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys: pp. 465. £39.95. (John Wiley & Sons Ltd, 1985).

Why it matters

OpenAlex reports 122 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Edited By E. L. Lawler, J. K. Lenstra, A. H. G. Rinnoy Kan and D. B. Shmoys: pp. 465. £39.95. (John Wiley & Sons Ltd, 1985).

Key concepts: Travelling salesman problem, Mathematics, Combinatorial optimization, Mathematical optimization, Bottleneck traveling salesman problem, 2-opt, Quadratic assignment problem, Extremal optimization

Related papers

Related paper 1Related paper 2Related paper 3
Back to paper searchBrowse research topicsOriginal source
THE TRAVELING SALESMAN PROBLEM A Guided Tour of Combinatorial Optimization — Research Paper | ScholarLens