activity
20192023
most citedDeterministic and Work-Efficient Parallel Batch-Dynamic Trees in Low Span

1 citations · 1 across the 2 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2019

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…