2026-07-26T01:37:08Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:18779 2024-03-06T10:32:15Z ddc:004 open_access

Simple Policies for Capacitated Resupply Problems (Short Paper) Wagenvoort, Mette van Ee, Martijn Bouman, Paul Malone, Kerry M. resupply problems periodic schedules approximation guarantee greedy policy We consider the Capacitated Resupply Problem in which locations with a given demand rate should be resupplied by vehicles such that they do not run out of stock and the number of vehicles is minimised. Compared to related problems, we consider the scenario where the payload of the vehicles may not suffice to bring the stock level back to full capacity. We focus on the Homogeneous Capacitated Resupply Problem and present both simple policies that provide 2-approximations and an optimal greedy policy that runs in pseudo-polynomial time. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mette Wagenvoort and Martijn van Ee and Paul Bouman and Kerry M. Malone 2023 Is Part Of OASIcs, Volume 115, 23rd Symposium on Algorithmic Approaches for Transportation Modelling, Optimization, and Systems (ATMOS 2023) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/OASIcs.ATMOS.2023.18 urn:nbn:de:0030-drops-187799 https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ATMOS.2023.18 eng https://creativecommons.org/licenses/by/4.0/legalcode