An Optimal Algorithm for Weighted Minimax Flow Centers on Trees

DOI10.1287/TRSC.25.4.314MaRDI QIDQ3991674zbMATH OpenOpenAlexFDO

Authors H. A. Eiselt, Michel Gendreau

Publication date 28 June 1992

Published in Transportation Science (Search for Journal in Brave)

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

zbMATH Keywords

facility locationslinear time algorithm

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Deterministic network models in operations research (90B10) Programming involving graphs or networks (90C35)

Recommendations

• A computational study of minimax flow centers in trees
• scientific article; zbMATH DE number 915979
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• The centdian subtree on tree networks
• Medi-Centers of a Tree

Cited in

(10)

• Optimal placement of identical resources in a tree
• Optimal weight allocation in rooted trees
• An optimal algorithm for single maximum coverage location on trees and related problems
• Algorithms for finding P-centers on a weighted tree (for relatively small P)
• The minimax multistop location problem on a tree
• scientific article; zbMATH DE number 828003 (Why is no real title available?)
• scientific article; zbMATH DE number 915979 (Why is no real title available?)
• High Spies (or How to Win a Programming Contest)
• A computational study of minimax flow centers in trees
• Convergence and correctness of belief propagation for weighted min-max flow

This page was built for publication: An Optimal Algorithm for Weighted Minimax Flow Centers on Trees

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