Pages that link to "Item:Q4651480"
From MaRDI portal
The following pages link to Local Search Heuristics for <i>k</i>-Median and Facility Location Problems (Q4651480):
Displayed 20 items.
- On a facility location problem with applications to tele-diagnostic (Q360498) (← links)
- Capacitated domination problem (Q534769) (← links)
- On min-max \(r\)-gatherings (Q627109) (← links)
- Better bounds for incremental medians (Q627114) (← links)
- Local search algorithms for the red-blue median problem (Q692631) (← links)
- Complexity of local search for the \(p\)-median problem (Q932191) (← links)
- An approximation ratio for biclustering (Q975394) (← links)
- Approximation algorithms for the fault-tolerant facility placement problem (Q1944947) (← links)
- Maximum gradient embeddings and monotone clustering (Q1945290) (← links)
- Clustering with or without the approximation (Q2377383) (← links)
- A new approximation algorithm for the \(k\)-facility location problem (Q2382290) (← links)
- Incremental medians via online bidding (Q2482726) (← links)
- Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
- Locating Depots for Capacitated Vehicle Routing (Q3088097) (← links)
- A FAST IMPLEMENTATION OF THE ISODATA CLUSTERING ALGORITHM (Q3430335) (← links)
- Sublinear-time Algorithms (Q4933363) (← links)
- Capacitated Domination Problem (Q5387762) (← links)
- Prolong the Lifetime of Wireless Sensor Networks Through Mobility: A General Optimization Framework (Q5391130) (← links)
- On Min-Max r-Gatherings (Q5443378) (← links)
- Better Bounds for Incremental Medians (Q5443384) (← links)