EEMCS EPrints Service

Education

Research

Prospective Students

Jobs

Publications

Intranet (internal)

Nederlands

Contact

Organisation

20664 Multi-criteria TSP: Min and max combined

Home Policy Brochure Browse Search User Area Contact Help

Manthey, B. (2012) Multi-criteria TSP: Min and max combined. Operations research letters, 40 (1). pp. 36-38. ISSN 0167-6377 *** ISI Impact 0,537 ***

Full text available as:

PDF

- Univ. of Twente only
204 Kb

Official URL: http://dx.doi.org/10.1016/j.orl.2011.10.012

Abstract

We present randomized approximation algorithms for multi-criteria traveling salesman problems (TSP), where some objective functions should be minimized while others should be maximized. For the symmetric multi-criteria TSP (STSP), we present an algorithm that computes (2/3, $3+\varepsilon$ )-approximate Pareto curves. Here, the first parameter is the approximation ratio for the objectives that should be maximized, and the second parameter is the ratio for the objectives that should be minimized. For the asymmetric multi-criteria TSP (ATSP), we obtain an approximation performance of (1/2, $\log_2 n + \varepsilon$ ).

Item Type:	Article
Research Group:	EWI-DMMP: Discrete Mathematics and Mathematical Programming
Research Program:	CTIT-IE&ICT: Industrial Engineering and ICT
Research Project:	SMABEP: Smoothed Analysis of Belief Propagation
Uncontrolled Keywords:	Multi-criteria optimization, Traveling salesman problem, Approximation algorithms, Multi-criteria TSP, Combinatorial optimization, Pareto optimization, Approximate Pareto curves
ID Code:	20664
Status:	Published
Deposited On:	17 January 2012
Refereed:	Yes
International:	Yes
ISI Impact Factor:	0,537
More Information:	statistics metis

Export this item as:

To request a copy of the PDF please email us request copy

To correct this item please ask your editor

Repository Staff Only: edit this item