Pages that link to "Item:Q4361794"

The following pages link to Continuous Characterizations of the Maximum Clique Problem (Q4361794):

Displaying 12 items.

• Maximum weighted induced subgraphs (Q279221) (← links)
• Sparse solutions to random standard quadratic optimization problems (Q378104) (← links)
• A gradient-based approach for discrete optimum design (Q381494) (← links)
• On graph-Lagrangians of hypergraphs containing dense subgraphs (Q467466) (← links)
• On the largest graph-Lagrangian of 3-graphs with fixed number of edges (Q467468) (← links)
• On Lagrangians of \(r\)-uniform hypergraphs (Q498456) (← links)
• An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
• Improving an upper bound on the stability number of a graph (Q556012) (← links)
• A tutorial on branch and cut algorithms for the maximum stable set problem (Q4918254) (← links)
• (Q4968665) (← links)
• Trust Your Data or Not—StQP Remains StQP: Community Detection via Robust Standard Quadratic Optimization (Q4991677) (← links)
• A General Regularized Continuous Formulation for the Maximum Clique Problem (Q5108235) (← links)