Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
From MaRDI portal
Publication:3392126
DOI10.1287/opre.1070.0397zbMath1167.90619OpenAlexW2090564607MaRDI QIDQ3392126
Publication date: 13 August 2009
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.1070.0397
Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (4)
A branch and cut solver for the maximum stable set problem ⋮ A tutorial on branch and cut algorithms for the maximum stable set problem ⋮ Information-based branching schemes for binary linear mixed integer problems ⋮ Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
This page was built for publication: Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem
