The inventory routing problem with demand moves
From MaRDI portal
Recommendations
Cites work
- A new branch-and-cut algorithm for the capacitated vehicle routing problem
- A variable MIP neighborhood descent algorithm for managing inventory and distribution of cash in automated Teller machines
- Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
- Branch-and-price-and-cut for the split-delivery vehicle routing problem with time windows
- Formulations for an inventory routing problem
- Industrial aspects and literature survey: Combined inventory management and routing
- New route relaxation and pricing strategies for the vehicle routing problem
- Optimal Routing under Capacity and Distance Restrictions
- Shortest Path Problems with Resource Constraints
- The exact solution of several classes of inventory-routing problems
- The inventory-routing problem with transshipment
Cited in
(5)- The inventory-routing problem with transshipment
- An improved formulation for the inventory routing problem with time-varying demands
- Inventory Routing Problem with Non-stationary Stochastic Demands
- Optimization of the vehicle soft-routing model: effect of the route third dimension on the transportation costs and travelled route shape
- Inventory routing with continuous moves
This page was built for publication: The inventory routing problem with demand moves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2226502)