The following pages link to (Q3368659):
Displaying 3 items.
- 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)
- New heuristic algorithms for the rectangular $p$-cover problem (Q4837962) (← links)