![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Marina A. Epelman
Person information
Refine list
![note](https://dblp1.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
- [j18]Karmel S. Shehadeh
, Amy E. M. Cohn, Marina A. Epelman:
Analysis of models for the Stochastic Outpatient Procedure Scheduling Problem. Eur. J. Oper. Res. 279(3): 721-731 (2019) - 2018
- [j17]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
- [j16]Ilbin Lee
, Marina A. Epelman
, H. Edwin Romeijn, Robert L. Smith:
Simplex Algorithm for Countable-State Discounted Markov Decision Processes. Oper. Res. 65(4): 1029-1042 (2017) - 2016
- [j15]Daniel Reich, Yuhui Shi, Marina A. Epelman
, Amy Cohn, Ellen Barnes, Kirk Arthurs, Erica Klampfl:
Scheduling Crash Tests at Ford Motor Company. Interfaces 46(5): 409-423 (2016) - [j14]Irina S. Dolinskaya, Marina A. Epelman
, Esra Sisikoglu, Robert L. Smith:
Parameter-Free Sampled Fictitious Play for Solving Deterministic Dynamic Programming Problems. J. Optim. Theory Appl. 169(2): 631-655 (2016) - 2015
- [j13]Stanko Dimitrov
, Rahul Sami, Marina A. Epelman:
Subsidized Prediction Mechanisms for Risk-Averse Agents. ACM Trans. Economics and Comput. 3(4): 24:1-24:23 (2015) - 2014
- [j12]Ilbin Lee
, Marina A. Epelman
, H. Edwin Romeijn, Robert L. Smith:
Extreme point characterization of constrained nonstationary infinite-horizon Markov decision processes with finite state space. Oper. Res. Lett. 42(3): 238-245 (2014) - 2012
- [j11]Mustafa Y. Sir, Marina A. Epelman
, Stephen M. Pollock:
Stochastic programming for off-line adaptive radiotherapy. Ann. Oper. Res. 196(1): 767-797 (2012) - 2011
- [j10]Marina A. Epelman
, Archis Ghate, Robert L. Smith:
Sampled fictitious play for approximate dynamic programming. Comput. Oper. Res. 38(12): 1705-1718 (2011) - [c4]Esra Sisikoglu, Marina A. Epelman
, Robert L. Smith:
A sampled fictitious play based learning algorithm for infinite horizon Markov decision processes. WSC 2011: 4091-4102
2000 – 2009
- 2009
- [c3]Stanko Dimitrov
, Rahul Sami, Marina A. Epelman
:
Subsidized Prediction Markets for Risk Averse Traders. WINE 2009: 491-497 - 2008
- [j9]Júlíus Atlason, Marina A. Epelman
, Shane G. Henderson:
Optimizing Call Center Staffing Using Simulation and Analytic Center Cutting-Plane Methods. Manag. Sci. 54(2): 295-309 (2008) - 2006
- [j8]Maciek Nowak, Marina A. Epelman
, Stephen M. Pollock:
Assignment of swimmers to dual meet events. Comput. Oper. Res. 33: 1951-1962 (2006) - [j7]Shih-Fen Cheng
, Marina A. Epelman
, Robert L. Smith:
CoSIGN: A Parallel Algorithm for Coordinated Traffic Signal Control. IEEE Trans. Intell. Transp. Syst. 7(4): 551-564 (2006) - 2005
- [j6]Theodore J. Lambert III, Marina A. Epelman
, Robert L. Smith:
A Fictitious Play Approach to Large-Scale Optimization. Oper. Res. 53(3): 477-489 (2005) - [j5]Marina A. Epelman
, Stephen M. Pollock, Brian Netter, Bobbi S. Low:
Anisogamy, Expenditure of Reproductive Effort, and the Optimality of Having Two Sexes. Oper. Res. 53(3): 560-567 (2005) - 2004
- [j4]Júlíus Atlason, Marina A. Epelman, Shane G. Henderson
:
Call Center Staffing with Simulation and Cutting Plane Methods. Ann. Oper. Res. 127(1-4): 333-358 (2004) - 2003
- [c2]Júlíus Atlason, Marina A. Epelman, Shane G. Henderson:
Customer relations management: service operations: using simulation to approximate subgradients of convex performance measures in service systems. WSC 2003: 1824-1832 - 2002
- [j3]Marina A. Epelman
, Robert M. Freund:
A New Condition Measure, Preconditioners, and Relations Between Different Measures of Conditioning for Conic Linear Systems. SIAM J. Optim. 12(3): 627-655 (2002) - 2000
- [j2]Marina A. Epelman
, Robert M. Freund:
Condition number complexity of an elementary algorithm for computing a reliable solution of a conic linear system. Math. Program. 88(3): 451-485 (2000)
1990 – 1999
- 1999
- [j1]Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, Marina A. Epelman:
Using Unbalanced Trees for Indexing Multidimensional Objects. Knowl. Inf. Syst. 1(3): 157-192 (1999) - 1997
- [c1]Charu C. Aggarwal, Joel L. Wolf, Philip S. Yu, Marina A. Epelman
:
The S-Tree: An Efficient Index for Multidimensional Objects. SSD 1997: 350-373
Coauthor Index
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-05-08 21:47 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint