Pages that link to "Item:Q1603319"
From MaRDI portal
The following pages link to A parallel genetic algorithm to solve the set-covering problem (Q1603319):
Displaying 9 items.
- Solving a bicriteria problem of optimal service centers location (Q367241) (← links)
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← 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)
- An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
- A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
- A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
- A new genetic algorithm encoding for coalition structure generation problems (Q6534466) (← links)
