A quadratic programming approach to the determination of an upper bound on the weighted stability number

DOI10.1016/S0377-2217(00)00162-4zbMath1054.90052OpenAlexW1987598892MaRDI QIDQ5939588

Domingos Moreira Cardoso, Carlos J. Luz

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00162-4

zbMATH Keywords

Graph theoryQuadratic programmingWeighted stability number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Quadratic programming (90C20)

Related Items (5)

Improving an upper bound on the stability number of a graph ⋮ A characterization of the weighted version of McEliece–Rodemich–Rumsey–Schrijver number based on convex quadratic programming ⋮ A characterization of the weighted Lovász number based on convex quadratic programming ⋮ A survey on graphs with convex quadratic stability number ⋮ Dual Hoffman Bounds for the Stability and Chromatic Numbers Based on Semidefinite Programming

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A generalization of the Hoffman-Lovász upper bound on the independence number of a regular graph
• The maximum clique problem
• An upper bound on the independence number of a graph computable in polynomial-time
• Vertex packings: Structural properties and algorithms
• A branch and bound algorithm for the maximum clique problem

This page was built for publication: A quadratic programming approach to the determination of an upper bound on the weighted stability number