Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem

DOI10.1287/OPRE.1070.0397MaRDI QIDQ3392126zbMATH OpenOpenAlexFDO

Authors Alessandro Avenali

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

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Recommendations

• An exact algorithm for the maximum stable set problem
• A branch-and-cut algorithm for the maximum cardinality stable set problem
• A new branch-and-bound algorithm for the maximum weighted clique problem
• A fast algorithm for the maximum weight clique problem
• A branch and cut solver for the maximum stable set problem

Cited in

(6)

• A branch and cut solver for the maximum stable set problem
• Combining decomposition approaches for the maximum weight stable set problem
• A tutorial on branch and cut algorithms for the maximum stable set problem
• Resolution search and dynamic branch-and-bound
• Indirect unstructured hex-dominant mesh generation using tetrahedra recombination
• Information-based branching schemes for binary linear mixed integer problems

This page was built for publication: Resolution Branch and Bound and an Application: The Maximum Weighted Stable Set Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3392126)