The following pages link to (Q4398380):
Displayed 15 items.
- The robust set covering problem with interval data (Q367647) (← links)
- A hybrid heuristic for the set covering problem (Q373244) (← links)
- Hyperbolic set covering problems with competing ground-set elements (Q715069) (← links)
- An effective and simple heuristic for the set covering problem (Q853015) (← links)
- Composite-variable modeling for service parts logistics (Q867536) (← links)
- On a new class of nonlinear set covering problems arising in wireless network design (Q941005) (← links)
- An electromagnetism metaheuristic for the unicost set covering problem (Q976443) (← links)
- Solving a minimum-power covering problem with overlap constraint for cellular network design (Q1046080) (← links)
- A linear programming based heuristic framework for min-max regret combinatorial optimization problems with interval costs (Q1652219) (← links)
- Exploiting variable associations to configure efficient local search algorithms in large-scale binary integer programs (Q1695015) (← links)
- Solving the feedback vertex set problem on undirected graphs (Q1975362) (← links)
- Scheduling multi-colour print jobs with sequence-dependent setup times (Q2341398) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Analysis of three mathematical models of the staff rostering problem (Q2434266) (← links)
- Fix-and-optimize metaheuristics for minmax regret binary integer programming problems under interval uncertainty (Q6186579) (← links)