Treffer: The traveling salesman problem with distances one and two
Title:
The traveling salesman problem with distances one and two
Authors:
Source:
Mathematics of operations research. 18(1):1-11
Publisher Information:
Linthicum, MD: Institute for Operations Research and the Management Sciences, 1993.
Publication Year:
1993
Physical Description:
print, 8 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Mathematics, Mathématiques, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Algorithme, Algorithm, Algoritmo, Approximation, Aproximacion, Complexité calcul, Computing complexity, Complejidad cálculo, Limite inférieure, Lower bound, Límite inferior, Optimisation combinatoire, Combinatorial optimization, Optimización combinatoria, Problème commis voyageur, Travelling salesman problem, Problema viajante comercio, Temps polynomial, Polynomial time, Tiempo polinomial
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
Univ. California at San Diego, dep. computer sci. eng., La Jolla CA 92093-0114, United States
ISSN:
0364-765X
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.4636998
Database:
PASCAL Archive
Weitere Informationen
We present a polynomial-time approximation algorithm with worst-case ratio 7/6 for the special case of the traveling salesman problem in which all distances are either one or two. We also show that this special case of the traveling salesman problem is MAX SNP-hard, and therefore it is unlikely that it has a polynomial-rime approximation scheme.