Daniel Adelman
Orcid: 0000-0001-5534-4511
According to our database1,
Daniel Adelman
authored at least 22 papers
between 1993 and 2024.
Collaborative distances:
Collaborative distances:
Timeline
1995
2000
2005
2010
2015
2020
0
1
2
3
4
2
1
1
1
1
1
1
1
1
2
3
1
1
1
1
2
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2024
Manuf. Serv. Oper. Manag., 2024
2022
INFORMS J. Comput., 2022
2020
Oper. Res., 2020
2019
2016
Optimality of Quasi-Open-Loop Policies for Discounted Semi-Markov Decision Processes.
Math. Oper. Res., 2016
2014
A Unifying Approximate Dynamic Programming Model for the Economic Lot Scheduling Problem.
Math. Oper. Res., 2014
2013
Manag. Sci., 2013
2012
INFORMS J. Comput., 2012
2009
An Approximate Dynamic Programming Approach to Network Revenue Management with Customer Choice.
Transp. Sci., 2009
2008
2007
An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces.
Math. Oper. Res., 2007
2006
Existence of Optimal Policies for Semi-Markov Decision Processes Using Duality for Infinite Linear Programming.
SIAM J. Control. Optim., 2006
2005
Math. Oper. Res., 2005
2004
2003
Price-Directed Replenishment of Subsets: Methodology and Its Application to Inventory Routing.
Manuf. Serv. Oper. Manag., 2003
1999
1993
Proceedings of the 25th Winter Simulation Conference, 1993