An algorithm for the minimum variance point of a network

DOI10.1051/RO/1991250101191zbMATH Open0742.90048OpenAlexW2285685945MaRDI QIDQ3971963FDOQ3971963

Authors: Pierre Hansen, Maolin Zheng 

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

Recommendations

• scientific article; zbMATH DE number 1532274
• scientific article; zbMATH DE number 1138299
• A new algorithm for minimum path in a network
• A least-squares minimum-cost network flow algorithm
• Locating a Point of Minimum Variance on Triangular Graphs
• An algorithm for the minimum spanning tree with a pivotal point in directed networks
• scientific article; zbMATH DE number 3848514
• Network manipulation algorithm based on inexact alternating minimization
• Approximating a minimum Manhattan network
• A heuristic algorithm for network equilibration

zbMATH Keywords

network locationminimal variance pointnetwork with given weightsvariance of distancesweighted shortest path distances

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Abstract computational complexity for mathematical programming problems (90C60) Discrete location and assignment (90B80)

Cited In (7)

• Improved algorithms for several network location problems with equality measures.
• The path-variance problem on tree networks
• Balanced location on a graph
• Locating a Point of Minimum Variance on Triangular Graphs
• A generalized model of equality measures in network location problems
• 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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3971963)