Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem

DOI10.1016/S0304-3975(03)00376-1zbMath1067.90056MaRDI QIDQ1884968

Evripidis Bampis, Eric Angel, Laurent Gourvès

Publication date: 27 October 2004

Published in: Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

Approximation algorithmsLocal searchMulticriteria TSP

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Multi-objective and goal programming (90C29) Search theory (90B40) Approximation methods and heuristics in mathematical programming (90C59) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (14)

Advancing local search approximations for multiobjective combinatorial optimization problems ⋮ A decomposition based estimation of distribution algorithm for multiobjective traveling salesman problems ⋮ Anytime Pareto local search ⋮ Approximation schemes for bi-objective combinatorial optimization and their application to the TSP with profits ⋮ Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ A tolerance function for the multiobjective set covering problem ⋮ New Approximation Algorithms for (1,2)-TSP ⋮ Time complexity analysis of evolutionary algorithms for 2-hop \((1,2)\)-minimum spanning tree problem ⋮ Deterministic Algorithms for Multi-criteria TSP ⋮ On local optima in multiobjective combinatorial optimization problems ⋮ Covers and approximations in multiobjective optimization ⋮ Multi-objective vehicle routing problems ⋮ Design and analysis of stochastic local search for the multiobjective traveling salesman problem ⋮ Approximation algorithms for multi-criteria traveling salesman problems

Cites Work

• Differential approximation results for the traveling salesman and related problems
• Multicriteria optimization
• Approximation algorithms for the traveling salesman problem
• Differential approximation results for the traveling salesman problem with distances 1 and 2
• On the approximability of the traveling salesman problem (extended abstract)
• On Syntactic versus Computational Views of Approximability
• New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
• The Traveling Salesman Problem with Distances One and Two
• A Method for Solving Traveling-Salesman Problems
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem