A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
From MaRDI portal
Publication:3503857
DOI10.1007/978-3-540-68891-4_23zbMath1143.90383OpenAlexW1598073724MaRDI QIDQ3503857
Publication date: 10 June 2008
Published in: Integer Programming and Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-68891-4_23
Programming involving graphs or networks (90C35) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (11)
Routing Under Uncertainty: The a priori Traveling Repairman Problem ⋮ Approximation algorithms for the a priori traveling repairman ⋮ On the Complexity of Master Problems ⋮ A priori TSP in the Scenario Model ⋮ Designing cost-sharing methods for Bayesian games ⋮ Deterministic sampling algorithms for network design ⋮ The A priori traveling repairman problem ⋮ A priori TSP in the scenario model ⋮ Designing Networks with Good Equilibria under Uncertainty ⋮ Designing Cost-Sharing Methods for Bayesian Games ⋮ A constant approximation algorithm for the uniform a priori capacitated vehicle routing problem with unit demands
This page was built for publication: A Constant Approximation Algorithm for the a priori Traveling Salesman Problem
