Pages that link to "Item:Q3867546"
From MaRDI portal
The following pages link to A note on some computationally difficult set covering problems (Q3867546):
Displayed 20 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)
- Surrogate constraint normalization for the set covering problem (Q976352) (← links)
- Solving multiple scenarios in a combinatorial auction (Q1017447) (← links)
- A probabilistic heuristic for a computationally difficult set covering problem (Q1122493) (← links)
- A network relaxation based enumeration algorithm for set partitioning (Q1123128) (← links)
- An interior point algorithm to solve computationally difficult set covering problems (Q1181917) (← links)
- An exact algorithm for the maximum stable set problem (Q1328431) (← links)
- The design of a 0-1 integer optimizer and its application in the Carmen system (Q1390346) (← links)
- A tabu search approach to the constraint satisfaction problem as a general problem solver (Q1609921) (← links)
- Measuring instance difficulty for combinatorial optimization problems (Q1762054) (← links)
- An algorithm for large scale 0-1 integer programming with application to airline crew scheduling (Q1897393) (← links)
- Solving hard set covering problems (Q1924619) (← links)
- Solving large Steiner Triple Covering Problems (Q2275579) (← links)
- Solving the non-unicost set covering problem by using cuckoo search and black hole optimization (Q2311311) (← links)
- A set covering approach for multi-depot train driver scheduling (Q2343986) (← links)
- Classification of orthogonal arrays by integer programming (Q2475747) (← links)
- Constraint Orbital Branching (Q3503850) (← links)
- Use of hidden network structure in the set partitioning problem (Q5101414) (← links)