A deep real options policy for sequential service region design and timing

DOI10.1016/j.cor.2023.106458arXiv2212.14800MaRDI QIDQ6065667

Joseph Y. J. Chow, Srushti Rath

Publication date: 15 November 2023

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2212.14800

zbMATH Keywords

Markov decision processrecurrent neural networksdemand uncertaintyapproximate dynamic programmingflexible deploymentreal options policysequential service region design

Mathematics Subject Classification ID

Operations research and management science (90Bxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The multidimensional 0-1 knapsack problem: an overview.
• From reinforcement learning to optimal control: a unified framework for sequential decisions
• Valuing portfolios of interdependent real options using influence diagrams and simulation-and-regression: a multi-stage stochastic integer programming approach
• Reference policies for non-myopic sequential network design and timing problems
• The valuation of multidimensional American real options using the LSM simulation method
• The Dynamic and Stochastic Knapsack Problem
• An Approximate Dynamic Programming Approach to Multidimensional Knapsack Problems
• Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
• Configuration of physical distribution networks
• Estimation of the Shape and Scale Parameters of the Weibull Distribution
• Path-Dependent Options: Extending the Monte Carlo Simulation Approach
• Approximate Dynamic Programming
• Learning representations by back-propagating errors