Approximation algorithms for the traveling salesman problem
DOI10.1007/S001860200239zbMATH Open1064.90572OpenAlexW2004153594MaRDI QIDQ1812290FDOQ1812290
Authors: Jérôme Monnot, Vangelis Th. Paschos, Sophie Toulouse 
Publication date: 23 June 2003
Published in: Mathematical Methods of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s001860200239
Recommendations
- scientific article; zbMATH DE number 1839451
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Differential approximation results for the traveling salesman and related problems
- scientific article; zbMATH DE number 1500530
- The Traveling Salesman Problem with Distances One and Two
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25) Abstract computational complexity for mathematical programming problems (90C60)
Cited In (27)
- Title not available (Why is that?)
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Combining local search and elicitation for multi-objective combinatorial optimization
- Differential approximation results for the traveling salesman and related problems
- Generalized traveling salesman problem reduction algorithms
- Efficiency of a local algorithm for solving the traveling salesman problem
- A better differential approximation ratio for symmetric TSP
- Title not available (Why is that?)
- Title not available (Why is that?)
- Fast Algorithms for Geometric Traveling Salesman Problems
- THE TRAVELING SALESMAN PROBLEM: APPROXIMATE ALGORITHM BY BRANCH-AND-BOUND METHOD WITH GUARANTEED PRECISION
- A survey on the structure of approximation classes
- Approximation Polynomial Algorithms for Some Modifications of TSP
- Title not available (Why is that?)
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- Title not available (Why is that?)
- \(z\)-approximations
- Title not available (Why is that?)
- A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Differential approximation results for the traveling salesman problem with distances 1 and 2
- Structural properties of hard metric TSP inputs (extended abstract)
- On the approximability of the traveling salesman problem
- A 3/4 differential approximation algorithm for traveling salesman problem
- Title not available (Why is that?)
This page was built for publication: Approximation algorithms for the traveling salesman problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1812290)
