The following pages link to (Q3500142):
Displaying 11 items.
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- A matheuristic based on Lagrangian relaxation for the multi-activity shift scheduling problem (Q1991205) (← 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)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
- A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
- The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic (Q5357751) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
