A computational study of minimax flow centers in trees

DOI10.1007/BF02242923zbMath0692.05026OpenAlexW412342974MaRDI QIDQ583225

H. A. Eiselt

Publication date: 1990

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02242923

zbMATH Keywords

location problemlocation modelcomputational experienceweighted treesenumeration procedureflow problemlargest flowminimax flow centers

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Extremal problems in graph theory (05C35) Deterministic network models in operations research (90B10)

Cites Work

• Minimax linear programming problem
• Algorithms for the minimax transportation problem

This page was built for publication: A computational study of minimax flow centers in trees