Pages that link to "Item:Q2490164"
From MaRDI portal
The following pages link to A 3-flip neighborhood local search for the set covering problem (Q2490164):
Displaying 17 items.
- An efficient local search heuristic with row weighting for the unicost set covering problem (Q319859) (← links)
- The robust set covering problem with interval data (Q367647) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- A GRASP algorithm to solve the unicost set covering problem (Q878597) (← 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)
- Relaxation heuristics for the set multicover problem with generalized upper bound constraints (Q1652583) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- Solving the wire-harness design problem at a European car manufacturer (Q1991185) (← 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)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- RAMP for the capacitated minimum spanning tree problem (Q2430627) (← links)
- The set covering problem revisited: an empirical study of the value of dual information (Q2514674) (← links)
- A computational investigation of heuristic algorithms for 2-edge-connectivity augmentation (Q3057155) (← links)
- MLQCC: an improved local search algorithm for the set <i>k</i>‐covering problem (Q6088120) (← links)
