default search action
Sriram Sankaranarayanan 0002
Person information
- affiliation: Indian Institute of Management Ahmedabad, India
- affiliation (2019 - 2020): Polytechnique Montréal, Canada Excellence Research Chair, QC, Canada
- affiliation (PhD 2018): Johns Hopkins University, Department of Civil Engineering, USA
Other persons with the same name
- Sriram Sankaranarayanan 0001
— University of Colorado Boulder, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j8]Andrea Lodi
A framework for fair decision-making over time with time-invariant utilities. Eur. J. Oper. Res. 319(2): 456-467 (2024) - [j7]Margarida Carvalho
When Nash Meets Stackelberg. Manag. Sci. 70(10): 7308-7324 (2024) - [j6]Andrea Lodi
Fairness over time in dynamic resource allocation with an application in healthcare. Math. Program. 203(1): 285-318 (2024) - [j5]Aleksandr M. Kazachkov
An abstract model for branch and cut. Math. Program. 206(1): 175-202 (2024) - [i7]Sriram Sankaranarayanan:
Best-response Algorithms for Integer Convex Quadratic Simultaneous Games. CoRR abs/2405.07119 (2024) - 2023
- [i6]Margarida Carvalho, Gabriele Dragotto, Andrea Lodi, Sriram Sankaranarayanan:
Integer Programming Games: A Gentle Computational Overview. CoRR abs/2306.02817 (2023) - 2022
- [j4]Sebastián González, Felipe Feijoo
Routing and Charging Facility Location for EVs Under Nodal Pricing of Electricity: A Bilevel Model Solved Using Special Ordered Set. IEEE Trans. Smart Grid 13(4): 3059-3068 (2022) - [c2]Aleksandr M. Kazachkov
An Abstract Model for Branch-and-Cut. IPCO 2022: 333-346 - [i5]Sanjith Gopalakrishnan, Sriram Sankaranarayanan:
Cooperative Security Against Interdependent Risks. CoRR abs/2201.04308 (2022) - 2021
- [j3]Amitabh Basu
Mixed-integer bilevel representability. Math. Program. 185(1-2): 163-197 (2021) - [i4]Margarida Carvalho, Gabriele Dragotto
The Cut and Play Algorithm: Computing Nash Equilibria via Outer Approximations. CoRR abs/2111.05726 (2021) - [i3]Gabriele Dragotto, Sriram Sankaranarayanan, Margarida Carvalho, Andrea Lodi:
ZERO: Playing Mathematical Programming Games. CoRR abs/2111.07932 (2021) - 2020
- [c1]Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel, Sriram Sankaranarayanan:
A Learning-Based Algorithm to Quickly Compute Good Primal Solutions for Stochastic Integer Programs. CPAIOR 2020: 99-111
2010 – 2019
- 2019
- [j2]Amitabh Basu
Can Cut-Generating Functions Be Good and Efficient? SIAM J. Optim. 29(2): 1190-1210 (2019) - [i2]Margarida Carvalho, Gabriele Dragotto
Nash Games Among Stackelberg Leaders. CoRR abs/1910.06452 (2019) - [i1]Yoshua Bengio, Emma Frejinger, Andrea Lodi, Rahul Patel, Sriram Sankaranarayanan:
A learning-based algorithm to quickly compute good primal solutions for Stochastic Integer Programs. CoRR abs/1912.08112 (2019) - 2018
- [j1]Sriram Sankaranarayanan
Sensitivity and covariance in stochastic complementarity problems with an application to North American natural gas markets. Eur. J. Oper. Res. 268(1): 25-36 (2018)
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-11-25 23:44 CET 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: