default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMartin L. Puterman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2021
[j21]Timothy C. Y. Chan
, Craig Fernandes, Martin L. Puterman:
Points Gained in Football: Using Markov Process-Based Value Functions to Assess Team Performance. Oper. Res. 69(3): 877-894 (2021)
2010 – 2019
- 2018
- [j20]Peter T. Vanberkel, Nelly Litvak, Martin L. Puterman, Scott Tyldesley:
Queuing network models for panel sizing in oncology. Queueing Syst. Theory Appl. 90(3-4): 291-306 (2018) - 2017
- [j19]Binyamin Oz, Moshe Haviv, Martin L. Puterman:
The advantage of relative priority regimes in multi-class multi-server queueing systems with strategic customers. Oper. Res. Lett. 45(5): 498-502 (2017) - [r2]Martin L. Puterman, Jonathan Patrick:
Dynamic Programming. Encyclopedia of Machine Learning and Data Mining 2017: 377-388 - 2015
- [j18]Steven M. Shechter, Farhad Ghassemi, Yasin Gocgun, Martin L. Puterman:
Technical Note - Trading Off Quick versus Slow Actions in Optimal Search. Oper. Res. 63(2): 353-362 (2015) - 2014
- [j17]Antoine Sauré, Martin L. Puterman:
The Appointment Scheduling Game. INFORMS Trans. Educ. 14(2): 73-85 (2014) - [c3]Binyamin Oz, Moshe Haviv, Martin L. Puterman:
Self and social optimization in multi-class multi-server queueing systems with relative priorities. NetGCooP 2014: 135-141 - 2012
- [j16]Antoine Sauré, Jonathan Patrick, Scott Tyldesley, Martin L. Puterman:
Dynamic multi-appointment patient scheduling for radiation therapy. Eur. J. Oper. Res. 223(2): 573-584 (2012) - [j15]Yue Zhang, Martin L. Puterman, Matthew Nelson, Derek R. Atkins:
A Simulation Optimization Approach to Long-Term Care Capacity Planning. Oper. Res. 60(2): 249-261 (2012) - 2010
- [r1]Martin L. Puterman, Jonathan Patrick:
Dynamic Programming. Encyclopedia of Machine Learning 2010: 298-308
2000 – 2009
- 2008
- [j14]Winfried K. Grassmann, Martin L. Puterman, Pierre L'Ecuyer, Armann Ingolfsson:
Four Canadian Contributions to Stochastic Modeling. INFOR Inf. Syst. Oper. Res. 46(1): 3-14 (2008) - [j13]Jonathan Patrick, Martin L. Puterman, Maurice Queyranne:
Dynamic Multipriority Patient Scheduling for a Diagnostic Resource. Oper. Res. 56(6): 1507-1525 (2008) - 2007
- [j12]Jonathan Patrick, Martin L. Puterman:
Improving resource utilization for diagnostic services through flexible inpatient scheduling: A method for improving resource utilization. J. Oper. Res. Soc. 58(2): 235-245 (2007) - 2005
- [j11]Xiaomei Ding, Arnab Bisi, Martin L. Puterman:
Response. Oper. Res. 53(6): 1027 (2005) - 2004
- [j10]Jason H. Goto, Mark E. Lewis, Martin L. Puterman:
Coffee, Tea, or ...?: A Markov Decision Process Model for Airline Meal Provisioning. Transp. Sci. 38(1): 107-118 (2004) - 2003
- [j9]Ernest Urbanovich, Ella E. Young, Martin L. Puterman, Sidney O. Fattedad:
Early Detection of High-Risk Claims at the Workers' Compensation Board of British Columbia. Interfaces 33(4): 15-26 (2003) - [c2]Alexandre X. Carvalho, Martin L. Puterman:
Dynamic pricing and reinforcement learning. IJCNN 2003: 2916-2921 - 2002
- [j8]Xiaomei Ding, Martin L. Puterman, Arnab Bisi:
The Censored Newsvendor and the Optimal Acquisition of Information. Oper. Res. 50(3): 517-527 (2002) - 2001
- [j7]Sanjeev Swami, Martin L. Puterman, Charles B. Weinberg:
Play It Again, Sam? Optimal Replacement Policies for a Motion Picture Exhibitor. Manuf. Serv. Oper. Manag. 3(4): 369-386 (2001) - [j6]Mark E. Lewis, Martin L. Puterman:
A probabilistic analysis of bias optimality in unichain Markov decision processes. IEEE Trans. Autom. Control. 46(1): 96-100 (2001)
1990 – 1999
- 1995
- [c1]Craig Boutilier, Martin L. Puterman:
Process-Oriented Planning and Average-Reward Optimality. IJCAI 1995: 1096-1103 - 1994
- [b1]Martin L. Puterman:
Markov Decision Processes: Discrete Stochastic Dynamic Programming. Wiley Series in Probability and Statistics, Wiley 1994, ISBN 978-0-47161977-2, pp. 1-649 - 1992
- [j5]Moshe Haviv, Martin L. Puterman:
Estimating the value of a discounted reward process. Oper. Res. Lett. 11(5): 267-272 (1992)
1980 – 1989
- 1987
- [j4]Arie Hordijk, Martin L. Puterman:
On the Convergence of Policy Iteration in Finite State Undiscounted Markov Decision Processes: The Unichain Case. Math. Oper. Res. 12(1): 163-176 (1987) - 1985
- [j3]Paul J. Schweitzer, Martin L. Puterman, Kyle W. Kindle:
Iterative Aggregation-Disaggregation Procedures for Discounted Semi-Markov Reward Processes. Oper. Res. 33(3): 589-605 (1985) - 1982
- [j2]Martin L. Puterman, Moon Chirl Shin:
Action Elimination Procedures for Modified Policy Iteration Algorithms. Oper. Res. 30(2): 301-318 (1982)
1970 – 1979
- 1979
- [j1]Martin L. Puterman, Shelby L. Brumelle:
On the Convergence of Policy Iteration in Stationary Dynamic Programming. Math. Oper. Res. 4(1): 60-69 (1979)
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 2025-02-02 22:26 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:
