Pages that link to "Item:Q1847251"
From MaRDI portal
The following pages link to Exploiting structure in adaptive dynamic programming algorithms for a stochastic batch service problem (Q1847251):
Displaying 13 items.
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Heuristic procedures for a stochastic batch service problem (Q742503) (← links)
- Approximate dynamic programming for link scheduling in wireless mesh networks (Q925829) (← links)
- Shape constraints in economics and operations research (Q1730901) (← links)
- Shipment consolidation with two demand classes: rationing the dispatch capacity (Q1754740) (← links)
- Optimal production and inventory rationing policies with selective-information sharing and two demand classes (Q2028874) (← links)
- A load-balancing problem for distributed bulk-service queues with size-dependent batch processing times (Q2146420) (← links)
- Meso-parametric value function approximation for dynamic customer acceptances in delivery routing (Q2183325) (← links)
- The single-node dynamic service scheduling and dispatching problem (Q2572807) (← links)
- Monotonicity in multidimensional Markov decision processes for the batch dispatch problem (Q2643807) (← links)
- An Approximate Dynamic Programming Algorithm for Monotone Value Functions (Q2797467) (← links)
- Scheduling services in a queuing system with impatience and setup costs (Q4932645) (← links)
- Analysis of batched service time data using Gaussian and semi-parametric kernel models (Q5036997) (← links)
