List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Solving the home service assignment, routing, and appointment scheduling (H-SARA) problem with uncertainties j=' ' a=' ' j#=6 a#=6 | 2024-08-13 | Paper |
| Branch-and-Bound for Biobjective Mixed-Integer Linear Programming INFORMS Journal on Computing j='INFORMS Journal on Computing' a=' ' j#=28 a#=6 | 2022-06-30 | Paper |
| Polyhedral Analysis of Symmetric Multilinear Polynomials over Box Constraints j=' ' a=' ' j#=6 a#=6 | 2020-12-11 | Paper |
| Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming INFORMS Journal on Computing j='INFORMS Journal on Computing' a=' ' j#=28 a#=6 | 2020-11-09 | Paper |
| On strong duality, theorems of the alternative, and projections in conic optimization j=' ' a=' ' j#=6 a#=6 | 2020-09-14 | Paper |
| Extended formulations for convex hulls of some bilinear functions Discrete Optimization j='Discrete Optimization' a=' ' j#=21 a#=6 | 2020-07-30 | Paper |
| Error bounds for monomial convexification in polynomial optimization Mathematical Programming. Series A. Series B j='Mathematical Programming. Series A. Series B' a=' ' j#=44 a#=6 | 2019-05-17 | Paper |
| On Dantzig figures from graded lexicographic orders Discrete Mathematics j='Discrete Mathematics' a=' ' j#=20 a#=6 | 2018-04-19 | Paper |
| A mean-risk mixed integer nonlinear program for transportation network protection European Journal of Operational Research j='European Journal of Operational Research' a=' ' j#=40 a#=6 | 2017-11-23 | Paper |
| Branch-and-bound for biobjective mixed-integer linear programming j=' ' a='1709.03668' j#=6 a#=10 | 2017-09-11 | Paper |
| Relaxations and discretizations for the pooling problem Journal of Global Optimization j='Journal of Global Optimization' a=' ' j#=30 a#=6 | 2017-03-03 | Paper |
| Convex hulls of superincreasing knapsacks and lexicographic orderings Discrete Applied Mathematics j='Discrete Applied Mathematics' a=' ' j#=28 a#=6 | 2016-02-04 | Paper |
| Analysis of MILP techniques for the pooling problem Operations Research j='Operations Research' a=' ' j#=19 a#=6 | 2015-11-20 | Paper |
| Efficient storage of Pareto points in biobjective mixed integer programming j=' ' a='1411.6538' j#=6 a#=9 | 2014-11-24 | Paper |
| Solving mixed integer bilinear problems using MILP formulations SIAM Journal on Optimization j='SIAM Journal on Optimization' a=' ' j#=28 a#=6 | 2013-09-25 | Paper |
| Computing the Edge Expansion of a Graph using SDP j=' ' a='2403.04657' j#=6 a#=10 | N/A | Paper |
Research outcomes over time
This page was built for person: Akshay Gupte
