Pages that link to "Item:Q853015"

The following pages link to An effective and simple heuristic for the set covering problem (Q853015):

Displaying 26 items.

• A-priori upper bounds for the set covering problem (Q271942) (← links)
• An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
• A Pareto-metaheuristic for a bi-objective winner determination problem in a combinatorial reverse auction (Q336792) (← links)
• Tactical fixed job scheduling with spread-time constraints (Q337014) (← links)
• A generalized constructive algorithm using insertion-based heuristics (Q342160) (← links)
• Application placement and backup service in computer clustering in software as a service (SaaS) networks (Q342315) (← links)
• The robust set covering problem with interval data (Q367647) (← links)
• A hybrid heuristic for the set covering problem (Q373244) (← links)
• Divide-and-price: a decomposition algorithm for solving large railway crew scheduling problems (Q439646) (← links)
• The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
• A variable neighborhood search algorithm for the multimode set covering problem (Q887195) (← links)
• An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
• A distance-limited continuous location-allocation problem for spatial planning of decentralized systems (Q1651515) (← links)
• Design of a heuristic algorithm for the generalized multi-objective set covering problem (Q2149956) (← links)
• A graph approach for fuzzy-rough feature selection (Q2219196) (← links)
• A new approach for solving set covering problem using jumping particle swarm optimization method (Q2311260) (← links)
• A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
• Variable and large neighborhood search to solve the multiobjective set covering problem (Q2359157) (← links)
• A note on a symmetrical set covering problem: the lottery problem (Q2462109) (← links)
• The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
• Memory and Learning in Metaheuristics (Q2866122) (← links)
• A Meta-RaPS for the early/tardy single machine scheduling problem (Q3055652) (← links)
• Application of ant colony optimization metaheuristic on set covering problems (Q5039417) (← links)
• A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
• Solving the set covering problem with conflicts on sets: a new parallel GRASP (Q6568410) (← links)
• An optimal algorithm for variable knockout problems (Q6655140) (← links)