Pages that link to "Item:Q3065633"
From MaRDI portal
The following pages link to Decomposing inventory routing problems with approximate value functions (Q3065633):
Displaying 8 items.
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem (Q288224) (← links)
- Heuristics for dynamic and stochastic inventory-routing (Q337178) (← links)
- Scheduling arc maintenance jobs in a network to maximize total flow over time (Q406493) (← links)
- Fitting piecewise linear continuous functions (Q439615) (← links)
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management (Q1652041) (← links)
- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems (Q1734854) (← links)
- Concave regression: value-constrained estimation and likelihood ratio-based inference (Q1739026) (← links)
- A blood bank network design problem with integrated facility location, inventory and routing decisions (Q2005956) (← links)
