scientific article; zbMATH DE number 7192822

MaRDI QIDQ4960830zbMATH OpenFDO

Authors Aleksandr Borisovich Belyiĭ, Aleksandr Nikolaevich Kurbatskiĭ, C. Ratti, S. L. Sobolevskiĭ

Publication date 23 April 2020

Full work available at URL https://journals.bsu.by/index.php/mathematics/article/view/1050

zbMATH Keywords

branch and bound methodclique partitioningexact solutionupper bounds

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Combinatorial optimization (90C27)

Recommendations

• New bounds and constraint propagation techniques for the clique partitioning problem
• An improved upper bound and algorithm for clique covers
• Incremental Upper Bound for the Maximum Clique Problem
• Principles and Practice of Constraint Programming – CP 2004
• Improving upper bounds for the clique number by non-valid inequalities
• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• An improved branch and bound algorithm for the maximum clique problem
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• scientific article; zbMATH DE number 1472140
• A new upper bound for the maximum weight clique problem

Cited in

(6)

• Metric space method for constructing splitting partitions of graphs
• New bounds and constraint propagation techniques for the clique partitioning problem
• A New Branch and Bound Algorithm for the Clique Partitioning Problem
• Principles and Practice of Constraint Programming – CP 2004
• Subnetwork constraints for tighter upper bounds and exact solution of the clique partitioning problem
• The clique-partitioning problem

This page was built for publication:

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