Decomposing inventory routing problems with approximate value functions
From MaRDI portal
Publication:3065633
DOI10.1002/NAV.20433zbMATH Open1202.90021OpenAlexW2005489211MaRDI QIDQ3065633FDOQ3065633
Alejandro Toriello, G. L. Nemhauser, Martin W. P. Savelsbergh
Publication date: 6 January 2011
Published in: Naval Research Logistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.20433
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
- Production Planning by Mixed Integer Programming
- Valuing American Options by Simulation: A Simple Least-Squares Approach
- Approximate Dynamic Programming
- Column Generation
- Lot sizing and scheduling -- survey and extensions
- The Stochastic Inventory Routing Problem with Direct Deliveries
- A Price-Directed Approach to Stochastic Inventory/Routing
- Inventory routing problems: a logistical overview
- Modelling path flows for a combined ship routing and inventory management problem
- Decomposition of a combined inventory and time constrained ship routing problem
- Combining exact and heuristic approaches for the capacitated fixed-charge network flow problem
- Convex piecewise-linear fitting
- An optimization algorithm for the inventory routing problem with continuous moves
- Inventory routing with continuous moves
- 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
- The value function of an integer program
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
- Intra market optimization for express package carriers with station to station travel and proportional sorting
- An algorithm for approximating piecewise linear concave functions from sample gradients
- Dynamics of Exponential Smoothing with Trend and Seasonal Terms
Cited In (12)
- 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
- 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
- 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
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)
