Pages that link to "Item:Q1790196"
From MaRDI portal
The following pages link to What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196):
Displaying 6 items.
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- An experimental comparison of three heuristics for the WVCP (Q1328615) (← links)
- Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
- A theoretical justification of the set covering greedy heuristic of Caprara et al. (Q2172080) (← links)
- A generalization of the weighted set covering problem (Q4667822) (← links)
- Proof of covering minimality by generalizing the notion of independence (Q5373999) (← links)