A bundle approach for SDPs with exact subgraph constraints

DOI10.1007/978-3-030-17953-3_16zbMath1436.90100arXiv1902.05345OpenAlexW3102977882MaRDI QIDQ2293089

Elisabeth Gaar, Franz Rendl

Publication date: 6 February 2020

Full work available at URL: https://arxiv.org/abs/1902.05345

zbMATH Keywords

semidefinite programmingstable setcoloringmax-cutrelaxation hierarchy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Semidefinite programming (90C22)

Related Items (4)

An SDP-based approach for computing the stability number of a graph ⋮ Strong SDP based bounds on the cutwidth of a graph ⋮ A computational study of exact subgraph based SDP bounds for max-cut, stable set and coloring ⋮ Improving ADMMs for solving doubly nonnegative programs through dual factorization

This page was built for publication: A bundle approach for SDPs with exact subgraph constraints