Pages that link to "Item:Q319859"
From MaRDI portal
The following pages link to An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859):
Displaying 13 items.
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- A set-cover-based approach for the test-cost-sensitive attribute reduction problem (Q1741935) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
- A novel local search algorithm with configuration checking and scoring mechanism for the set <i>k</i>‐covering problem (Q4601636) (← links)
- A Fast Vertex Weighting-Based Local Search for Finding Minimum Connected Dominating Sets (Q5085993) (← links)
- Approximating the Unweighted ${k}$-Set Cover Problem: Greedy Meets Local Search (Q5189513) (← links)
- Proof of covering minimality by generalizing the notion of independence (Q5373999) (← links)
- A vertex weighting-based double-tabu search algorithm for the classical \(p\)-center problem (Q6068702) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
