The S-Tree: An Efficient Index for Multidimensional Objects. - Charu C. Aggarwal; Joel L. Wolf; Philip S. Yu; Marina A. Epelman (SSD, 1997)

Using Unbalanced Trees for Indexing Multidimensional Objects. - Charu C. Aggarwal; Joel L. Wolf; Philip S. Yu; Marina A. Epelman (Knowl. Inf. Syst., 1999)

Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. - Marina A. Epelman; Robert M. Freund (Math. Program., 2000)

A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. - Marina A. Epelman; Robert M. Freund (SIAM J. Optim., 2002)

Customer relations management: service operations: using simulation to approximate subgradients of convex performance measures in service systems. - Júlíus Atlason; Marina A. Epelman; Shane G. Henderson (WSC, 2003)

Call Center Staffing with Simulation and Cutting Plane Methods. - Júlíus Atlason; Marina A. Epelman; Shane G. Henderson (Ann. Oper. Res., 2004)

Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes. - Marina A. Epelman; Stephen M. Pollock; Brian Netter; Bobbi S. Low (Oper. Res., 2005)

A Fictitious Play Approach to Large-Scale Optimization. - Theodore J. Lambert III; Marina A. Epelman; Robert L. Smith 002 (Oper. Res., 2005)

Assignment of swimmers to dual meet events. - Maciek Nowak; Marina A. Epelman; Stephen M. Pollock (Comput. Oper. Res., 2006)

CoSIGN: A Parallel Algorithm for Coordinated Traffic Signal Control. - Shih-Fen Cheng; Marina A. Epelman; Robert L. Smith 002 (IEEE Trans. Intell. Transp. Syst., 2006)

Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods. - Júlíus Atlason; Marina A. Epelman; Shane G. Henderson (Manag. Sci., 2008)

Subsidized Prediction Markets for Risk Averse Traders. - Stanko Dimitrov; Rahul Sami; Marina A. Epelman (WINE, 2009)

A sampled fictitious play based learning algorithm for infinite horizon Markov decision processes. - Esra Sisikoglu; Marina A. Epelman; Robert L. Smith 002 (WSC, 2011)

Sampled fictitious play for approximate dynamic programming. - Marina A. Epelman; Archis Ghate; Robert L. Smith 002 (Comput. Oper. Res., 2011)

Stochastic programming for off-line adaptive radiotherapy. - Mustafa Y. Sir; Marina A. Epelman; Stephen M. Pollock (Ann. Oper. Res., 2012)

Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. - Ilbin Lee; Marina A. Epelman; H. Edwin Romeijn; Robert L. Smith 002 (Oper. Res. Lett., 2014)

Subsidized Prediction Mechanisms for Risk-Averse Agents. - Stanko Dimitrov; Rahul Sami; Marina A. Epelman (ACM Trans. Economics and Comput., 2015)

Scheduling Crash Tests at Ford Motor Company. - Daniel Reich; Yuhui Shi; Marina A. Epelman; Amy Cohn; Ellen Barnes; Kirk Arthurs; Erica Klampfl (Interfaces, 2016)

Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems. - Irina S. Dolinskaya; Marina A. Epelman; Esra Sisikoglu; Robert L. Smith 002 (J. Optim. Theory Appl., 2016)

Simplex Algorithm for Countable-State Discounted Markov Decision Processes. - Ilbin Lee; Marina A. Epelman; H. Edwin Romeijn; Robert L. Smith 002 (Oper. Res., 2017)

A Simplex Method for Uncapacitated Pure-supply Infinite Network Flow Problems. - Christopher Thomas Ryan; Robert L. Smith 002; Marina A. Epelman (SIAM J. Optim., 2018)

Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem. - Karmel S. Shehadeh; Amy E. M. Cohn; Marina A. Epelman (Eur. J. Oper. Res., 2019)

Minimum Spanning Trees in Infinite Graphs: Theory and Algorithms. - Christopher Thomas Ryan; Robert L. Smith 002; Marina A. Epelman (SIAM J. Optim., 2024)