19 citations · 56 across the 10 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2017★ 19 cited
Replicable Parallel Branch and Bound Search
Blair Archibald, Patrick Maier, Ciaran McCreesh +2
Combinatorial branch and bound searches are a common technique for solving global optimisation and decision problems. Their performance often depends on good search order heuristic…
cs.DC2014★ 1 cited
The Shape of the Search Tree for the Maximum Clique Problem, and the Implications for Parallel Branch and Bound
Ciaran McCreesh, Patrick Prosser
Finding a maximum clique in a given graph is one of the fundamental NP-hard problems. We compare two multi-core thread-parallel adaptations of a state-of-the-art branch and bound a…