Wasserstein Distance and the Distributionally Robust TSP
From MaRDI portal
Publication:5131541
DOI10.1287/opre.2018.1746zbMath1446.90050OpenAlexW2904920481WikidataQ128749632 ScholiaQ128749632MaRDI QIDQ5131541
Mehdi Behroozi, John Gunnar Carlsson, Krešimir Mihić
Publication date: 8 November 2020
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/0063e13da2eb06317d3d12ba82d73841ee4270e5
Related Items
Frameworks and results in distributionally robust optimization ⋮ Distributionally robust profit opportunities ⋮ Balancing the profit and capacity under uncertainties: a target‐based distributionally robust knapsack problem ⋮ Distributions with maximum spread subject to Wasserstein distance constraints ⋮ Distributionally robust equilibrious hybrid vehicle routing problem under twofold uncertainty ⋮ Distributionally robust joint chance-constrained programming: Wasserstein metric and second-order moment constraints ⋮ Data-driven distributionally robust capacitated facility location problem ⋮ Wasserstein distributionally robust shortest path problem ⋮ The value of personalized dispatch in O2O on-demand delivery services ⋮ Tight bounds for a class of data-driven distributionally robust risk measures ⋮ Data-Driven Robust Resource Allocation with Monotonic Cost Functions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Dynamic design of sales territories
- The robust vehicle routing problem with time windows
- On the rate of convergence in Wasserstein distance of the empirical measure
- Weighted Csiszár-Kullback-Pinsker inequalities and applications to transportation inequalities
- Quantitative concentration inequalities for empirical measures on non-compact spaces
- Designing delivery districts for the vehicle routing problem with stochastic demands
- Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
- A framework for optimization under ambiguity
- Shadow prices in territory division
- Dividing a Territory Among Several Vehicles
- The Robust Capacitated Vehicle Routing Problem Under Demand Uncertainty
- Robust Partitioning for Stochastic Multivehicle Routing
- Robustifying Convex Risk Measures for Linear Portfolios: A Nonparametric Approach
- Distributionally Robust Optimization Under Moment Uncertainty with Application to Data-Driven Problems
- Robust Mean-Covariance Solutions for Stochastic Optimization
- Bounds and Heuristics for Capacitated Routing Problems
- Worst-Case and Probabilistic Analysis of a Geometric Location Problem
- Power Diagrams: Properties, Algorithms and Applications
- On Choosing and Bounding Probability Metrics
- Distributed Algorithms for Environment Partitioning in Mobile Robotic Networks
- Adaptive Deployment of Mobile Robotic Networks