6 citations · 9 across the 3 of their papers we have counts for
3 papers
math.OC2022
A Unified Tool for Solving Uni-Parametric Linear Programs, Convex Quadratic Programs, and Linear Complementarity Problems
Nathan Adelgren
We introduce a new technique for solving uni-parametric versions of linear programs, convex quadratic programs, and linear complementarity problems in which a single parameter is p…
math.OC2017★ 3 cited
Branch-and-bound for biobjective mixed-integer linear programming
Nathan Adelgren, Akshay Gupte
We present a generic branch-and-bound algorithm for finding all the Pareto solutions of a biobjective mixed-integer linear program. The main contributions are new algorithms for ob…
cs.DS2014★ 6 cited
Efficient storage of Pareto points in biobjective mixed integer programming
Nathan Adelgren, Pietro Belotti, Akshay Gupte
In biobjective mixed integer linear programs (BOMILPs), two linear objectives are minimized over a polyhedron while restricting some of the variables to be integer. Since many of t…