activity
20152026
most citedA Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals

7 citations · 10 across the 4 of their papers we have counts for

collaborators
Showing math.OCShow all

1 paper · 1 filter

math.OC2015★ 2 cited

An Abstract Model for Branching and its Application to Mixed Integer Programming

Pierre Le Bodic, George L. Nemhauser

The selection of branching variables is a key component of branch-and-bound algorithms for solving Mixed-Integer Programming (MIP) problems since the quality of the selection proce…