Multi-criteria TSP: Min and Max combined
From MaRDI portal
Publication:433836
Recommendations
Cites work
- scientific article; zbMATH DE number 1330033 (Why is no real title available?)
- 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
- Applications of discrepancy theory in multiobjective approximation
- Approximability and Hardness in Multi-objective Optimization
- Approximating Multi-criteria Max-TSP
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Budgeted matching and budgeted matroid intersection via the gasoline puzzle
- Multi-criteria TSP: Min and Max combined
- Multicriteria Optimization
- On approximating multi-criteria TSP
Cited in
(9)- Deterministic algorithms for multi-criteria max-TSP
- Multi-criteria TSP: Min and Max combined
- On approximating multi-criteria TSP
- scientific article; zbMATH DE number 624797 (Why is no real title available?)
- Fundamentals of Computation Theory
- Approximating Multi-criteria Max-TSP
- Combining traveling salesman and traveling repairman problems: a multi-objective approach based on multiple scenarios
- On approximating multicriteria \textsc{TSP}
- THE TSP AND THE SUM OF ITS MARGINAL VALUES
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)