## Approximation Algorithms for Combinatorial Multicriteria Optimization Problems

• The computational complexity of combinatorial multiple objective programming problems is investigated. NP-completeness and #P-completeness results are presented. Using two definitions of approximability, general results are presented, which outline limits for approximation algorithms. The performance of the well known tree and Christofides' heuristics for the TSP is investigated in the multicriteria case with respect to the two definitions of approximability.

Author: Matthias Ehrgott urn:nbn:de:hbz:386-kluedo-4818 Report in Wirtschaftsmathematik (WIMA Report) (39) Preprint English 1999 1999 Technische Universität Kaiserslautern 2000/04/03 Approximation Algorithms; Combinatorial Optimization ; Multicriteria Optimization ; NP-completeness Fachbereich Mathematik 5 Naturwissenschaften und Mathematik / 51 Mathematik / 510 Mathematik 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C27 Combinatorial optimization 90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING / 90Cxx Mathematical programming [See also 49Mxx, 65Kxx] / 90C29 Multi-objective and goal programming Standard gemäß KLUEDO-Leitlinien vor dem 27.05.2011

$Rev: 13581$