Pages that link to "Item:Q1328650"
From MaRDI portal
The following pages link to A multi-KP modeling for the maximum-clique problem (Q1328650):
Displaying 9 items.
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- A new combinatorial branch-and-bound algorithm for the knapsack problem with conflicts (Q2029024) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- Numerical experiments with LP formulations of the maximum clique problem (Q2103941) (← 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)
- The stable set problem: clique and nodal inequalities revisited (Q2664356) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- Maximum weight perfect matching problem with additional disjunctive conflict constraints (Q6179693) (← links)