swMATH11525MaRDI QIDQ23466FDOQ23466
Author name not available (Why is that?)
Official website: http://www.sciencedirect.com/science/article/pii/S0305054813003134
Cited In (23)
- A branch-and-cut algorithm for the edge interdiction clique problem
- Estimating clique size by coloring the nodes of auxiliary graphs
- A new branch-and-bound algorithm for the maximum edge-weighted 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
- General cut-generating procedures for the stable set polytope
- BHOSLIB
- MaxCliqueDyn
- BBMCSP
- biicode
- On comparing algorithms for the maximum clique problem
- BBMCW
- BITSCAN
- k-Vertex-Cut-Problem
- A new exact maximum clique algorithm for large and massive sparse graphs
- Social structure optimization in team formation
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts
- A new upper bound for the maximum weight clique problem
- A new branch-and-filter exact algorithm for binary constraint satisfaction problems
- A clique search problem and its application to machine scheduling
- On minimization of the number of branches in branch-and-bound algorithms for the maximum clique problem
- A parallel maximum clique algorithm for large and massive sparse graphs
This page was built for software: BBMCL
