Decomposing inventory routing problems with approximate value functions
From MaRDI portal
Recommendations
- Approximation algorithms for inventory problems with submodular or routing costs
- The inventory routing problem: the value of integration
- The exact solution of several classes of inventory-routing problems
- A partition approach to the inventory/routing problem
- An Integrated Inventory Allocation and Vehicle Routing Problem
- A decomposition-based heuristic for the multiple-product inventory-routing problem
- Formulations for an inventory routing problem
- An iterative matheuristic for the inventory routing problem
- Delivery Cost Approximations for Inventory Routing Problems in a Rolling Horizon Framework
Cites work
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
- A Price-Directed Approach to Stochastic Inventory/Routing
- A method for solving ship routing problems with inventory constraints
- An Infinite-Dimensional Linear Programming Algorithm for Deterministic Semi-Markov Decision Processes on Borel Spaces
- An algorithm for approximating piecewise linear concave functions from sample gradients
- An optimization algorithm for the inventory routing problem with continuous moves
- Approximate Dynamic Programming
- Column Generation
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Convex piecewise-linear fitting
- Decomposition of a combined inventory and time constrained ship routing problem
- Dynamics of Exponential Smoothing with Trend and Seasonal Terms
- Intra market optimization for express package carriers with station to station travel and proportional sorting
- Inventory routing problems: a logistical overview
- Inventory routing with continuous moves
- Lot sizing and scheduling -- survey and extensions
- Modelling path flows for a combined ship routing and inventory management problem
- Production Planning by Mixed Integer Programming
- The Stochastic Inventory Routing Problem with Direct Deliveries
- The value function of an integer program
- Valuing American options by simulation: a simple least-squares approach
Cited in
(15)- Dynamic lookahead policies for stochastic-dynamic inventory routing in bike sharing systems
- Dynamic programming approximation algorithms for the capacitated lot-sizing problem
- Cross-docking based factory logistics unitisation process: an approximate dynamic programming approach
- DCA-based algorithms for DC fitting
- Convex regression in multidimensions: suboptimality of least squares estimators
- Least squares approximate policy iteration for learning bid prices in choice-based revenue management
- Heuristics for dynamic and stochastic inventory-routing
- Scheduling arc maintenance jobs in a network to maximize total flow over time
- Fitting piecewise linear continuous functions
- Concave regression: value-constrained estimation and likelihood ratio-based inference
- Dynamic programming in inventory management: a review
- A blood bank network design problem with integrated facility location, inventory and routing decisions
- An inventory-routing problem with the objective of travel time minimization
- An approximated dynamic programming model for the supply vessel fleet sizing problem
- Benders decomposition for the inventory vehicle routing problem with perishable products and environmental costs
This page was built for publication: Decomposing inventory routing problems with approximate value functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3065633)
