Pages that link to "Item:Q2514674"
From MaRDI portal
The following pages link to The set covering problem revisited: an empirical study of the value of dual information (Q2514674):
Displaying 7 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- Improved handling of uncertainty and robustness in set covering problems (Q1695010) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- Branch-and-Bound Method for Just-in-Time Optimization of Radar Search Patterns (Q3296267) (← links)
- Application of ant colony optimization metaheuristic on set covering problems (Q5039417) (← links)
- A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)
