Differential approximation results for the traveling salesman problem with distances 1 and 2
type: Item
instance of: scholarly article
title: Differential approximation results for the traveling salesman problem with distances 1 and 2
zbMATH Open document ID: 1012.90044
DOI: 10.1016/S0377-2217(02)00222-9
author: Jérôme Monnot
author: Vangelis Th. Paschos
author: Sophie Toulouse
published in: European Journal of Operational Research
publication date: 2003-04-10T00:00:00Z
Mathematics Subject Classification ID: 90C27
zbMATH DE Number: 1896795
zbMATH Keywords: approximation algorithm
zbMATH Keywords: NP-complete problem
zbMATH Keywords: traveling salesman
MaRDI profile type: Publication
cites work: Q4725744
cites work: Structure preserving reductions among convex optimization problems
cites work: Toward a unified approach for the classification of NP-complete optimization problems
cites work: The complexity of approximating a nonlinear program
cites work: Differential approximation algorithms for some combinatorial optimization problems
cites work: On an approximation measure founded on the links between optimization and polynomial approximation theory
cites work: Q4535019
cites work: Q4198056
cites work: Q4782716
cites work: The Traveling Salesman Problem with Distances One and Two
cites work: Q3686457
cites work: Approximation algorithms for indefinite quadratic programming
cites work: Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
full work available at URL: s0377-2217(02)00222-9
OpenAlex ID: W1994306154
description: scientific article; zbMATH DE number 1896795