Computing the Stability Number of a Graph Via Linear and Semidefinite Programming

From MaRDI portal
Revision as of 03:39, 9 February 2024 by Import240129110113 (talk | contribs) (Created automatically from import240129110113)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Publication:5444282

DOI10.1137/05064401XzbMath1176.90611OpenAlexW2162579105WikidataQ58051170 ScholiaQ58051170MaRDI QIDQ5444282

Luis F. Zuluaga, Juan Carlos Vera, Javier F. Peña

Publication date: 25 February 2008

Published in: SIAM Journal on Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/05064401x




Related Items (54)

Cutting planes for semidefinite relaxations based on triangle-free subgraphsOn standard quadratic programs with exact and inexact doubly nonnegative relaxationsSymmetry in RLT-type relaxations for the quadratic assignment and standard quadratic optimization problemsComputing the distance between the linear matrix pencil and the completely positive coneCopositive programming motivated bounds on the stability and the chromatic numbersCopositivity cuts for improving SDP bounds on the clique numberOn the copositive representation of binary and continuous nonconvex quadratic programsOn the exactness of sum-of-squares approximations for the cone of \(5 \times 5\) copositive matricesConstraint selection in a build-up interior-point cutting-plane method for solving relaxations of the stable-set problemFinite Convergence of Sum-of-Squares Hierarchies for the Stability Number of a GraphExtended and discretized formulations for the maximum clique problemSOME EXPERIENCES WITH SOLVING SEMIDEFINITE PROGRAMMING RELAXATIONS OF BINARY QUADRATIC OPTIMIZATION MODELS IN COMPUTATIONAL BIOLOGYAn Analytic Center Cutting Plane Method to Determine Complete Positivity of a MatrixSemidefinite bounds for the stability number of a graph via sums of squares of polynomialsGenerating irreducible copositive matrices using the stable set problemApproximating the cone of copositive kernels to estimate the stability number of infinite graphsScaling relationship between the copositive cone and Parrilo's first level approximationA new certificate for copositivityA new approximation hierarchy for polynomial conic optimizationCopositivity and constrained fractional quadratic problemsA Sum of Squares Characterization of Perfect GraphsOptimization under uncertainty and risk: quadratic and copositive approachesInteriors of completely positive cones(Global) optimization: historical notes and recent developmentsConic optimization: a survey with special focus on copositive optimization and binary quadratic problemsApproximation hierarchies for copositive cone over symmetric cone and their comparisonApproximation of the Shannon capacity via matrix cone programmingSeparating doubly nonnegative and completely positive matricesCopositive optimization -- recent developments and applicationsCopositive tensor optimization problem and its applications to hypergraphsThink co(mpletely)positive! Matrix properties, examples and a clustered bibliography on copositive optimizationAn improved algorithm to test copositivityCompletely positive and completely positive semidefinite tensor relaxations for polynomial optimizationFactorization and cutting planes for completely positive matrices by copositive projectionNew approximations for the cone of copositive matrices and its dualNew and old bounds for standard quadratic optimization: dominance, equivalence and incomparabilityTesting copositivity via mixed-integer linear programmingHandelman's hierarchy for the maximum stable set problemA refined error analysis for fixed-degree polynomial optimization over the simplexAnalysis of copositive optimization based linear programming bounds on standard quadratic optimizationA new branch-and-bound algorithm for standard quadratic programming problemsLovász-Schrijver SDP-operator, near-perfect graphs and near-bipartite graphsNonconvex min-max fractional quadratic problems under quadratic constraints: copositive relaxationsA Comprehensive Analysis of Polyhedral Lift-and-Project MethodsGap, cosum and product properties of the θ′ bound on the clique numberCopositive ProgrammingA new full-Newton step \(O(n)\) infeasible interior-point algorithm for semidefinite optimizationInner approximating the completely positive cone via the cone of scaled diagonally dominant matricesOn the polyhedral lift-and-project methods and the fractional stable set polytopeAn alternative perspective on copositive and convex relaxations of nonconvex quadratic programsOn LP-based approximation for copositive formulation of stable set problemCompletely positive reformulations for polynomial optimizationExploiting symmetry in copositive programs via semidefinite hierarchiesA dynamic inequality generation scheme for polynomial programming


Uses Software






This page was built for publication: Computing the Stability Number of a Graph Via Linear and Semidefinite Programming