default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDaniel Adelman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j20]Daniel Adelman
, Kanix Wang:
Frontiers in Operations: Optimal Genetic Testing of Families. Manuf. Serv. Oper. Manag. 26(4): 1338-1357 (2024)- 2022
- [j19]Kanix Wang, Walid Hussain, John R. Birge, Michael D. Schreiber, Daniel Adelman:
A High-Fidelity Model to Predict Length of Stay in the Neonatal Intensive Care Unit. INFORMS J. Comput. 34(1): 183-195 (2022) - 2020
- [j18]Daniel Adelman:
An Efficient Frontier Approach to Scoring and Ranking Hospital Performance. Oper. Res. 68(3): 762-792 (2020) - 2019
- [j17]Daniel Adelman, Canan Uckun:
Dynamic Electricity Pricing to Smart Homes. Oper. Res. 67(6): 1520-1542 (2019) - 2016
- [j16]Daniel Adelman, Angelo J. Mancini:
Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes. Math. Oper. Res. 41(4): 1222-1247 (2016) - 2014
- [j15]Daniel Adelman, Christiane Barz:
A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem. Math. Oper. Res. 39(2): 374-402 (2014) - 2013
- [j14]Daniel Adelman, Adam J. Mersereau:
Dynamic Capacity Allocation to Customers Who Remember Past Service. Manag. Sci. 59(3): 592-612 (2013) - 2012
- [j13]Daniel Adelman, Diego Klabjan:
Computing Near-Optimal Policies in Generalized Joint Replenishment. INFORMS J. Comput. 24(1): 148-164 (2012) - 2009
- [j12]Dan Zhang, Daniel Adelman:
An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice. Transp. Sci. 43(3): 381-394 (2009) - 2008
- [j11]Daniel Adelman, Adam J. Mersereau:
Relaxations of Weakly Coupled Stochastic Dynamic Programs. Oper. Res. 56(3): 712-727 (2008) - [j10]Daniel Adelman:
A simple algebraic approximation to the Erlang loss system. Oper. Res. Lett. 36(4): 484-491 (2008) - 2007
- [j9]Daniel Adelman:
Dynamic Bid Prices in Revenue Management. Oper. Res. 55(4): 647-661 (2007) - [j8]Daniel Adelman:
Price-Directed Control of a Closed Logistics Queueing Network. Oper. Res. 55(6): 1022-1038 (2007) - [j7]Diego Klabjan, Daniel Adelman:
An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces. Math. Oper. Res. 32(3): 528-550 (2007) - 2006
- [j6]Diego Klabjan, Daniel Adelman:
Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming. SIAM J. Control. Optim. 44(6): 2104-2122 (2006) - 2005
- [j5]Daniel Adelman, Diego Klabjan:
Duality and Existence of Optimal Policies in Generalized Joint Replenishment. Math. Oper. Res. 30(1): 28-50 (2005) - 2004
- [j4]Daniel Adelman:
A Price-Directed Approach to Stochastic Inventory/Routing. Oper. Res. 52(4): 499-514 (2004) - 2003
- [j3]Daniel Adelman:
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing. Manuf. Serv. Oper. Manag. 5(4): 348-371 (2003) - 1999
- [j2]Daniel Adelman, George L. Nemhauser:
Price-Directed Control of Remnant Inventory Systems. Oper. Res. 47(6): 889-898 (1999) - [j1]Daniel Adelman, George L. Nemhauser, Mario Padron, Robert Stubbs, Ram Pandit:
Allocating Fibers in Cable Manufacturing. Manuf. Serv. Oper. Manag. 1(1): 21-35 (1999)
Conference and Workshop Papers
- 1993
- [c1]Daniel Adelman, David Goldsman, Paul F. Auclair, James J. Swain:
Multinomial selection procedures for use in simulations. WSC 1993: 378-385
Informal and Other Publications
- 2024
- [i1]Daniel Adelman, Cagla Keceli, Alba V. Olivares-Nadal:
Thompson Sampling for Infinite-Horizon Discounted Decision Processes. CoRR abs/2405.08253 (2024)
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-08-23 19:20 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:
