Formulations for an inventory routing problem
From MaRDI portal
Recommendations
- An improved formulation for the inventory routing problem with time-varying demands
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
- Inventory routing
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
Cites work
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- A hybrid heuristic for an inventory routing problem
- Alternative Inventory and Distribution Policies of a Food Manufacturer
- Decomposition of a combined inventory and time constrained ship routing problem
- Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Forty years of periodic vehicle routing
- Industrial aspects and literature survey: Combined inventory management and routing
- Integer Programming Formulation of Traveling Salesman Problems
- Inventory routing
- On the capacitated vehicle routing problem
- Production Planning by Mixed Integer Programming
- Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
- The exact solution of several classes of inventory-routing problems
Cited in
(45)- The flexible periodic vehicle routing problem
- The shared customer collaboration vehicle routing problem
- The dynamic-demand joint replenishment problem with approximated transportation costs
- The multi-sourcing location inventory problem with stochastic demand
- Inventory routing with pickups and deliveries
- The inventory-routing problem with transshipment
- Exact solution methods for the multi-period vehicle routing problem with due dates
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- A genetic algorithm for solving the inventory routing problem with time windows
- Inventory routing in a warehouse: the storage replenishment routing problem
- Comparison of formulations for the inventory routing problem
- The inventory routing problem with demand moves
- Improved models for a single vehicle continuous-time inventory routing problem with pickups and deliveries
- Coalition-formation problem for cooperative inventory routing game
- An inventory-routing problem with the objective of travel time minimization
- Modeling inventory routing problems in supply chains of high consumption products
- An exact solution approach for the inventory routing problem with time windows
- An improved formulation for the inventory routing problem with time-varying demands
- The inventory routing problem: the value of integration
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- Inventory routing with explicit energy consumption: a mass-flow formulation and first experimentation
- Decomposing inventory routing problems with approximate value functions
- Multi-period vehicle routing problem with due dates
- Inventory routing
- A matheuristic for the multivehicle inventory routing problem
- Iterated local search and simulated annealing algorithms for the inventory routing problem
- Single-item reformulations for a vendor managed inventory routing problem: computational experience with benchmark instances
- Coalition-formation problem for cooperative inventory routing game
- GRASP-based heuristic algorithm for the multi-product multi-vehicle inventory routing problem
- Combinatorial heuristics for inventory routing problems
- Dynamic Adaptive Large Neighborhood Search for Inventory Routing Problem
- Systematic reviews as a metaknowledge tool: caveats and a review of available options
- Complexity of inventory routing problems when routing is easy
- On the zero-inventory-ordering policy in the inventory routing problem
- A kernel search heuristic for the multivehicle inventory routing problem
- The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem
- The inventory routing problem with split deliveries
- Collection-disassembly-delivery problem of disassembly centers in a reverse logistics network
- A split-embedded metaheuristic for the heterogeneous inventory routing problem with batch size
- Matheuristic algorithms for the inventory routing problem with unsplit and split deliveries
- An iterated local search matheuristic approach for the multi-vehicle inventory routing problem
- Beyond fifty years of vehicle routing: insights into the history and the future
- Large neighborhood and hybrid genetic search for inventory routing problems
- Inventory-routing problems: review, challenges, and innovations
- Branch-price-and-cut for the production routing problem with time windows
This page was built for publication: Formulations for an inventory routing problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4979996)
