A polyhedral study of the maximum stable set problem with weights on vertex-subsets

DOI10.1016/j.dam.2015.05.032zbMath1339.05167OpenAlexW626430230MaRDI QIDQ299097

Ricardo C. Corrêa, Diego Delle Donne, Marcelo Mydlarz, Javier Marenco, Victor A. Campos, Manoel B. Campêlo

Publication date: 22 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2015.05.032

zbMATH Keywords

integer programmingmaximum stable set

Mathematics Subject Classification ID

Integer programming (90C10) Signed and weighted graphs (05C22)

Cites Work

• Unnamed Item
• An exact approach for the vertex coloring problem
• Set covering and packing formulations of graph coloring: Algorithms and first polyhedral results
• A fast algorithm for the maximum clique problem
• Maximum-weight stable sets and safe lower bounds for graph coloring
• On the asymmetric representatives formulation for the vertex coloring problem
• A Column Generation Approach for Graph Coloring
• A branch-and-cut algorithm for the maximum cardinality stable set problem

This page was built for publication: A polyhedral study of the maximum stable set problem with weights on vertex-subsets