Differential approximation results for the traveling salesman problem with distances 1 and 2
From MaRDI portal
Publication:1869490
DOI10.1016/S0377-2217(02)00222-9zbMATH Open1012.90044OpenAlexW1994306154MaRDI QIDQ1869490FDOQ1869490
Authors: Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse 
Publication date: 10 April 2003
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0377-2217(02)00222-9
Recommendations
Cites Work
- Title not available (Why is that?)
- Structure preserving reductions among convex optimization problems
- Differential approximation algorithms for some combinatorial optimization problems
- On an approximation measure founded on the links between optimization and polynomial approximation theory
- The Traveling Salesman Problem with Distances One and Two
- Approximation algorithms for indefinite quadratic programming
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The complexity of approximating a nonlinear program
- Measuring the Quality of Approximate Solutions to Zero-One Programming Problems
- Title not available (Why is that?)
- Toward a unified approach for the classification of NP-complete optimization problems
Cited In (13)
- Approximation of the double traveling salesman problem with multiple stacks
- Differential approximation results for the traveling salesman and related problems
- On the approximation hardness of dense TSP and other path problems
- An improved approximation algorithm for the maximum TSP
- New approximation algorithms for \((1,2)\)-TSP
- A better differential approximation ratio for symmetric TSP
- Title not available (Why is that?)
- Fundamentals of Computation Theory
- A survey on the structure of approximation classes
- Approximation algorithms for the traveling salesman problem
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- A 3/4 differential approximation algorithm for traveling salesman problem
- Differential approximation of NP-hard problems with equal size feasible solutions
This page was built for publication: Differential approximation results for the traveling salesman problem with distances 1 and 2
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1869490)
