Convex quadratic programming approach

DOI10.1023/A:1011276123981zbMath0991.90100OpenAlexW1974001037MaRDI QIDQ5940044

Domingos Moreira Cardoso

Publication date: 30 July 2002

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1011276123981

zbMATH Keywords

convex programminggraph theorymaximum matchinggraph eigenvalues

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Convex programming (90C25) Quadratic programming (90C20) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Matching models (91B68)

Related Items (1)

Improving an upper bound on the stability number of a graph

This page was built for publication: Convex quadratic programming approach