The following pages link to Akshay Gupte (Q513171):
Displaying 14 items.
- Relaxations and discretizations for the pooling problem (Q513173) (← links)
- Extended formulations for convex hulls of some bilinear functions (Q783025) (← links)
- Convex hulls of superincreasing knapsacks and lexicographic orderings (Q908302) (← links)
- A mean-risk mixed integer nonlinear program for transportation network protection (Q1681354) (← links)
- On Dantzig figures from graded lexicographic orders (Q1744737) (← links)
- Error bounds for monomial convexification in polynomial optimization (Q2414910) (← links)
- Solving Mixed Integer Bilinear Problems Using MILP Formulations (Q2848171) (← links)
- Analysis of MILP Techniques for the Pooling Problem (Q3453340) (← links)
- Branch-and-Bound for Biobjective Mixed-Integer Linear Programming (Q5085998) (← links)
- Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming (Q5131728) (← links)
- Efficient storage of Pareto points in biobjective mixed integer programming (Q6256691) (← links)
- Branch-and-bound for biobjective mixed-integer linear programming (Q6291165) (← links)
- Computing the Edge Expansion of a Graph using SDP (Q6525101) (← links)
- Solving the home service assignment, routing, and appointment scheduling (H-SARA) problem with uncertainties (Q6587279) (← links)
