Pages that link to "Item:Q1192955"
From MaRDI portal
The following pages link to An O\((n \log{}n)\) algorithm for a maxmin location problem (Q1192955):
Displaying 14 items.
- Solving a maximin location problem on the plane with given accuracy (Q893922) (← links)
- Multi-dimensional dynamic facility location and fast computation at query points (Q976128) (← links)
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- Min-max optimization of several classical discrete optimization problems (Q1265052) (← links)
- A comment on a minmax location problem (Q1306472) (← links)
- A note on center problems with forbidden polyhedra (Q1362521) (← links)
- Computing an obnoxious anchored segment. (Q1413920) (← links)
- Undesirable facility location with minimal covering objectives (Q1806769) (← links)
- On the planar piecewise quadratic 1-center problem (Q2379920) (← links)
- Locating a central hunter on the plane (Q2481118) (← links)
- Locating two obnoxious facilities using the weighted maximin criterion (Q2583716) (← links)
- Some constrained minimax and maximin location problems (Q2704991) (← links)
- Relaxation method for the solution of the minimax location-allocation problem in Euclidean space (Q3793913) (← links)
- The multifacility maximin planar location problem with facility interaction (Q5427781) (← links)