The following pages link to (Q5687250):
Displaying 7 items.
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- The combinatorics of pivoting for the maximum weight clique. (Q703275) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Reactive and dynamic local search for max-clique: engineering effective building blocks (Q1038292) (← links)
- Phased local search for the maximum clique problem (Q2369988) (← links)
- A new trust region technique for the maximum weight clique problem (Q2433799) (← links)
- A study of ACO capabilities for solving the maximum clique problem (Q2491340) (← links)
