Zobrazeno 1 - 10
of 242
pro vyhledávání: '"Gupte, Akshay"'
Publikováno v:
Proceedings of the 8th International Symposium on Combinatorial Optimization, ISCO 2024. LNCS volume
Computing the edge expansion of a graph is a famously hard combinatorial problem for which there have been many approximation studies. We present two versions of an exact algorithm using semidefinite programming (SDP) to compute this constant for any
Externí odkaz:
http://arxiv.org/abs/2403.04657
Autor:
Fischer, Miriam, Gupte, Akshay
Publikováno v:
21st International Symposium on Experimental Algorithms, SEA 2023. Leibniz International Proceedings in Informatics (LIPIcs), volume 265, 12:1 - 12:14, 2023
We present multilinear and mixed-integer multilinear programs to find a Nash equilibrium in multi-player noncooperative games. We compare the formulations to common algorithms in Gambit, and conclude that a multilinear feasibility program finds a Nas
Externí odkaz:
http://arxiv.org/abs/2208.03406
Autor:
Gupte, Akshay, Zhu, Yiran
Computing the maximum size of an independent set in a graph is a famously hard combinatorial problem that has been well-studied for various classes of graphs. When it comes to random graphs, only the classical Erd\H{o}s-R\'enyi-Gilbert random graph $
Externí odkaz:
http://arxiv.org/abs/2207.04514
Autor:
Gupte, Akshay
Solution methodologies for mixed integer bilinear problems (MIBLP) are studied in this dissertation. This problem class is motivated using the pooling problem, a multicommodity network flow problem that typically arises in chemical engineering applic
Externí odkaz:
http://hdl.handle.net/1853/45761
Autor:
Pardeshi, Geeta, Mave, Vidya, Gaikwad, Sanjay, Kadam, Dileep, Barthwal, Madhusudan, Gupte, Nikhil, Atre, Sachin, Deshmukh, Sona, Golub, Jonathan E., Gupte, Akshay
Publikováno v:
In Chest February 2024 165(2):278-287
Autor:
Rocha, Eduardo Fukutani, Vinhaes, Caian Leal, Araújo-Pereira, Mariana, Mota, Tiago Feitosa, Gupte, Akshay N., Kumar, Nathella Pavan, Arriaga, Maria Belen, Sterling, Timothy R., Babu, Subash, Gaikwad, Sanjay, Karyakarte, Rajesh, Mave, Vidya, Kulkarni, Vandana, Paradkar, Mandar, Viswanathan, Vijay, Kornfeld, Hardy, Gupta, Amita, Andrade, Bruno Bezerril, Queiroz, Artur Trancoso Lopo de
Publikováno v:
In iScience 19 January 2024 27(1)
It is well-known that the convex and concave envelope of a multilinear polynomial over a box are polyhedral functions. Exponential-sized extended and projected formulations for these envelopes are also known. We consider the convexification question
Externí odkaz:
http://arxiv.org/abs/2012.06394
A conic program is the problem of optimizing a linear function over a closed convex cone intersected with an affine preimage of another cone. We analyse three constraint qualifications, namely a Closedness CQ, Slater CQ, and Boundedness CQ (also call
Externí odkaz:
http://arxiv.org/abs/2009.06550
Autor:
Deshmukh, Sona, Sane, Manasi, Gaikwad, Sanjay, Sahasrabudhe, Tushar, Barthwal, Madhusudan, Lokhande, Rahul, Raskar, Swapnil, Kagal, Anju, Dharmshale, Sujata, Pradhan, Neeta, Gupte, Akshay, Alfarisi, Omamah, Gupta, Amita, Dooley, Kelly E., Gupte, Nikhil, Golub, Jonathan E., Mave, Vidya
Publikováno v:
In Chest April 2023 163(4):778-789
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.