scientific article; zbMATH DE number 6318818
From MaRDI portal
DOI10.1214/10-SSY020zbMath1295.90099MaRDI QIDQ5168869
Huseyin Topaloglu, Matthew S. Maxwell, Shane G. Henderson
Publication date: 21 July 2014
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Technical Note—Trading Off Quick versus Slow Actions in Optimal Search, The Minimum Expected Penalty Relocation Problem for the Computation of Compliance Tables for Ambulance Vehicles, A reinforcement learning approach to the stochastic cutting stock problem, Recent optimization models and trends in location, relocation, and dispatching of emergency medical vehicles, Improving fairness in ambulance planning by time sharing, Dispatching fire trucks under stochastic driving times, From reinforcement learning to optimal control: a unified framework for sequential decisions
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized polynomial approximations in Markovian decision processes
- Stochastic optimal control. The discrete time case
- Technical update: Least-squares temporal difference learning
- UOBYQA: unconstrained optimization by quadratic approximation
- Solving the dynamic ambulance relocation and dispatching problem using approximate dynamic programming
- Optimal dispatching strategies for emergency vehicles to increase patient survivability
- Dynamic-Programming Approximations for Stochastic Time-Staged Integer Multicommodity-Flow Problems
- Approximate Dynamic Programming for Ambulance Redeployment
- The maximal expected coverage relocation problem for emergency vehicles
- Dynamic Bid Prices in Revenue Management
- Learning Tetris Using the Noisy Cross-Entropy Method
- Ambulance location for maximum survival
- Decision support tools for ambulance dispatch and relocation
- The Linear Programming Approach to Approximate Dynamic Programming
- An adaptive dynamic programming algorithm for a stochastic multiproduct batch dispatch problem
- Approximate Dynamic Programming via a Smoothed Linear Program
- Approximate Dynamic Programming
- A Price-Directed Approach to Stochastic Inventory/Routing
- Valuing American Options by Simulation: A Simple Least-Squares Approach
- A Simplex Method for Function Minimization
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
