scientific article; zbMATH DE number 6917144
From MaRDI portal
Publication:4580188
DOI10.4230/LIPIcs.SEA.2017.29zbMath1433.68286MaRDI QIDQ4580188
Stefano Gualandi, Stefano Coniglio
Publication date: 13 August 2018
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer programmingcombinatorial optimizationcutting planesrank inequalitiesmaximum stable set problem
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph theory (including graph drawing) in computer science (68R10) Combinatorial optimization (90C27) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (4)
Optimizing over the Closure of Rank Inequalities with a Small Right-Hand Side for the Maximum Stable Set Problem via Bilevel Programming ⋮ A new branch-and-bound algorithm for the maximum edge-weighted clique problem ⋮ Strengthening Chvátal-Gomory Cuts for the Stable Set Problem ⋮ A Unified Framework for Multistage Mixed Integer Linear Optimization
This page was built for publication:
