Optimal-transport satisficing with applications to capacitated hub location

DOI10.1016/J.COR.2024.106566MaRDI QIDQ6561211zbMATH OpenFDO

Authors Jie Hu, Tianqi Liu, Zhi Chen, Shuming Wang

Publication date 25 June 2024

Published in Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.COR.2024.106566

zbMATH Keywords

capacitycoherent satisficingcolumn-and-constraint generationhub locationoptimal transport

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites work

• A capacitated hub location problem under hose demand uncertainty
• A Lagrangean heuristic for hub-and-spoke system design with capacity selection and congestion
• Adapting polyhedral properties from facility to hub location problems
• Adjustable robust optimization via Fourier-Motzkin elimination
• Adjustable robust solutions of uncertain linear programs
• Conic programming reformulations of two-stage distributionally robust linear programs over Wasserstein balls
• Data-driven distributionally robust capacitated facility location problem
• Data-driven distributionally robust optimization using the Wasserstein metric: performance guarantees and tractable reformulations
• Distributionally Robust Convex Optimization
• Distributionally Robust Stochastic Optimization with Wasserstein Distance
• Managing underperformance risk in project portfolio selection
• On the power and limitations of affine policies in two-stage adaptive optimization
• On the rate of convergence in Wasserstein distance of the empirical measure
• Quantifying distributional model risk via optimal transport
• Robust Satisficing
• Routing optimization under uncertainty
• Satisficing Measures for Analysis of Risky Positions
• Sharing the value‐at‐risk under distributional ambiguity
• Solving two-stage robust optimization problems using a column-and-constraint generation method
• Stochastic uncapacitated hub location
• The Price of Robustness
• The stochastic p-hub center problem with service-level constraints
• Tractable reformulations of two-stage distributionally robust linear programs over the type-\(\infty\) Wasserstein ball

Cited in

(3)

• Machine learning-enriched distributionally robust optimization and hybrid decomposition to joint optimization of transportation hub network design and pricing
• A literature review on hub location-routing models and their solution techniques
• A hybrid framework for designing customer centric hub and spoke transportation networks with delivery time windows

This page was built for publication: Optimal-transport satisficing with applications to capacitated hub location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6561211)