19 citations · 27 across the 7 of their papers we have counts for
Showing cs.DCShow all
2 papers · 1 filter
cs.DC2022★ 2 cited
Parallel Flowshop in YewPar
Ignas Knizikevičius, Phil Trinder, Blair Archibald +1
Parallelism may reduce the time to find exact solutions for many Operations Research (OR) problems, but parallelising combinatorial search is extremely challenging. YewPar is a new…
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…