Publication:4580188
From MaRDI portal
DOI10.4230/LIPIcs.SEA.2017.29zbMath1433.68286MaRDI QIDQ4580188
Stefano Gualandi, Stefano Coniglio
Publication date: 13 August 2018
integer programming; combinatorial optimization; cutting planes; rank inequalities; maximum stable set problem
90C57: Polyhedral combinatorics, branch-and-bound, branch-and-cut
68R10: Graph theory (including graph drawing) in computer science
90C27: Combinatorial optimization
68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)
