Multi-criteria TSP: Min and Max combined

DOI10.1016/j.orl.2011.10.012zbMath1242.90217OpenAlexW2042300635MaRDI QIDQ433836

Bodo Manthey

Publication date: 6 July 2012

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2011.10.012

zbMATH Keywords

traveling salesman problemapproximation algorithmsmulti-criteria optimizationPareto optimization

Mathematics Subject Classification ID

Multi-objective and goal programming (90C29) Combinatorial optimization (90C27)

Related Items (1)

Deterministic algorithms for multi-criteria max-TSP

Cites Work

• Unnamed Item
• Unnamed Item
• Budgeted matching and budgeted matroid intersection via the gasoline puzzle
• Approximation algorithms for multi-criteria traveling salesman problems
• Applications of Discrepancy Theory in Multiobjective Approximation
• Approximating Multi-criteria Max-TSP
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Multi-Criteria TSP: Min and Max Combined
• Approximability and Hardness in Multi-objective Optimization
• A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
• Multicriteria Optimization
• On Approximating Multi-Criteria TSP

This page was built for publication: Multi-criteria TSP: Min and Max combined