Pages that link to "Item:Q1086127"
From MaRDI portal
The following pages link to Location problems with costs being sums of powers of Euclidean distances (Q1086127):
Displaying 9 items.
- Accelerating convergence in minisum location problem with \(\ell p\) norms (Q336624) (← links)
- Revisiting several problems and algorithms in continuous location with \(\ell _\tau \) norms (Q457226) (← links)
- A note on the Weber location problem (Q689238) (← links)
- Solution of minimax problems using equivalent differentiable functions (Q1068355) (← links)
- The convergence of the Weiszfeld algorithm (Q1586265) (← links)
- On the global convergence of a generalized iterative procedure for the minisum location problem with \(\ell _{p }\) distances for \(p > 2\) (Q1942259) (← links)
- Improved metaheuristic-based energy-efficient clustering protocol with optimal base station location in wireless sensor networks (Q2001158) (← links)
- Successive computation of some efficient locations of the Weber problem with barriers (Q2511354) (← links)
- Conflict-tolerant and conflict-free multi-agent meeting (Q6136090) (← links)
