2 citations · 2 across the 1 of their papers we have counts for
2 papers
cs.DC2021★ 2 cited
Assessing the Effectiveness of (Parallel) Branch-and-bound Algorithms
Stephen J. Maher, Ted K. Ralphs, Yuji Shinano
Empirical studies are fundamental in assessing the effectiveness of implementations of branch-and-bound algorithms. The complexity of such implementations makes empirical study dif…
math.OC2018
Generating Hard Instances for Robust Combinatorial Optimization
Marc Goerigk, Stephen J. Maher
While research in robust optimization has attracted considerable interest over the last decades, its algorithmic development has been hindered by several factors. One of them is a…