Pages that link to "Item:Q3722268"
From MaRDI portal
The following pages link to Hybrid heuristics for minimum cardinality set covering problems (Q3722268):
Displaying 8 items.
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
- Solving large set covering problems on a personal computer (Q1097839) (← links)
- Bethlehem steel combines cutting stock and set covering to enhance customer service (Q1197085) (← links)
- An adaptation of SH heuristic to the location set covering problem (Q1278140) (← links)
- A comparison of algorithm RS with algorithm OPTSOL70 (Q1383315) (← links)
- A neural network for the minimum set covering problem (Q1577203) (← links)
- Dominant, an algorithm for the \(p\)-center problem. (Q1811146) (← links)
- Two new heuristics for the location set covering problem (Q1893520) (← links)
