Pages that link to "Item:Q2249809"
From MaRDI portal
The following pages link to Speeding up branch and bound algorithms for solving the maximum clique problem (Q2249809):
Displaying 9 items.
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- Dynamic node packing (Q2097666) (← links)
- Ulam stability of a functional equation deriving from quadratic and additive mappings in random normed spaces (Q2131500) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Efficient Algorithms for Finding Maximum and Maximal Cliques and Their Applications (Q2980894) (← links)
- A Much Faster Branch-and-Bound Algorithm for Finding a Maximum Clique (Q4632188) (← links)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming (Q5086003) (← links)
- CliSAT: a new exact algorithm for hard maximum clique problems (Q6167321) (← links)
