A characterization of the weighted Lovász number based on convex quadratic programming
From MaRDI portal
Publication:5963688
DOI10.1007/S11590-015-0911-6zbMATH Open1360.90225OpenAlexW806449981MaRDI QIDQ5963688FDOQ5963688
Publication date: 23 February 2016
Published in: Optimization Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s11590-015-0911-6
quadratic programmingcombinatorial optimizationgraph theorymaximum weight stable setweighted Lovász number
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Solving semidefinite-quadratic-linear programs using SDPT3
- Geometric algorithms and combinatorial optimization
- On the Shannon capacity of a graph
- The ellipsoid method and its consequences in combinatorial optimization
- Approximation of the stability number of a graph via copositive programming
- Cones of Matrices and Set-Functions and 0–1 Optimization
- Maxima for Graphs and a New Proof of a Theorem of Turán
- A review on algorithms for maximum clique problems
- A simplex like approach based on star sets for recognizing convex-\(QP\) adverse graphs
- An upper bound on the independence number of a graph computable in polynomial-time
- A Convex Quadratic Characterization of the Lovász Theta Number
- Finding independent sets in a graph using continuous multivariable polynomial formulations.
- Relaxations of vertex packing
- A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
- A quadratic programming approach to the determination of an upper bound on the weighted stability number
Cited In (3)
Uses Software
This page was built for publication: A characterization of the weighted Lovász number based on convex quadratic programming
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963688)
