45 citations · 75 across the 9 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
math.OC2019★ 5 cited
Further Results on an Abstract Model for Branching and its Application to Mixed-Integer Programming
Daniel Anderson, Pierre Le Bodic, Kerri Morgan
A key ingredient in branch and bound (B&B) solvers for mixed-integer programming (MIP) is the selection of branching variables since poor or arbitrary selection can affect the size…
cs.DS2019★ 45 cited
Parallel Batch-Dynamic Graph Connectivity
Umut A. Acar, Daniel Anderson, Guy E. Blelloch +1
In this paper, we study batch parallel algorithms for the dynamic connectivity problem, a fundamental problem that has received considerable attention in the sequential setting. Th…