Optimum Locations on a Graph with Probabilistic Demands
From MaRDI portal
Cited in
(27)- A simple plant-location model for quantity-setting firms subject to price uncertainty
- 'Multidimensional' extensions and a nested dual approach for the m-median problem
- Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
- Algorithms for the robust 1-center problem on a tree
- An improved algorithm for the minmax regret path centdian problem on trees
- Location analysis: a synthesis and survey
- Complexity of robust single facility location problems on networks with uncertain edge lengths.
- A competitive facility location problem on a tree network with stochastic weights.
- Efficient algorithms for the minmax regret path center problem with length constraint on trees
- An improved algorithm for the minmax regret path center problem on trees
- Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
- On the minmax regret path median problem on trees
- The network \(p\)-median problem with discrete probabilistic demand weights
- The 1-center problem in the plane with independent random weights
- A 1-center problem on the plane with uniformly distributed demand points
- The -reliable minimax and maximin location problems on a network with probabilistic weights
- Probabilistic single obnoxious facility location with fixed budget
- A stochastic programming approach for shelter location and evacuation planning
- Median problems in networks
- Stochastic analysis in location research
- The multifacility center problems with random demand weights
- A guarantee rate optimization model for wastewater treatment system design under uncertainty
- The Weber Location Problem: The Threshold Objective
- Location Science in Canada
- Fifty years of location theory -- a selective review
- The probabilistic gradual covering location problem on a network with discrete random demand weights
- Risk management in uncapacitated facility location models with random demands
This page was built for publication: Optimum Locations on a Graph with Probabilistic Demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5517482)
