Akshay Gupte

Orcid: 0000-0002-7839-165X

According to our database1, Akshay Gupte authored at least 16 papers between 2012 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Multilinear Formulations for Computing a Nash Equilibrium of Multi-Player Games.
Proceedings of the 21st International Symposium on Experimental Algorithms, 2023

2022
Branch-and-Bound for Biobjective Mixed-Integer Linear Programming.
INFORMS J. Comput., 2022

Multilinear formulations for computing Nash equilibrium of multi-player matrix games.
CoRR, 2022

Large independent sets in Markov random graphs.
CoRR, 2022

An Adaptive Refinement Algorithm for Discretizations of Nonconvex QCQP.
Proceedings of the 20th International Symposium on Experimental Algorithms, 2022

2021
Solving the Home Service Assignment, Routing, and Appointment Scheduling (H-SARA) Problem with Uncertainties.
Proceedings of the 21st Symposium on Algorithmic Approaches for Transportation Modelling, 2021

2020
Extended formulations for convex hulls of some bilinear functions.
Discret. Optim., 2020

2019
Error bounds for monomial convexification in polynomial optimization.
Math. Program., 2019

2018
Efficient Storage of Pareto Points in Biobjective Mixed Integer Programming.
INFORMS J. Comput., 2018

A mean-risk mixed integer nonlinear program for transportation network protection.
Eur. J. Oper. Res., 2018

On Dantzig figures from graded lexicographic orders.
Discret. Math., 2018

2017
Relaxations and discretizations for the pooling problem.
J. Glob. Optim., 2017

2016
Convex hulls of superincreasing knapsacks and lexicographic orderings.
Discret. Appl. Math., 2016

2015
Analysis of MILP Techniques for the Pooling Problem.
Oper. Res., 2015

2013
Solving Mixed Integer Bilinear Problems Using MILP Formulations.
SIAM J. Optim., 2013

2012
Mixed integer bilinear programming with applications to the pooling problem.
PhD thesis, 2012


  Loading...