Convex Location Problems on Tree Networks

DOI10.1287/opre.24.4.628zbMath0341.90042MaRDI QIDQ4109496

Timothy J. Lowe, P. M. Dearing, Richard L. Francis

Publication date: 1976

Published in: Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/opre.24.4.628

Mathematics Subject Classification ID

90C35: Programming involving graphs or networks

05C35: Extremal problems in graph theory

90C25: Convex programming

90B10: Deterministic network models in operations research

Related Items

Low order polynomial bounds on the expected performance of local improvement algorithms, On the number of iterations of local improvement algorithms, Peakless functions on graphs, Locating facilities which interact: Some solvable cases, Networklike metric spaces, On locating new facilities in a competitive environment, Locational analysis, An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree, Some personal views on the current state and the future of locational analysis, Complexity results for the \(p\)-median problem with mutual communication, The least element property of center location on tree networks with applications to distance and precedence constrained problems, Group centre and group median of a tree, Algorithmic results for ordered median problems, Center problems with pos/neg weights on trees, A multifacility location problem on median spaces, Facility location on a tree with maximum distance constraints, Weber's problem and weiszfeld's algorithm in general spaces, Minimean Location of Different Facilities on a Line Network