Convex Location Problems on Tree Networks

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

P. M. Dearing, Timothy J. Lowe, 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

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

Related Items

Networklike metric spaces ⋮ Double bound method for solving the \(p\)-center location problem ⋮ On the number of iterations of local improvement algorithms ⋮ A multifacility location problem on median spaces ⋮ Facility location on a tree with maximum distance constraints ⋮ To stop or not to stop: a time-constrained trip covering location problem on a tree network ⋮ Efficient algorithms for finding <scp>2‐medians</scp> of a tree ⋮ A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments ⋮ On locating new facilities in a competitive environment ⋮ Locational analysis ⋮ Peakless functions on graphs ⋮ L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem ⋮ Locating facilities which interact: Some solvable cases ⋮ An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree ⋮ Weber's problem and weiszfeld's algorithm in general spaces ⋮ Public facility location using dispersion, population, and equity criteria ⋮ Group centre and group median of a tree ⋮ Low order polynomial bounds on the expected performance of local improvement algorithms ⋮ Some personal views on the current state and the future of locational analysis ⋮ Discrete Center Problems ⋮ Complexity results for the \(p\)-median problem with mutual communication ⋮ Minimean Location of Different Facilities on a Line Network ⋮ The least element property of center location on tree networks with applications to distance and precedence constrained problems ⋮ Algorithmic results for ordered median problems ⋮ Center problems with pos/neg weights on trees