2022/11/20 by Moïse Blanchard, Blanchard, Moïse, Alexandre Jacquillat +3
Business, Management and Accounting · Computer Science · Decision Sciences · Mathematics · #Artificial intelligence #Bayesian Modeling and Causal Inference #Bottleneck traveling salesman problem #Computer science #Constant (computer programming) #Discrete Mathematics (cs.DM) #FOS: Computer and information sciences #FOS: Mathematics #Facility Location and Emergency Management #Mathematical optimization #Mathematics #Probabilistic logic #Probability (math.PR) #Risk and Portfolio Optimization #Traveling purchaser problem #Travelling salesman problem
paper · pdf · doi:10.48550/arxiv.2211.11065
published in arXiv (Cornell University) (Cornell University)
openalex publication_date 2022/11/20 · openalex created_date 2022/11/29 · openalex updated_date 2026/08/06
This technical report provides additional results for the main paper ``Probabilistic bounds on the k-Traveling Salesman Problem (k-TSP) and the Traveling Repairman Problem (TRP)''. For the k-TSP, we extend the probabilistic bounds derived in the main paper to the case of distributions with general densities. For the TRP, we propose a utility-based notion of fairness and derive constant-factor probabilistic bounds for this objective, thus extending the TRP bounds from the main paper to non-linear utilities.