Inventory Routing problem with facility location

DOI10.1007/978-3-030-24766-9_33MaRDI QIDQ2285110zbMATH OpenOpenAlexFDO

Authors Yang Jiao, R. Ravi

Publication date 16 January 2020

Full work available at URL https://arxiv.org/abs/1905.00148

zbMATH Keywords

approximation algorithmsfacility locationInventory Routing problem

Mathematics Subject Classification ID

Data structures (68P05) Algorithms in computer science (68Wxx)

Recommendations

• The inventory routing problem with split deliveries
• Complexity of inventory routing problems when routing is easy
• Large scale stochastic inventory routing problems with~split delivery and service level constraints
• Combinatorial heuristics for inventory routing problems
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem

Cited in

(6)

• Concave connection cost facility location and the star inventory routing problem
• Incorporating inventory and routing costs in strategic location models
• The inventory-routing problem with transshipment
• Complexity of inventory routing problems when routing is easy
• Improved approximation for the capacitated inventory access point problem
• The location routing problem with facility sizing decisions

This page was built for publication: Inventory Routing problem with facility location

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2285110)