Pages that link to "Item:Q878597"
From MaRDI portal
The following pages link to A GRASP algorithm to solve the unicost set covering problem (Q878597):
Displaying 5 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
