default search action
Christopher Thomas Ryan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j19]Christopher Thomas Ryan, Robert L. Smith, Marina A. Epelman:
Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms. SIAM J. Optim. 34(3): 3112-3135 (2024) - [i2]Jiangze Han, Christopher Thomas Ryan, Xin T. Tong:
Wasserstein gradient flow for optimal probability measure decomposition. CoRR abs/2406.00914 (2024) - 2023
- [j18]Yifu Li
, Christopher Thomas Ryan
Optimal Sequencing in Single-Player Games. Manag. Sci. 69(10): 6057-6075 (2023) - [c5]Oussama Hanguir, Will Ma, Christopher Thomas Ryan:
Designing Optimization Problems with Diverse Solutions. IPCO 2023: 172-186 - 2022
- [j17]Yifan Feng
Robust Learning of Consumer Preferences. Oper. Res. 70(2): 918-962 (2022) - [j16]Lifei Sheng, Christopher Thomas Ryan
Incentivized Actions in Freemium Games. Manuf. Serv. Oper. Manag. 24(1): 275-284 (2022) - [j15]Christopher Thomas Ryan, Robert L. Smith:
A greedy algorithm for finding maximum spanning trees in infinite graphs. Oper. Res. Lett. 50(6): 655-659 (2022) - 2021
- [j14]Xi Chen
The Discrete Moment Problem with Nonconvex Shape Constraints. Oper. Res. 69(1): 279-296 (2021) - [j13]Tinglong Dai
Incentive Design for Operations-Marketing Multitasking. Manag. Sci. 67(4): 2211-2230 (2021) - [j12]Amitabh Basu
Mixed-integer bilevel representability. Math. Program. 185(1-2): 163-197 (2021) - [j11]Christopher Thomas Ryan
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs. Math. Program. 187(1): 253-285 (2021) - [j10]Archis Ghate, Christopher Thomas Ryan, Robert L. Smith:
A Simplex Method for Countably Infinite Linear Programs. SIAM J. Optim. 31(4): 3157-3183 (2021)
2010 – 2019
- 2019
- [j9]Amitabh Basu
Mixed-Integer Linear Representability, Disjunctions, and Chvátal Functions - Modeling Implications. Math. Oper. Res. 44(4): 1264-1285 (2019) - 2018
- [j8]Yichuan Ding
A Nonasymptotic Approach to Analyzing Kidney Exchange Graphs. Oper. Res. 66(4): 918-935 (2018) - [j7]Rongzhu Ke
Monotonicity of Optimal Contracts Without the First-Order Approach. Oper. Res. 66(4): 1101-1118 (2018) - [j6]Christopher Thomas Ryan, Robert L. Smith, Marina A. Epelman
A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems. SIAM J. Optim. 28(3): 2022-2048 (2018) - 2017
- [j5]Amitabh Basu
Strong duality and sensitivity analysis in semi-infinite linear programming. Math. Program. 161(1-2): 451-485 (2017) - [c4]Amitabh Basu
Mixed-Integer Linear Representability, Disjunctions, and Variable Elimination. IPCO 2017: 75-85 - 2016
- [j4]R. Kipp Martin, Christopher Thomas Ryan, Matt Stern:
The Slater Conundrum: Duality and Pricing in Infinite-Dimensional Optimization. SIAM J. Optim. 26(1): 111-138 (2016) - 2015
- [j3]Amitabh Basu
Projection: A Unified Approach to Semi-Infinite Linear Programs and Duality in Convex Programming. Math. Oper. Res. 40(1): 146-170 (2015) - [c3]Yichuan Ding, Dongdong Ge, Simai He
A Non-asymptotic Approach to Analyzing Kidney Exchange Graphs. EC 2015: 257-258 - 2014
- [j2]Amitabh Basu
On the sufficiency of finite support duals in semi-infinite linear programming. Oper. Res. Lett. 42(1): 16-20 (2014) - 2011
- [j1]Matthias Köppe
Rational Generating Functions and Integer Programming Games. Oper. Res. 59(6): 1445-1460 (2011) - 2010
- [c2]Christopher Thomas Ryan, Albert Xin Jiang, Kevin Leyton-Brown
Symmetric games with piecewise linear utilities. BQGT 2010: 41:1 - [c1]Christopher Thomas Ryan, Albert Xin Jiang, Kevin Leyton-Brown
Computing pure strategy nash equilibria in compact symmetric games. EC 2010: 63-72
2000 – 2009
- 2008
- [i1]Matthias Köppe, Christopher Thomas Ryan, Maurice Queyranne:
Rational Generating Functions and Integer Programming Games. CoRR abs/0809.0689 (2008)
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-10-07 21:24 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: