Pages that link to "Item:Q4950819"
From MaRDI portal
The following pages link to A Heuristic Method for the Set Covering Problem (Q4950819):
Displaying 5 items.
- A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)
- A Lagrangian relaxation approach to an electricity system investment model with a high temporal resolution (Q6201541) (← links)
- Tilted inequalities and facets of the set covering polytope: a theoretical analysis (Q6611016) (← links)
- A meta-heuristic extension of the Lagrangian heuristic framework (Q6644992) (← links)
- An optimal algorithm for variable knockout problems (Q6655140) (← links)