Treffer: Multi-criteria TSP: Min and max combined
Title:
Multi-criteria TSP: Min and max combined
Authors:
Source:
Operations research letters. 40(1):36-38
Publisher Information:
Oxford: Elsevier, 2012.
Publication Year:
2012
Physical Description:
print, 14 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences appliquees, Applied sciences, Recherche operationnelle. Gestion, Operational research. Management science, Recherche opérationnelle et modèles formalisés de gestion, Operational research and scientific management, Programmation mathématique, Mathematical programming, Flots dans les réseaux. Problèmes combinatoires, Flows in networks. Combinatorial problems, Logistique, Logistics, Algorithme approximation, Approximation algorithm, Algoritmo aproximación, Algorithme randomisé, Randomized algorithm, Algoritmo aleatorizado, Analyse multicritère, Multicriteria analysis, Análisis multicriterio, Asymétrie, Asymmetry, Asimetría, Fonction objectif, Objective function, Función objetivo, Méthode minimax, Minimax method, Método minimax, Optimisation, Optimization, Optimización, Optimum Pareto, Pareto optimum, Optimo Pareto, Plan randomisé, Randomized design, Plan aleatorizado, Problème commis voyageur, Travelling salesman problem, Problema viajante comercio, Approximation algorithms, Multi-criteria optimization, Pareto optimization, Traveling salesman problem
Document Type:
Fachzeitschrift
Article
File Description:
text
Language:
English
Author Affiliations:
University of Twente, Department of Applied Mathematics, P.O. Box 217, 7500 AE Enschede, Netherlands
ISSN:
0167-6377
Rights:
Copyright 2015 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Operational research. Management
Accession Number:
edscal.25466141
Database:
PASCAL Archive
Weitere Informationen
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 + ε)-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. log2 n + ε).