Pages that link to "Item:Q2655650"
From MaRDI portal
The following pages link to Extended and discretized formulations for the maximum clique problem (Q2655650):
Displaying 13 items.
- Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
- Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
- Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
- Worst-case analysis of clique MIPs (Q2089781) (← links)
- On integer programming models for the maximum 2-club problem and its robust generalizations in sparse graphs (Q2242194) (← links)
- An analytical comparison of the LP relaxations of integer models for the \(k\)-club problem (Q2255969) (← links)
- Solving the maximum edge-weight clique problem in sparse graphs with compact formulations (Q2260912) (← links)
- A review on algorithms for maximum clique problems (Q2630214) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- A Full Description of Polytopes Related to the Index of the Lowest Nonzero Row of an Assignment Matrix (Q2835658) (← links)
- Integer models and upper bounds for the 3‐club problem (Q5326766) (← links)
