Minimax regret p-center location on a network with demand uncertainty

DOI10.1016/S0966-8349(98)00033-3zbMath0928.90042WikidataQ127571311 ScholiaQ127571311MaRDI QIDQ4228787

Igor Averbakh, Oded Berman

Publication date: 1 March 1999

Published in: Location Science (Search for Journal in Brave)

zbMATH Keywords

robust optimizationpolynomial algorithmstransportation network\(p\)-center problems

Mathematics Subject Classification ID

Discrete location and assignment (90B80)

Related Items (47)

Minmax regret for sink location on dynamic flow paths with general capacities ⋮ Minmax regret 1-facility location on uncertain path networks ⋮ Efficient algorithms for the minmax regret path center problem with length constraint on trees ⋮ A quadratic time exact algorithm for continuous connected 2-facility location problem in trees ⋮ Robust facility location problem for hazardous waste transportation ⋮ A new formulation and Benders decomposition for the multi-period maximal covering facility location problem with server uncertainty ⋮ Robust vertex \(p\)-center model for locating urgent relief distribution centers ⋮ Minmax regret location--allocation problem on a network under uncertainty ⋮ Robust min-max regret covering problems ⋮ Robust mean absolute deviation problems on networks with linear vertex weights ⋮ An improved algorithm for the minmax regret path centdian problem on trees ⋮ Flexible-attribute problems ⋮ Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem ⋮ New approaches to the robust 1-center location problems on tree networks ⋮ Robust Algorithms for TSP and Steiner Tree ⋮ Universal Algorithms for Clustering Problems ⋮ The minmax regret gradual covering location problem on a network with incomplete information of demand weights ⋮ Constant work-space algorithms for facility location problems ⋮ Robust maximum capture facility location under random utility maximization models ⋮ An improved algorithm for the minmax regret path center problem on trees ⋮ A robust \(p\)-center problem under pressure to locate shelters in wildfire context ⋮ A distributionally robust optimization approach for two-stage facility location problems ⋮ The two-center problem of uncertain points on a real line ⋮ Computing the center of uncertain points on cactus graphs ⋮ A note on the minmax regret centdian location on trees ⋮ Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks ⋮ A two-stage robust model for a reliable \(p\)-center facility location problem ⋮ An optimal algorithm for the weighted backup 2-center problem on a tree ⋮ Computing the center of uncertain points on tree networks ⋮ The stratified \(p\)-center problem ⋮ The backup 2‐center and backup 2‐median problems on trees ⋮ Capacitated multi-period maximal covering location problem with server uncertainty ⋮ A note on computing the center of uncertain data on the real line ⋮ Fighting terrorism: how to position rapid response teams? ⋮ Approximating the probabilistic \(p\)-center problem under pressure ⋮ Strategic facility location: A review ⋮ Min-max and min-max regret versions of combinatorial optimization problems: A survey ⋮ Relative Robust and Adaptive Optimization ⋮ Covering uncertain points in a tree ⋮ Minimax regret path location on trees ⋮ Algorithms for the robust 1-center problem on a tree ⋮ Minmax regret \(k\)-sink location on a dynamic path network with uniform capacities ⋮ Two-stage flexible-choice problems under uncertainty ⋮ Robustness in operational research and decision aiding: a multi-faceted issue ⋮ On the minmax regret path median problem on trees ⋮ Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management ⋮ Backup multifacility location problem with \(l_p\) norm

This page was built for publication: Minimax regret p-center location on a network with demand uncertainty