Pages that link to "Item:Q937406"
From MaRDI portal
The following pages link to A sequential elimination algorithm for computing bounds on the clique number of a graph (Q937406):
Displaying 6 items.
- Valid inequalities for a single constrained 0-1 MIP set intersected with a conflict graph (Q1751163) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- A Lagrangian Bound on the Clique Number and an Exact Algorithm for the Maximum Edge Weight Clique Problem (Q3386795) (← links)