Optimum Locations on a Graph with Probabilistic Demands

DOI10.1287/OPRE.14.3.409zbMATH Open0142.17704OpenAlexW2113863393MaRDI QIDQ5517482FDOQ5517482

Authors:

Publication date: 1966

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/7a6c2202edb51d51ced8da1b923174a829938976

zbMATH Keywords

operations research

Cited In (26)

• Locating a discrete subtree of minimum variance on trees: new strategies to tackle a very hard problem
• The 1-center problem in the plane with independent random weights
• On the minmax regret path median problem on trees
• 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
• Probabilistic single obnoxious facility location with fixed budget
• The multifacility center problems with random demand weights
• A guarantee rate optimization model for wastewater treatment system design under uncertainty
• Stochastic analysis in location research
• The network \(p\)-median problem with discrete probabilistic demand weights
• Algorithms for the robust 1-center problem on a tree
• Dynamic facility location when the total number of facilities is uncertain: A decision analysis approach
• Location analysis: a synthesis and survey
• A competitive facility location problem on a tree network with stochastic weights.
• A 1-center problem on the plane with uniformly distributed demand points
• A simple plant-location model for quantity-setting firms subject to price uncertainty
• The probabilistic gradual covering location problem on a network with discrete random demand weights
• Median problems in networks
• Risk management in uncapacitated facility location models with random demands
• 'Multidimensional' extensions and a nested dual approach for the m-median problem
• The \(\beta \)-reliable minimax and maximin location problems on a network with probabilistic weights
• Location Science in Canada
• The Weber Location Problem: The Threshold Objective
• Complexity of robust single facility location problems on networks with uncertain edge lengths.
• A stochastic programming approach for shelter location and evacuation planning
• An improved algorithm for the minmax regret path centdian problem on trees

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)