A parallel branch and bound algorithm for the maximum labelled clique problem

DOI10.1007/s11590-014-0837-4zbMath1328.90127arXiv1407.7061OpenAlexW2069537431WikidataQ59409802 ScholiaQ59409802MaRDI QIDQ2355318

Ciaran McCreesh, Patrick Prosser

Publication date: 22 July 2015

Published in: Optimization Letters (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1407.7061

zbMATH Keywords

computational experimentscombinatorial optimisationparallel branch and boundmaximum labelled clique

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Related Items (5)

\texttt{mplrs}: a scalable parallel vertex/facet enumeration code ⋮ Parallel computational optimization in operations research: a new integrative framework, literature review and research directions ⋮ Speeding up Parallel Combinatorial Optimization Algorithms with Las Vegas Method ⋮ A parallel maximum clique algorithm for large and massive sparse graphs ⋮ Finding subgraphs with side constraints

Cites Work

• Unnamed Item
• An exact bit-parallel algorithm for the maximum clique problem
• An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments
• Exact algorithms for maximum clique: a computational study
• Multi-threading a state-of-the-art maximum clique algorithm
• An improved bit parallel exact maximum clique algorithm
• A Simple and Faster Branch-and-Bound Algorithm for Finding a Maximum Clique
• Anomalies in parallel branch-and-bound algorithms

This page was built for publication: A parallel branch and bound algorithm for the maximum labelled clique problem