Pages that link to "Item:Q796457"

The following pages link to Using a facility location algorithm to solve large set covering problems (Q796457):

Displaying 9 items.

• Surrogate constraint normalization for the set covering problem (Q976352) (← links)
• Solving large set covering problems on a personal computer (Q1097839) (← 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)
• A dual simplex algorithm for the canonical representation of the uncapacitated facility location problem (Q2314413) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• A 3-flip neighborhood local search for the set covering problem (Q2490164) (← links)
• MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
• A binary monkey search algorithm variation for solving the set covering problem (Q6151196) (← links)