Pages that link to "Item:Q3760268"
From MaRDI portal
The following pages link to On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem (Q3760268):
Displaying 5 items.
- The slab dividing approach to solve the Euclidean \(P\)-center problem (Q1207325) (← links)
- An improvement and an extension of the Elzinga \& Hearn's algorithm to the 1-center problem in \(\mathbb{R}^ n\) with \(l_{2b}\)-norms (Q1367876) (← links)
- A planar minimax algorithm for analysis of coordinate measurements (Q1895919) (← links)
- Fixed gate point location problems (Q1979181) (← links)
- Continuous Center Problems (Q5506719) (← links)