Pages that link to "Item:Q878597"

The following pages link to A GRASP algorithm to solve the unicost set covering problem (Q878597):

Displaying 11 items.

• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
• A mixed integer linear program and tabu search approach for the complementary edge covering problem (Q964367) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• Using a greedy random adaptative search procedure to solve the cover printing problem (Q1040963) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← 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)
• Towards an efficient resolution of printing problems (Q2339840) (← links)
• Algorithms for computing minimal unsatisfiable subsets of constraints (Q2471741) (← links)
• MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)