Pages that link to "Item:Q1790196"

The following pages link to What is the best greedy-like heuristic for the weighted set covering problem? (Q1790196):

Displaying 3 items.

• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• Column generation extensions of set covering greedy heuristics (Q2102849) (← links)
• Proof of covering minimality by generalizing the notion of independence (Q5373999) (← links)