Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes

From MaRDI portal
Publication:3009747

DOI10.1007/978-3-642-20807-2_2zbMath1298.90054OpenAlexW44589754MaRDI QIDQ3009747

Tunçel, Levent, Yu Hin (Gary) Au

Publication date: 24 June 2011

Published in: Integer Programming and Combinatoral Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-20807-2_2




Related Items



Cites Work


This page was built for publication: Complexity Analyses of Bienstock–Zuckerberg and Lasserre Relaxations on the Matching and Stable Set Polytopes