Pages that link to "Item:Q5470766"
From MaRDI portal
The following pages link to A Convex Quadratic Characterization of the Lovász Theta Number (Q5470766):
Displayed 15 items.
- Improving an upper bound on the size of \(k\)-regular induced subgraphs (Q411262) (← links)
- An axiomatic duality framework for the theta body and related convex corners (Q517307) (← links)
- Approximating the maximum size of a \(k\)-regular induced subgraph by an upper bound on the co-\(k\)-plex number (Q690542) (← links)
- A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531) (← links)
- Cliques with maximum/minimum edge neighborhood and neighborhood density (Q1762007) (← links)
- Tightening a copositive relaxation for standard quadratic optimization problems (Q2376121) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming (Q2788727) (← links)
- Maximum cut-clique problem: ILS heuristics and a data analysis application (Q2806429) (← links)
- Ellipsoidal Relaxations of the Stable Set Problem: Theory and Algorithms (Q2949518) (← links)
- Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming (Q5013579) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- New results for recognizing convex-<i>QP</i> adverse graphs (Q5207738) (← links)
- A proximal bundle method for nonsmooth nonconvex functions with inexact information (Q5963307) (← links)
- A characterization of the weighted Lovász number based on convex quadratic programming (Q5963688) (← links)