Minmax Regret 1-Facility Location on Uncertain Path Networks
From MaRDI portal
Publication:2872137
DOI10.1007/978-3-642-45030-3_68zbMath1408.90167OpenAlexW1699511225MaRDI QIDQ2872137
Publication date: 14 January 2014
Published in: Algorithms and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-45030-3_68
Programming involving graphs or networks (90C35) Analysis of algorithms (68W40) Transportation, logistics and supply chain management (90B06) Discrete location and assignment (90B80)
Related Items (6)
Minmax regret 1-facility location on uncertain path networks ⋮ Minimax regret 1-sink location problem in dynamic cycle networks ⋮ Minimax regret 1-median problem in dynamic path networks ⋮ Minimax regret vertex 2-sink location problem in dynamic path networks ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Minimax regret 1-sink location problem in dynamic path networks
This page was built for publication: Minmax Regret 1-Facility Location on Uncertain Path Networks
