The following pages link to (Q3831014):
Displaying 9 items.
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- Solution techniques for the large set covering problem (Q868387) (← links)
- Computational experience with approximation algorithms for the set covering problem (Q1278941) (← links)
- A novel decomposition approach to set covering problems by exploiting special structures (Q2113818) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- (Q3105962) (← links)
- (Q3585507) (← links)
- (Q4595724) (← links)
- Benchmark data set with service programs to approximately solve the set covering problem (Q5756398) (← links)