The following pages link to (Q3487139):
Displaying 3 items.
- Experiments with parallel branch-and-bound algorithms for the set covering problem (Q1316095) (← links)
- Graph theoretic relaxations of set covering and set partitioning problems (Q1390264) (← links)
- Solution of Set-Covering and Set-Partitioning Problems Using Assignment Relaxations (Q4018535) (← links)