15 citations · 52 across the 12 of their papers we have counts for
Showing 2017Show all
3 papers · 1 filter
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…
math.OC2017★ 8 cited
Error bounds for monomial convexification in polynomial optimization
Warren Adams, Akshay Gupte, Yibo Xu
Convex hulls of monomials have been widely studied in the literature, and monomial convexifications are implemented in global optimization software for relaxing polynomials. Howeve…
math.OC2017★ 12 cited
Extended formulations for convex hulls of graphs of bilinear functions
Akshay Gupte, Thomas Kalinowski, Fabian Rigterink +1
We consider the problem of characterizing the convex hull of the graph of a bilinear function on the -dimensional unit cube . Extended formulations for this convex…