Pages that link to "Item:Q2655650"

The following pages link to Extended and discretized formulations for the maximum clique problem (Q2655650):

Displaying 19 items.

• Two-phase heuristics for the \(k\)-club problem (Q337187) (← links)
• Upper bounds and heuristics for the 2-club problem (Q541693) (← links)
• An extended formulation approach to the edge-weighted maximal clique problem (Q1278438) (← links)
• Complete formulations of polytopes related to extensions of assignment matrices (Q1662654) (← links)
• Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
• Maximum dispersion and geometric maximum weight cliques (Q1879248) (← links)
• Enhancing discretized formulations: the knapsack reformulation and the star reformulation (Q1935879) (← links)
• Worst-case analysis of clique MIPs (Q2089781) (← links)
• Continuous cubic formulations for cluster detection problems in networks (Q2097637) (← links)
• Concise integer linear programming formulation for clique partitioning problems (Q2152278) (← 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)
• A discrete and continuous study of the \textsc{Max-Chain-Formation} problem (Q2672258) (← 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)
• A Hierarchy of Standard Polynomial Programming Formulations for the Maximum Clique Problem (Q5867624) (← links)