Semidefinite programming and combinatorial optimization

zbMath0904.90129MaRDI QIDQ5904070

Michel X. Goemans

Publication date: 6 August 1998

Published in: Documenta Mathematica (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/233381

zbMATH Keywords

semidefinite programmingapplicationseigenvalue bounds

Mathematics Subject Classification ID

Convex programming (90C25) Integer programming (90C10) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (8)

An \(\epsilon\)-sensitivity analysis for semidefinite programming ⋮ Stochastic nuclear outages semidefinite relaxations ⋮ Algorithms for synthesizing mechanical systems with maximal natural frequencies ⋮ Duality for optimization problems in Banach algebras ⋮ Semidefinite programming for discrete optimization and matrix completion problems ⋮ Optimality and invexity in optimization problems in Banach algebras (spaces) ⋮ Convex Algebraic Geometry of Curvature Operators ⋮ Strengthened semidefinite relaxations via a second lifting for the Max-Cut problem

This page was built for publication: Semidefinite programming and combinatorial optimization