Pages that link to "Item:Q4109496"
From MaRDI portal
The following pages link to Convex Location Problems on Tree Networks (Q4109496):
Displayed 25 items.
- Double bound method for solving the \(p\)-center location problem (Q336682) (← links)
- A maximum trip covering location problem with an alternative mode of transportation on tree networks and segments (Q458952) (← links)
- On the number of iterations of local improvement algorithms (Q594546) (← links)
- Peakless functions on graphs (Q678883) (← links)
- Locating facilities which interact: Some solvable cases (Q689235) (← links)
- Networklike metric spaces (Q1096175) (← links)
- On locating new facilities in a competitive environment (Q1171986) (← links)
- Locational analysis (Q1173002) (← links)
- An O\((nm)\) algorithm for a special case of the multimedian location problem on a tree (Q1205700) (← links)
- Some personal views on the current state and the future of locational analysis (Q1291654) (← links)
- Complexity results for the \(p\)-median problem with mutual communication (Q1317006) (← links)
- The least element property of center location on tree networks with applications to distance and precedence constrained problems (Q1319019) (← links)
- L-extendable functions and a proximity scaling algorithm for minimum cost multiflow problem (Q1751126) (← links)
- Group centre and group median of a tree (Q1804070) (← links)
- Algorithmic results for ordered median problems (Q1866979) (← links)
- Center problems with pos/neg weights on trees (Q1869485) (← links)
- A multifacility location problem on median spaces (Q1917237) (← links)
- Facility location on a tree with maximum distance constraints (Q1919972) (← links)
- Public facility location using dispersion, population, and equity criteria (Q2514787) (← links)
- To stop or not to stop: a time-constrained trip covering location problem on a tree network (Q2675712) (← links)
- Weber's problem and weiszfeld's algorithm in general spaces (Q3871838) (← links)
- Minimean Location of Different Facilities on a Line Network (Q3951884) (← links)
- Low order polynomial bounds on the expected performance of local improvement algorithms (Q4721084) (← links)
- Discrete Center Problems (Q5506720) (← links)
- Efficient algorithms for finding <scp>2‐medians</scp> of a tree (Q6087120) (← links)