The following pages link to (Q4411385):
Displayed 10 items.
- Local search with edge weighting and configuration checking heuristics for minimum vertex cover (Q646517) (← links)
- An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments (Q868636) (← links)
- Simple ingredients leading to very efficient heuristics for the maximum clique problem (Q1009196) (← links)
- Incomplete inference for graph problems (Q1947627) (← links)
- A logical approach to efficient Max-SAT solving (Q2389619) (← links)
- Improvements to MCS algorithm for the maximum clique problem (Q2444144) (← links)
- Exploiting semidefinite relaxations in constraint programming (Q2489123) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- A New Approach to the Stable Set Problem Based on Ellipsoids (Q3009765) (← links)
- A Max-SAT Inference-Based Pre-processing for Max-Clique (Q3502702) (← links)