Pages that link to "Item:Q4490794"
From MaRDI portal
The following pages link to The Capacitated <i>K</i>-Center Problem (Q4490794):
Displayed 16 items.
- New approximation results for resource replication problems (Q270001) (← links)
- A simple greedy approximation algorithm for the minimum connected \(k\)-center problem (Q281773) (← links)
- Capacitated \(p\)-center problem with failure foresight (Q319964) (← links)
- When centers can fail: a close second opportunity (Q337641) (← links)
- Graph clustering (Q458448) (← links)
- The fault-tolerant capacitated \(K\)-center problem (Q484314) (← links)
- A model for minimizing active processor time (Q487001) (← links)
- Centrality of trees for capacitated \(k\)-center (Q896276) (← links)
- Lagrangean duals and exact solution to the capacitated \(p\)-center problem (Q1044136) (← links)
- \(k\)-center problems with minimum coverage (Q1770377) (← links)
- A constant-factor approximation algorithm for the \(k\)-median problem (Q1869938) (← links)
- A PTAS for the cardinality constrained covering with unit balls (Q2437774) (← links)
- A simple linear algorithm for computing rectilinear 3-centers (Q2486079) (← links)
- An exact algorithm for the capacitated vertex \(p\)-center problem (Q2496034) (← links)
- The load-distance balancing problem (Q2892142) (← links)
- Large-scale local search heuristics for the capacitated vertex<i>p</i>-center problem (Q4474299) (← links)