Library Header Image
LSE Research Online LSE Library Services

Improved approximation algorithms for inventory problems

Bosman, Thomas and Olver, Neil ORCID: 0000-0001-8897-5459 (2020) Improved approximation algorithms for inventory problems. In: Bienstock, Daniel and Zambelli, Giacomo, (eds.) Integer Programming and Combinatorial Optimization - 21st International Conference, IPCO 2020, Proceedings. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Berlin / Heidelberg, GBR, 91 - 103. ISBN 9783030457709

[img] Text (Improved approximation algorithms for inventory problems) - Accepted Version
Download (315kB)

Identification Number: 10.1007/978-3-030-45771-6_8


We give new approximation algorithms for the submodular joint replenishment problem and the inventory routing problem, using an iterative rounding approach. In both problems, we are given a set of N items and a discrete time horizon of T days in which given demands for the items must be satisfied. Ordering a set of items incurs a cost according to a set function, with properties depending on the problem under consideration. Demand for an item at time t can be satisfied by an order on any day prior to t, but a holding cost is charged for storing the items during the intermediate period; the goal is to minimize the sum of the ordering and holding cost. Our approximation factor for both problems is [Formula Presented]; this improves exponentially on the previous best results.

Item Type: Book Section
Official URL:
Additional Information: © 2020 Springer Nature Switzerland AG
Divisions: Mathematics
Subjects: Q Science > QA Mathematics > QA75 Electronic computers. Computer science
Date Deposited: 26 May 2020 14:30
Last Modified: 16 May 2024 05:53

Actions (login required)

View Item View Item


Downloads per month over past year

View more statistics