On approximating multicriteria TSP

DOI10.1145/2151171.2151180zbMath1295.90063OpenAlexW2141596881MaRDI QIDQ3189058

Bodo Manthey

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2151171.2151180

zbMATH Keywords

multiobjective optimizationtraveling salesman problemapproximation algorithmsmulticriteria optimization

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) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (5)

Approximation Methods for Multiobjective Optimization Problems: A Survey ⋮ Approximation with a fixed number of solutions of some multiobjective maximization problems ⋮ Covers and approximations in multiobjective optimization ⋮ Bi-objective matchings with the triangle inequality ⋮ Deterministic algorithms for multi-criteria max-TSP

This page was built for publication: On approximating multicriteria TSP