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