The Inventory Routing Problem (IRP) has been highlighted as a valuable strategy for
tackling routing and inventory problems. This paper addresses the IRP but considers the …

In this paper, we consider the problem of maximizing a monotone submodular function
subject to a knapsack constraint in the streaming setting. In particular, the elements arrive …

We consider the deterministic inventory routing problem over a discrete finite time horizon.
Given clients on a metric, each with daily demands that must be delivered from a depot and …

We consider the following two deterministic inventory optimization problems with non-
stationary demands. Submodular joint replenishment problem. This involves multiple item …

We study an online generalization of the classic Joint Replenishment Problem (JRP) that
models the trade-off between ordering costs, holding costs, and backlog costs in supply …

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 …

We study problems that integrate depot location decisions along with the inventory routing
problem of serving clients from these depots over time balancing the costs of routing …

Purpose The purpose of this paper is to manage the demand uncertainty considered as
lower and upper levels for a medium-scale industrial distribution planning problem in a …

Complex decision-making is ubiquitous in contemporary supply chain management. Over
the years, researchers from related fields have developed a variety of techniques to facilitate …

Abstract The Inventory Access Point (IAP) is the single-item lot-sizing problem where a
single customer faces demands in a discrete planning horizon, and the goal is to find a …