The following pages link to BBMCL (Q23466):
Displaying 16 items.
- A new exact maximum clique algorithm for large and massive sparse graphs (Q342165) (← links)
- Social structure optimization in team formation (Q342472) (← links)
- A parallel maximum clique algorithm for large and massive sparse graphs (Q526419) (← links)
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem (Q1652309) (← links)
- On comparing algorithms for the maximum clique problem (Q1671301) (← links)
- The maximum clique interdiction problem (Q1735171) (← links)
- General cut-generating procedures for the stable set polytope (Q1752480) (← links)
- A new upper bound for the maximum weight clique problem (Q1754725) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- A branch-and-cut algorithm for the edge interdiction clique problem (Q2031072) (← links)
- A clique search problem and its application to machine scheduling (Q2068853) (← links)
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems (Q2077912) (← links)
- Estimating clique size by coloring the nodes of auxiliary graphs (Q2326165) (← links)
- A new branch-and-bound algorithm for the maximum edge-weighted clique problem (Q2424766) (← links)
- A local core number based algorithm for the maximum clique problem (Q4958092) (← links)
