Pages that link to "Item:Q1924619"
From MaRDI portal
The following pages link to Solving hard set covering problems (Q1924619):
Displaying 12 items.
- Improved solutions to the Steiner triple covering problem (Q293185) (← links)
- Russian doll search for the Steiner triple covering problem (Q644513) (← links)
- A biased random-key genetic algorithm for the Steiner triple covering problem (Q691474) (← links)
- The relationship between the unicost set covering problem and the attribute reduction problem in rough set theory (Q779535) (← links)
- Computational experience with general cutting planes for the set covering problem (Q1002077) (← links)
- An adaptive heuristic algorithm for VLSI test vectors selection (Q1042192) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Covering models and optimization techniques for emergency response facility location and planning: a review (Q1935907) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Set covering with almost consecutive ones property (Q2386204) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
