An algorithm for the minimum variance point of a network
From MaRDI portal
Publication:3971963
DOI10.1051/ro/1991250101191zbMath0742.90048OpenAlexW2285685945MaRDI QIDQ3971963
Publication date: 25 June 1992
Published in: RAIRO - Operations Research (Search for Journal in Brave)
Full work available at URL: https://eudml.org/doc/104996
network locationminimal variance pointnetwork with given weightsvariance of distancesweighted shortest path distances
Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80) Computational methods for problems pertaining to operations research and mathematical programming (90-08)
Related Items
Improved algorithms for several network location problems with equality measures. ⋮ Balanced location on a graph ⋮ A generalized model of equality measures in network location problems ⋮ The path-variance problem on tree networks ⋮ The maximum absolute deviation measure in location problems on networks ⋮ The Variance Location Problem on a Network with Continuously distributed demand
This page was built for publication: An algorithm for the minimum variance point of a network
