An algorithm for the minimum variance point of a network

DOI10.1051/RO/1991250101191MaRDI QIDQ3971963zbMATH OpenOpenAlexFDO

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

zbMATH Keywords

minimal variance pointnetwork locationnetwork 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) Discrete location and assignment (90B80) Abstract computational complexity for mathematical programming problems (90C60)

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

Cited in

(8)

• Improved algorithms for several network location problems with equality measures.
• A generalized model of equality measures in network location problems
• scientific article; zbMATH DE number 47930 (Why is no real title available?)
• Balanced location on a graph
• The Variance Location Problem on a Network with Continuously distributed demand
• Locating a Point of Minimum Variance on Triangular Graphs
• The maximum absolute deviation measure in location problems on networks
• The path-variance problem on tree networks

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)