Pages that link to "Item:Q1058437"
From MaRDI portal
The following pages link to On the uniqueness of optimal solutions in continuous location theory (Q1058437):
Displaying 11 items.
- How bad can the centroid be? (Q322839) (← links)
- A discretizing algorithm for location problems (Q1129969) (← links)
- Multicriteria planar location problems (Q1278273) (← links)
- Polynomial algorithms for parametric minquantile and maxcovering planar location problems with locational constraints (Q1284596) (← links)
- A convergent approximation scheme for efficient sets of the multi-criteria Weber location problem (Q1284597) (← links)
- A new assignment rule to improve seed points algorithms for the continuous \(k\)-center problem (Q1291662) (← 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)
- Local convexity results in a generalized Fermat-Weber problem (Q1806490) (← links)
- Using the power of ideal solutions: simple proofs of some old and new results in location theory (Q2240676) (← links)
- Finding all pure strategy Nash equilibria in a planar location game (Q2275630) (← links)
- Locating a central hunter on the plane (Q2481118) (← links)
