Articles with public access mandates - Christopher Thomas RyanLearn more
Not available anywhere: 1
Dual-based methods for solving infinite-horizon nonstationary deterministic dynamic programs
CT Ryan, RL Smith
Mathematical Programming 187, 253-285, 2021
Mandates: US National Science Foundation
Available somewhere: 11
A non-asymptotic approach to analyzing kidney exchange graphs
Y Ding, D Ge, S He, CT Ryan
Operations Research 66 (4), 918-935, 2018
Mandates: Natural Sciences and Engineering Research Council of Canada
Incentivized actions in freemium games
L Sheng, CT Ryan, M Nagarajan, Y Cheng, C Tong
Manufacturing and Service Operations Management 24 (1), 275-284, 2022
Mandates: Natural Sciences and Engineering Research Council of Canada, National …
The discrete moment problem with nonconvex shape constraints
X Chen, S He, B Jiang, CT Ryan, T Zhang
Operations Research 69 (Issue 1), 279-296, 2020
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Robust learning of consumer preferences
Y Feng, R Caldentey, CT Ryan
Operations Research 70 (2), 918-962, 2021
Mandates: Natural Sciences and Engineering Research Council of Canada
Mixed-integer bilevel representability
A Basu, CT Ryan, S Sankaranarayanan
Mathematical Programming 185, 163-197, 2021
Mandates: US National Science Foundation, US Department of Defense
Strong duality and sensitivity analysis in semi-infinite linear programming
A Basu, K Martin, CT Ryan
Mathematical Programming 161, 451-485, 2017
Mandates: US National Science Foundation
A simplex method for uncapacitated pure-supply infinite network flow problems
CT Ryan, RL Smith, MA Epelman
SIAM Journal on Optimization 28 (3), 2022-2048, 2018
Mandates: US National Science Foundation
Mixed-integer linear representability, disjunctions, and Chvátal functions—Modeling implications
A Basu, K Martin, CT Ryan, G Wang
Mathematics of Operations Research 44 (4), 1264-1285, 2019
Mandates: US National Science Foundation
Designing optimization problems with diverse solutions
O Hanguir, W Ma, J Han, CT Ryan
Mathematical Programming, 2023
Mandates: Natural Sciences and Engineering Research Council of Canada
A greedy algorithm for finding maximum spanning trees in infinite graphs
CT Ryan, RL Smith
Operations Research Letters 50 (6), 655-659, 2022
Mandates: Natural Sciences and Engineering Research Council of Canada
A simplex method for countably infinite linear programs
A Ghate, CT Ryan, RL Smith
SIAM Journal on Optimization 31 (4), 3157-3183, 2021
Mandates: US National Science Foundation, Natural Sciences and Engineering Research …
Publication and funding information is determined automatically by a computer program