Improved approximation for the capacitated inventory access point problem

DOI10.1016/j.orl.2021.09.007OpenAlexW3208953657MaRDI QIDQ2670449

Miguel Ángel Marfurt Alarcón, Lehilton L. C. Pedrosa

Publication date: 11 March 2022

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2021.09.007

zbMATH Keywords

facility locationapproximation algorithmsinventory routinginventory access point

Mathematics Subject Classification ID

Operations research, mathematical programming (90-XX)

Cites Work

• Computational complexity of uncapacitated multi-echelon production planning problems
• The simple plant location problem: Survey and synthesis
• Inventory Routing problem with facility location
• Dynamic Version of the Economic Lot Size Model
• The Truck Dispatching Problem
• Deliver or Hold: Approximation Algorithms for the Periodic Inventory Routing Problem
• The Joint Replenishment Problem with General Joint Cost Structures

This page was built for publication: Improved approximation for the capacitated inventory access point problem