Pages that link to "Item:Q373244"
From MaRDI portal
The following pages link to A hybrid heuristic for the set covering problem (Q373244):
Displaying 16 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- A hybrid of max-min ant system and linear programming for the \(k\)-covering problem (Q342539) (← links)
- Multi-strategy ensemble artificial bee colony algorithm (Q506349) (← links)
- Exploring further advantages in an alternative formulation for the set covering problem (Q783157) (← links)
- Pick-and-choose heuristics for partial set covering (Q1122585) (← links)
- Parallel and serial heuristics for the minimum set cover problem (Q1186830) (← links)
- A surrogate heuristic for set covering problems (Q1342046) (← links)
- A binary cat swarm optimization algorithm for the non-unicost set covering problem (Q1666040) (← links)
- Improved artificial bee colony algorithm for global optimization (Q1944154) (← links)
- An improved configuration checking-based algorithm for the unicost set covering problem (Q2239985) (← links)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- New heuristics for the conditional covering problem (Q2365766) (← links)
- (Q3487139) (← links)
- (Q4735035) (← links)
- A self-adaptive biogeography-based algorithm to solve the set covering problem (Q5242281) (← links)
- A scheme for determining vehicle routes based on Arc-based service network design (Q5881488) (← links)