Pages that link to "Item:Q1770377"
From MaRDI portal
The following pages link to \(k\)-center problems with minimum coverage (Q1770377):
Displaying 13 items.
- The minimal \(k\)-core problem for modeling \(k\)-assemblies (Q282678) (← links)
- The freight allocation problem with lane cost balancing constraint (Q439318) (← links)
- Solving mesh router nodes placement problem in wireless mesh networks by tabu search algorithm (Q494027) (← links)
- Node placement for wireless mesh networks: analysis of WMN-GA system simulation results for different parameters and distributions (Q494046) (← links)
- Constrained \(k\)-center and movement to independence (Q534356) (← links)
- \(k\)-balanced center location problem: a new multi-objective facility location problem (Q1722964) (← links)
- On the k-center problem with many centers (Q1824540) (← links)
- Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints (Q2072077) (← links)
- A technique for obtaining true approximations for \(k\)-center with covering constraints (Q2118113) (← links)
- Solving \(k\)-center problems involving sets based on optimization techniques (Q2301186) (← links)
- Asymmetric \(k\)-center with minimum coverage (Q2380063) (← links)
- Insertion heuristics for central cycle problems (Q3057168) (← links)
- Computing and Combinatorics (Q4681195) (← links)