A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
From MaRDI portal
Publication:2883604
DOI10.1016/J.ENDM.2010.05.064zbMATH Open1237.90241OpenAlexW1985136662MaRDI QIDQ2883604FDOQ2883604
Manoel Campêlo, Ricardo C. Corrêa
Publication date: 13 May 2012
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2010.05.064
Recommendations
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A branch and cut solver for the maximum stable set problem
- An exact algorithm for the maximum stable set problem
- A tutorial on branch and cut algorithms for the maximum stable set problem
- On the separation of topology-free rank inequalities for the max stable set problem
Programming involving graphs or networks (90C35) Combinatorial optimization (90C27) Integer programming (90C10)
Cites Work
- Conflict graphs in solving integer programming problems
- A branch-and-cut algorithm for graph coloring
- On the asymmetric representatives formulation for the vertex coloring problem
- A branch-and-cut algorithm for the maximum cardinality stable set problem
- A class representative model for pure parsimony haplotyping
- Cliques, holes and the vertex coloring polytope
- Polyhedral results for the bipartite induced subgraph problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- A branch-and-cut algorithm for equitable coloring based on a formulation by representatives
Cited In (4)
This page was built for publication: A combined parallel Lagrangian decomposition and cutting-plane generation for maximum stable set problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2883604)
