6 citations · 9 across the 3 of their papers we have counts for
Showing math.OCShow all
2 papers · 1 filter
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…