BBMCSP
From MaRDI portal
swMATH17718MaRDI QIDQ29571FDOQ29571
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/S0305054815001884
Cited In (17)
- Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming
- A branch-and-cut algorithm for the edge interdiction clique problem
- SCCWalk: an efficient local search algorithm and its improvements for maximum weight clique problem
- The maximum clique interdiction problem
- A new branch-and-bound algorithm for the maximum weighted clique problem
- A local core number based algorithm for the maximum clique problem
- gpuls-mwcp
- A Semi-exact Algorithm for Quickly Computing A Maximum Weight Clique in Large Sparse Graphs
- MaxCliqueDyn
- BBMCL
- BBMCW
- BITSCAN
- SCCWalk
- A new exact maximum clique algorithm for large and massive sparse graphs
- A new upper bound for the maximum weight clique problem
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- Why is maximum clique often easy in practice?
This page was built for software: BBMCSP
