Algorithms for the robust 1-center problem on a tree
From MaRDI portal
Publication:1569932
DOI10.1016/S0377-2217(99)00257-XzbMath0967.90065MaRDI QIDQ1569932
Publication date: 9 July 2000
Published in: European Journal of Operational Research (Search for Journal in Brave)
Deterministic network models in operations research (90B10) Discrete location and assignment (90B80)
Related Items
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, Robust vertex \(p\)-center model for locating urgent relief distribution centers, Minmax regret location--allocation problem on a network under uncertainty, 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, The minmax regret gradual covering location problem on a network with incomplete information of demand weights, Constant work-space algorithms for facility location problems, Improved algorithms for computing minmax regret sinks on dynamic path and tree networks, 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 note on the minmax regret centdian location on trees, Minmax regret 1-center algorithms for path/tree/unicycle/cactus networks, An optimal algorithm for the weighted backup 2-center problem on a tree, Facility location problems with uncertainty on the plane, The backup 2‐center and backup 2‐median problems on trees, Minimax regret 1-median problem in dynamic path networks, Robust absolute single machine makespan scheduling-location problem on trees, Complexity of robust single facility location problems on networks with uncertain edge lengths., Minimax regret path location on trees, Two-stage flexible-choice problems under uncertainty, 2-approximation algorithm for minmax absolute maximum lateness scheduling-location problem, Minimax regret 1-sink location problem in dynamic path networks, On the minmax regret path median problem on trees, Robust weighted vertex \(p\)-center model considering uncertain data: an application to emergency management
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Robust discrete optimization and its applications
- Linear Time Algorithms for Two- and Three-Variable Linear Programs
- Linear-Time Algorithms for Linear Programming in $R^3 $ and Related Problems
- Sensitivity analysis of the optimal location of a facility
- An Algorithmic Approach to Network Location Problems. I: Thep-Centers
- Sensitivity Analysis in Minisum Facility Location Problems
- Probabilistic Weights in the One-Dimensional Facility Location Problem
- Minimax regret p-center location on a network with demand uncertainty
- Minmax-regret robust 1-median location on a tree
- Robust Optimization of Large-Scale Systems
- Optimum Locations on a Graph with Probabilistic Demands
- Letter to the Editor—Optimum Locations on Graphs with Correlated Normal Demands
