Pages that link to "Item:Q976443"
From MaRDI portal
The following pages link to An electromagnetism metaheuristic for the unicost set covering problem (Q976443):
Displaying 8 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- CCEHC: an efficient local search algorithm for weighted partial maximum satisfiability (Q502391) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- On reserve and double covering problems for the sets with non-Euclidean metrics (Q3388412) (← links)
- The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
