Deterministic Algorithms for Multi-criteria TSP
From MaRDI portal
Publication:3010407
DOI10.1007/978-3-642-20877-5_27zbMath1331.68294OpenAlexW1826457205MaRDI QIDQ3010407
Publication date: 1 July 2011
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-20877-5_27
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Approximation algorithms for the TSP with sharpened triangle inequality
- An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
- On the relationship between ATSP and the cycle cover problem
- Approximation algorithms for multi-criteria traveling salesman problems
- Matching is as easy as matrix inversion
- Approximating the Pareto curve with local search for the bicriteria TSP(1,2) problem
- Approximating maximum weight cycle covers in directed graphs with weights zero and one
- An improved approximation algorithm for the ATSP with parameterized triangle inequality
- Derandomizing the Isolation Lemma and Lower Bounds for Circuit Size
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Multi-Criteria TSP: Min and Max Combined
- Approximability and Hardness in Multi-objective Optimization
- 8/7-approximation algorithm for (1,2)-TSP
- Improved Approximation Ratios for Traveling Salesperson Tours and Paths in Directed Graphs
- A 7/9 - Approximation Algorithm for the Maximum Traveling Salesman Problem
- Iterative Rounding for Multi-Objective Optimization Problems
- The complexity of restricted spanning tree problems
- Multicriteria Optimization
- Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques
- On Approximating Multi-Criteria TSP
- Fundamentals of Computation Theory
This page was built for publication: Deterministic Algorithms for Multi-criteria TSP
