Deterministic algorithms for multi-criteria TSP
From MaRDI portal
Recommendations
Cites work
- 8/7-approximation algorithm for (1,2)-TSP
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- Approximability and Hardness in Multi-objective Optimization
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Approximation algorithms for the TSP with sharpened triangle inequality
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
- Fundamentals of Computation Theory
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
- Iterative Rounding for Multi-Objective Optimization Problems
- Matching is as easy as matrix inversion
- Multi-criteria TSP: Min and Max combined
- Multicriteria Optimization
- On approximating multi-criteria TSP
- On the relationship between ATSP and the cycle cover problem
- The complexity of restricted spanning tree problems
Cited in
(4)
This page was built for publication: Deterministic algorithms for multi-criteria TSP
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3010407)