Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
type: Item
instance of: scholarly article
title: Analysis of an improved branch-and-cut formulation for the inventory-routing problem with transshipment
zbMATH Open document ID: 1391.90017
author: Wouter Lefever
author: El-Houssaine Aghezzaf
author: Khaled Hadj-Hamou
author: Bernard Penz
published in: Computers \& Operations Research
publication date: 2018-07-12T00:00:00Z
Mathematics Subject Classification ID: 90B05
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90C57
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6902865
zbMATH Keywords: inventory-routing problem
zbMATH Keywords: transshipment
zbMATH Keywords: valid inequalities
zbMATH Keywords: reformulation
MaRDI profile type: Publication
full work available at URL: j.cor.2018.05.023
OpenAlex ID: W2807481151
cites work: Industrial aspects and literature survey: Combined inventory management and routing
cites work: Single‐item reformulations for a vendor managed inventory routing problem: Computational experience with benchmark instances
cites work: Deterministic Order-Up-To Level Policies in an Inventory Routing Problem
cites work: Stock Replenishment and Shipment Scheduling for Vendor-Managed Inventory Systems
cites work: The inventory-routing problem with transshipment
cites work: Heuristics for dynamic and stochastic inventory-routing
cites work: The exact solution of several classes of inventory-routing problems
cites work: A general heuristic for vehicle routing problems
Wikidata QID: Q129759566
DOI: 10.1016/J.COR.2018.05.023
description: scientific article; zbMATH DE number 6902865