Comparison of formulations for the inventory routing problem
From MaRDI portal
Publication:2160484
DOI10.1016/j.ejor.2021.12.051OpenAlexW4205206417MaRDI QIDQ2160484
Ivana Ljubić, Claudia Archetti
Publication date: 3 August 2022
Published in: European Journal of Operational Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ejor.2021.12.051
Related Items (5)
A branch-and-cut embedded matheuristic for the inventory routing problem ⋮ Formulations for the clustered traveling salesman problem with \(d\)-relaxed priority rule ⋮ The effect of different mathematical formulations on a matheuristic algorithm for the production routing problem ⋮ An exact criterion space search algorithm for a bi-objective blood collection problem ⋮ The inventory routing problem with split deliveries
Cites Work
- Unnamed Item
- Unnamed Item
- Stronger multi-commodity flow formulations of the capacitated vehicle routing problem
- A hybrid heuristic based on iterated local search for multivehicle inventory routing problem
- The exact solution of several classes of inventory-routing problems
- A result on projection for the vehicle routing problem
- Improved branch-and-cut for the inventory routing problem based on a two-commodity flow formulation
- Projection results for vehicle routing
- An algorithmic framework for the exact solution of the prize-collecting Steiner tree problem
- Orientation-based models for \(\{0,1,2\}\)-survivable network design: theory and practice
- The inventory routing problem: the value of integration
- A Hybrid Heuristic for an Inventory Routing Problem
- Formulations and Branch-and-Cut Algorithms for Multivehicle Production and Inventory Routing Problems
- A Branch-and-Cut Algorithm for the Resolution of Large-Scale Symmetric Traveling Salesman Problems
- 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
- Multistars and directed flow formulations
- Formulations for an inventory routing problem
- A Unified Decomposition Matheuristic for Assembly, Production, and Inventory Routing
This page was built for publication: Comparison of formulations for the inventory routing problem