default search action
Akshay Gupte
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c4]Akshay Gupte
, Melanie Siebenhofer
Computing the Edge Expansion of a Graph Using Semidefinite Programming. ISCO 2024: 111-124 - 2023
- [c3]Miriam Fischer, Akshay Gupte:
Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games. SEA 2023: 12:1-12:14 - 2022
- [j10]Nathan Adelgren
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming. INFORMS J. Comput. 34(2): 909-933 (2022) - [c2]Akshay Gupte, Arie M. C. A. Koster, Sascha Kuhnke:
An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP. SEA 2022: 24:1-24:14 - [i3]Akshay Gupte, Yiran Zhu:
Large independent sets in Markov random graphs. CoRR abs/2207.04514 (2022) - [i2]Miriam Fischer, Akshay Gupte:
Multilinear formulations for computing Nash equilibrium of multi-player matrix games. CoRR abs/2208.03406 (2022) - 2021
- [c1]Syu-Ning Johnn
Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties. ATMOS 2021: 4:1-4:21 - 2020
- [j9]Akshay Gupte
Extended formulations for convex hulls of some bilinear functions. Discret. Optim. 36: 100569 (2020)
2010 – 2019
- 2019
- [j8]Warren Adams, Akshay Gupte
Error bounds for monomial convexification in polynomial optimization. Math. Program. 175(1-2): 355-393 (2019) - 2018
- [j7]Akshay Gupte
On Dantzig figures from graded lexicographic orders. Discret. Math. 341(6): 1534-1554 (2018) - [j6]Jie Lu
A mean-risk mixed integer nonlinear program for transportation network protection. Eur. J. Oper. Res. 265(1): 277-289 (2018) - [j5]Nathan Adelgren
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming. INFORMS J. Comput. 30(2): 324-338 (2018) - 2017
- [j4]Akshay Gupte
Relaxations and discretizations for the pooling problem. J. Glob. Optim. 67(3): 631-669 (2017) - 2016
- [j3]Akshay Gupte
Convex hulls of superincreasing knapsacks and lexicographic orderings. Discret. Appl. Math. 201: 150-163 (2016) - 2015
- [j2]Santanu S. Dey
Analysis of MILP Techniques for the Pooling Problem. Oper. Res. 63(2): 412-427 (2015) - 2014
- [i1]Nathan Adelgren, Pietro Belotti, Akshay Gupte:
Efficient storage of Pareto points in biobjective mixed integer programming. CoRR abs/1411.6538 (2014) - 2013
- [j1]Akshay Gupte
Solving Mixed Integer Bilinear Problems Using MILP Formulations. SIAM J. Optim. 23(2): 721-744 (2013) - 2012
- [b1]Akshay Gupte:
Mixed integer bilinear programming with applications to the pooling problem. Georgia Institute of Technology, Atlanta, GA, USA, 2012
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-19 21:02 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: