Pages that link to "Item:Q844531"
From MaRDI portal
The following pages link to A heuristic for the stability number of a graph based on convex quadratic programming and tabu search (Q844531):
Displaying 5 items.
- Maximum stable set formulations and heuristics based on continuous optimization (Q1396818) (← links)
- An SDP-based approach for computing the stability number of a graph (Q2123126) (← links)
- Extended and discretized formulations for the maximum clique problem (Q2655650) (← links)
- A survey on graphs with convex quadratic stability number (Q5207733) (← links)
- A Convex Quadratic Characterization of the Lovász Theta Number (Q5470766) (← links)