BBMCL
From MaRDI portal
Software:23466
No author found.
Related Items (16)
On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem ⋮ A new exact maximum clique algorithm for large and massive sparse graphs ⋮ Social structure optimization in team formation ⋮ On comparing algorithms for the maximum clique problem ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ The maximum clique interdiction problem ⋮ General cut-generating procedures for the stable set polytope ⋮ A new upper bound for the maximum weight clique problem ⋮ A parallel maximum clique algorithm for large and massive sparse graphs ⋮ A new branch-and-bound algorithm for the maximum weighted clique problem ⋮ A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts ⋮ A branch-and-cut algorithm for the edge interdiction clique problem ⋮ A clique search problem and its application to machine scheduling ⋮ A new branch-and-filter exact algorithm for binary constraint satisfaction problems ⋮ Estimating clique size by coloring the nodes of auxiliary graphs ⋮ A local core number based algorithm for the maximum clique problem
This page was built for software: BBMCL
