Combinatorial heuristics for inventory routing problems
From MaRDI portal
Publication:5084657
Recommendations
- A hybrid heuristic for an inventory routing problem
- A matheuristic for the multivehicle inventory routing problem
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
- Scenario tree-based heuristics for stochastic inventory-routing problems
- A column-generation based tactical planning method for inventory routing
Cites work
- scientific article; zbMATH DE number 1749231 (Why is no real title available?)
- scientific article; zbMATH DE number 1452995 (Why is no real title available?)
- A General Approximation Technique for Constrained Forest Problems
- A Survey of Lagrangean Techniques for Discrete Optimization
- A constant approximation algorithm for the one-warehouse multiretailer problem
- A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
- A hybrid heuristic for an inventory routing problem
- A matheuristic for the multivehicle inventory routing problem
- A new model and hybrid approach for large scale inventory routing problems
- A note on the prize collecting traveling salesman problem
- APPROXIMATING THE JOINT REPLENISHMENT PROBLEM WITH DEADLINES
- An Integrated Inventory Allocation and Vehicle Routing Problem
- An adaptive large neighborhood search algorithm for a selective and periodic inventory routing problem
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Approximation algorithms for inventory problems with submodular or routing costs
- Better Approximation Bounds for the Joint Replenishment Problem
- Computational complexity of uncapacitated multi-echelon production planning problems
- Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
- Distribution Strategies that Minimize Transportation and Inventory Costs
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Formulations for an inventory routing problem
- Incorporating inventory and routing costs in strategic location models
- Primal-Dual Algorithms for Deterministic Inventory Problems
- Probabilistic analyses and practical algorithms for inventory-routing models
- The Lagrangian Relaxation Method for Solving Integer Programming Problems
- The inventory-routing problem with transshipment
- Thinning out Steiner trees: a node-based model for uniform edge costs
- Validation of subgradient optimization
Cited in
(9)- A hybrid heuristic for an inventory routing problem
- scientific article; zbMATH DE number 1031399 (Why is no real title available?)
- scientific article; zbMATH DE number 2050766 (Why is no real title available?)
- A column-generation based tactical planning method for inventory routing
- A Combined Vehicle Routing and Inventory Allocation Problem
- Fair-split distribution of multi-dose vaccines with prioritized age groups and dynamic demand: the case study of COVID-19
- Comparison of formulations for the inventory routing problem
- A matheuristic for the multivehicle inventory routing problem
- A relax-and-price heuristic for the inventory-location-routing problem
This page was built for publication: Combinatorial heuristics for inventory routing problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5084657)
