7 citations · 10 across the 4 of their papers we have counts for
5 papers
Speeding Up Mixed-Integer Programming Solvers with Sparse Learning for Branching
Selin Bayramoğlu, George L Nemhauser, Nikolaos V Sahinidis
Machine learning is increasingly used to improve decisions within branch-and-bound algorithms for mixed-integer programming. Many existing approaches rely on deep learning, which o…
A Simulated Annealing Algorithm for the Directed Steiner Tree Problem
Matias Siebert, Shabbir Ahmed, George Nemhauser
In \cite{siebert2019linear} the authors present a set of integer programs (IPs) for the Steiner tree problem, which can be used for both, the directed and the undirected setting of…
A Linear Programming Based Approach to the Steiner Tree Problem with a Fixed Number of Terminals
Matias Siebert, Shabbir Ahmed, George Nemhauser
We present a set of integer programs (IPs) for the Steiner tree problem with the property that the best solution obtained by solving all, provides an optimal Steiner tree. Each IP…
On the computational complexity of minimum-concave-cost flow in a two-dimensional grid
Shabbir Ahmed, Qie He, Shi Li +1
We study the minimum-concave-cost flow problem on a two-dimensional grid. We characterize the computational complexity of this problem based on the number of rows and columns of th…
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…