Related papers: Outsourcing policies for the Facility Location Pro…
We study a competitive facility location problem (CFLP), where two firms sequentially open new facilities within their budgets, in order to maximize their market shares of demand that follows a probabilistic choice model. This process is a…
We study the extended version of the non-uniform, capacitated facility location problem with multiple fulfilment channels between the facilities and clients, each with their own channel capacities and service cost. Though the problem has…
We study the problem of eliciting the preferences of a decision-maker through a moderate number of pairwise comparison queries to make them a high quality recommendation for a specific problem. We are motivated by applications in high…
In this paper we propose the planar obnoxious p-median problem. In the p-median problem the objective is to find p locations for facilities that minimize the weighted sum of distances between demand points and their closest facility. In the…
We consider the following two deterministic inventory optimization problems over a finite planning horizon $T$ with non-stationary demands. (a) Submodular Joint Replenishment Problem: This involves multiple item types and a single retailer…
We consider the problem of online allocation (matching and assortments) of reusable resources where customers arrive sequentially in an adversarial fashion and allocated resources are used or rented for a stochastic duration that is drawn…
We study a fundamental model of resource allocation in which a finite number of resources must be assigned in an online manner to a heterogeneous stream of customers. The customers arrive randomly over time according to known stochastic…
We study a truthful facility location problem where one out of $k\geq2$ available facilities must be built at a location chosen from a set of candidate ones in the interval $[0,1]$. This decision aims to accommodate a set of agents with…
Various applications leverage location data to increase transparency, efficiency, and safety in intralogistics. There are several properties of location data, such as the data's degrees of freedom, system latency, update rate, or accuracy.…
This paper studies the problem of procuring diverse resources in a forward market to cover a set $\bf{E}$ of uncertain demand signals $\bf{e}$. We consider two scenarios: (a) $\bf{e}$ is revealed all at once by an oracle (b) $\bf{e}$…
Fashion discounters face the problem of ordering the right amount of pieces in each size of a product. The product is ordered in pre-packs containing a certain size-mix of a product. For this so-called lot-type design problem, a stochastic…
We study a distributed facility location problem in which a set of agents, each with a private position on the real line, is partitioned into a collection of fixed, disjoint groups. The goal is to open $k$ facilities at locations chosen…
In Facility Location problems there are agents that should be connected to facilities and locations where facilities may be opened so that agents can connect to them. We depart from Uncapacitated Facility Location and by assuming that the…
In this paper we propose an annealing based framework to incorporate inequality constraints in optimization problems such as facility location, simultaneous facility location with path optimization, and the last mile delivery problem. These…
Dynamic facility location problems aim at placing one or more valuable resources over a planning horizon to meet customer demand. Existing literature commonly assumes that customer demand quantities are defined independently for each time…
Demand dispatch is the science of extracting virtual energy storage through the automatic control of deferrable loads to provide balancing or regulation services to the grid, while maintaining consumer-end quality of service (QoS). The…
This paper proposes a reformulation of the scenario-based two-stage unit commitment problem under uncertainty that allows finding unit-commitment plans that perform reasonably well both in expectation and for the worst case realization of…
We tackle online inventory problems where at each time period the manager makes a replenishment decision based on partial historical information in order to meet demands and minimize costs. To solve such problems, we build upon recent works…
A distributed nonsmooth robust resource allocation problem with cardinality constrained uncertainty is investigated in this paper. The global objective is consisted of local objectives, which are convex but nonsmooth. Each agent is…
In this paper, we present long-awaited algorithmic advances toward the efficient construction of near-optimal replenishment policies for a true inventory management classic, the economic warehouse lot scheduling problem. While this paradigm…