Extension complexity of stable set polytopes of bipartite graphs
From MaRDI portal
Publication:1687905
DOI10.1007/978-3-319-68705-6_6zbMath1483.90129arXiv1702.08741OpenAlexW2592683100MaRDI QIDQ1687905
Tony Huynh, Yuri Faenza, Marco Macchia, Manuel Aprile, Samuel Fiorini
Publication date: 4 January 2018
Full work available at URL: https://arxiv.org/abs/1702.08741
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)
Related Items
Extended formulations for matroid polytopes through randomized protocols, Binary scalar products, On the extension complexity of polytopes separating subsets of the Boolean cube, Extended formulations from communication protocols in output-efficient time, A tight approximation algorithm for the cluster vertex deletion problem, On the linear extension complexity of stable set polytopes for perfect graphs, On Vertices and Facets of Combinatorial 2-Level Polytopes, The biclique covering number of grids
