Multi-criteria TSP: Min and Max combined
From MaRDI portal
Publication:433836
DOI10.1016/J.ORL.2011.10.012zbMATH Open1242.90217OpenAlexW2042300635MaRDI QIDQ433836FDOQ433836
Authors: 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
Recommendations
Cites Work
- Multicriteria Optimization
- Title not available (Why is that?)
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Applications of discrepancy theory in multiobjective approximation
- Approximating Multi-criteria Max-TSP
- Multi-criteria TSP: Min and Max combined
- Approximability and Hardness in Multi-objective Optimization
- On approximating multi-criteria TSP
Cited In (8)
- Multi-criteria TSP: Min and Max combined
- On approximating multicriteria \textsc{TSP}
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- THE TSP AND THE SUM OF ITS MARGINAL VALUES
- On approximating multi-criteria TSP
- Fundamentals of Computation Theory
- Approximating Multi-criteria Max-TSP
- Deterministic algorithms for multi-criteria max-TSP
This page was built for publication: Multi-criteria TSP: Min and Max combined
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q433836)