Pages that link to "Item:Q2311311"

The following pages link to Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311):

Displaying 9 items.

• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
• Smart scheduling: an integrated first mile and last mile supply approach (Q1654305) (← links)
• A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• Combination of metaheuristic and exact algorithms for solving set covering-type optimization problems (Q2899091) (← links)
• A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
• Ambulance location routing problem considering all sources of uncertainty: progressive estimating algorithm (Q6068732) (← links)
• A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)