Locating a Point of Minimum Variance on Triangular Graphs

DOI10.1287/TRSC.23.3.216MaRDI QIDQ4732283zbMATH OpenOpenAlexFDO

Authors Rex K. Kincaid, Oded Maimon

Publication date 1989

Published in Transportation Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/trsc.23.3.216

zbMATH Keywords

linear time algorithmlocation theory on networksvariance measure for triangular graphs

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Inventory, storage, reservoirs (90B05)

Recommendations

• An algorithm for the minimum variance point of a network
• A Quadratic Time Algorithm for the Minmax Length Triangulation
• The path-variance problem on tree networks
• Solutions to the Minimum Variance Problem Using Delaunay Triangulation
• scientific article; zbMATH DE number 4085448

Cited in

(7)

• Improved algorithms for several network location problems with equality measures.
• Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles
• Exploiting Structure: Location Problems on Trees and Treelike Graphs
• Solutions to the Minimum Variance Problem Using Delaunay Triangulation
• An algorithm for the minimum variance point of a network
• 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: Locating a Point of Minimum Variance on Triangular Graphs

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