The traveling salesman problem with distances one and two
Mathematics of Operations Research
On Syntactic versus Computational Views of Approximability
SIAM Journal on Computing
New Results on the Old k-opt Algorithm for the Traveling Salesman Problem
SIAM Journal on Computing
On the approximability of the traveling salesman problem (extended abstract)
STOC '00 Proceedings of the thirty-second annual ACM symposium on Theory of computing
A 7/8-approximation algorithm for metric Max TSP
Information Processing Letters
Differential approximation results for the traveling salesman and related problems
Information Processing Letters
Local Search in Combinatorial Optimization
Local Search in Combinatorial Optimization
On the approximability of trade-offs and optimal access of Web sources
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Multicriteria Optimization
Design and analysis of stochastic local search for the multiobjective traveling salesman problem
Computers and Operations Research
Deterministic algorithms for multi-criteria TSP
TAMC'11 Proceedings of the 8th annual conference on Theory and applications of models of computation
On approximating multicriteria TSP
ACM Transactions on Algorithms (TALG)
Multi-Criteria TSP: min and max combined
WAOA'09 Proceedings of the 7th international conference on Approximation and Online Algorithms
A survey of approximation results for local search algorithms
Efficient Approximation and Online Algorithms
Approximation algorithms for multi-criteria traveling salesman problems
WAOA'06 Proceedings of the 4th international conference on Approximation and Online Algorithms
Single approximation for biobjective max TSP
WAOA'11 Proceedings of the 9th international conference on Approximation and Online Algorithms
Fair solutions for some multiagent optimization problems
Autonomous Agents and Multi-Agent Systems
Single approximation for the biobjective Max TSP
Theoretical Computer Science
Computers & Mathematics with Applications
Hi-index | 5.23 |
Local search has been widely used in combinatorial optimization (Local Search in Combinatorial Optimization, Wiley, New York, 1997), however, in the case of multicriteria optimization almost no results are known concerning the ability of local search algorithms to generate "good" solutions with performance guarantee. In this paper, we introduce such an approach for the classical traveling salesman problem (TSP) problem (Proc. STOC'00, 2000, pp. 126-133). We show that it is possible to get in linear time, a 3/2-approximate Pareto curve using an original local search procedure based on the 2-opt neighborhood, for the bicriteria TSP(1,2) problem where every edge is associated to a couple of distances which are either 1 or 2 (Math. Oper. Res. 18 (1) (1993) 1).