Minimax regret p-center location on a network with demand uncertainty
From MaRDI portal
Publication:4228787
Recommendations
Cited in
(55)- Min-max and min-max regret versions of combinatorial optimization problems: A survey
- Two-stage flexible-choice problems under uncertainty
- Robustness in operational research and decision aiding: a multi-faceted issue
- Algorithms for the robust 1-center problem on a tree
- A quadratic time exact algorithm for continuous connected 2-facility location problem in trees
- An improved algorithm for the minmax regret path centdian problem on trees
- Facility location problems with uncertainty on the plane
- A note on computing the center of uncertain data on the real line
- Strategic facility location: A review
- A two-stage robust model for a reliable p-center facility location problem
- The stratified p-center problem
- Capacitated multi-period maximal covering location problem with server uncertainty
- Minmax regret for sink location on dynamic flow paths with general capacities
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- Robust min-max regret covering problems
- Constant work-space algorithms for facility location problems
- 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
- Minmax regret k-sink location on a dynamic path network with uniform capacities
- 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
- New approaches to the robust 1-center location problems on tree networks
- The two-center problem of uncertain points on a real line
- The \(p\)-center problem under locational uncertainty of demand points
- Minimax regret single-facility ordered median location problems on networks
- Minmax regret 1-facility location on uncertain path networks
- Robust facility location problem for hazardous waste transportation
- Minimax regret path location on trees
- 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
- Relative Robust and Adaptive Optimization
- Error-bound driven demand point aggregation for the rectilinear distance p-center model
- Minmax Regret Median Location on a Network Under Uncertainty
- Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks
- An optimal algorithm for the weighted backup 2-center problem on a tree
- The backup 2‐center and backup 2‐median problems on trees
- Computing the center of uncertain points on tree networks
- Robust mean absolute deviation problems on networks with linear vertex weights
- Robust MILP formulations for the two-stage weighted vertex \(p\)-center problem
- Robust Algorithms for TSP and Steiner Tree
- Universal Algorithms for Clustering Problems
- Robust maximum capture facility location under random utility maximization models
- Flexible-attribute problems
- Computing the center of uncertain points on cactus graphs
- The minmax regret gradual covering location problem on a network with incomplete information of demand weights
- Fighting terrorism: how to position rapid response teams?
- Approximating the probabilistic p-center problem under pressure
- Robust algorithms for TSP and Steiner tree
- Computing the center of uncertain points on cactus graphs
- Universal algorithms for clustering problems
- Minmax-regret k-sink location on a dynamic tree network with uniform capacities
- Minmax regret location--allocation problem on a network under uncertainty
- A note on the minmax regret centdian location on trees
This page was built for publication: Minimax regret p-center location on a network with demand uncertainty
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4228787)
