1978•Mathematical ProgrammingRequires access

The adjacency relation on the traveling salesman polytope is NP-Complete

Christos H. Papadimitriou

Open publisher page 96 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 96 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.

Key concepts: Travelling salesman problem, Combinatorics, Mathematics, Bottleneck traveling salesman problem, Adjacency list, Polytope, 2-opt, Traveling purchaser problem

Back to paper search Browse research topics Original source

The adjacency relation on the traveling salesman polytope is NP-Complete — Research Paper | ScholarLens