相关论文: A branch-and-price algorithm for the robust single…

Logistics network is expected that opened facilities work continuously for a long time horizon without any failure, but in real world problems, facilities may face disruptions. This paper studies a reliable joint inventory location problem…

The Simple Plant Location Problem with Order (SPLPO) is a variant of the Simple Plant Location Problem (SPLP), where the customers have preferences over the facilities which will serve them. In particular, customers define their preferences…

In this paper we study how to optimally balance cheap inflexible resources with more expensive, reconfigurable resources despite uncertainty in the input problem. Specifically, we introduce the MinEMax model to study "build versus rent"…

In the classical facility location problem we consider a graph $G$ with fixed weights on the edges of $G$. The goal is then to find an optimal positioning for a set of facilities on the graph with respect to some objective function. We…

The classic online facility location problem deals with finding the optimal set of facilities in an online fashion when demand requests arrive one at a time and facilities need to be opened to service these requests. In this work, we study…

The increase of renewables in the grid and the volatility of the load create uncertainties in the day-ahead prices of electricity markets. Adaptive robust optimization (ARO) and stochastic optimization have been used to make commitment and…

In this work, we study the single machine scheduling problem with uncertain release times and processing times of jobs. We adopt a robust scheduling approach, in which the measure of robustness to be minimized for a given sequence of jobs…

Demand response services at the distribution level are emerging as enabling strategies for improving grid reliability in the presence of intermittent renewable generation and grid congestion. For residential loads, space heating and…

Understanding the dynamics of evolving social or infrastructure networks is a challenge in applied areas such as epidemiology, viral marketing, or urban planning. During the past decade, data has been collected on such networks but has yet…

The uncapacitated facility location has always been an important problem due to its connection to operational research and infrastructure planning. Byrka obtained an algorithm that is parametrized by $\gamma$ and proved that it is optimal…

Performance and reliability of content access in mobile networks is conditioned by the number and location of content replicas deployed at the network nodes. Facility location theory has been the traditional, centralized approach to study…

In this paper, we introduce a mixed integer quadratic formulation for the congested variant of the partial set covering location problem, which involves determining a subset of facility locations to open and efficiently allocating customers…

We study a variant of the uncapacitated facility location problem (UFL), where connection costs of clients are defined by (client specific) concave nondecreasing functions of the connection distance in the underlying metric. A special case…

In this paper, we investigate a supply chain network with a supplier and multiple retailers. The supplier can either take orders from retailers directly, or choose to build a warehouse somewhere in the network to centralize the ordering…

In the uncapacitated facility location problem, given a graph, a set of demands and opening costs, it is required to find a set of facilities R, so as to minimize the sum of the cost of opening the facilities in R and the cost of assigning…

Large, spatially flexible electricity consumers such as data centers can reallocate demand across locations, influencing dispatch and prices in wholesale electricity markets. While flexible load is often assumed to improve system…

We study contextual chance-constrained programming under decision-dependent uncertainty. In this setting, a decision not only needs to satisfy constraints but also alters the distribution of uncertain outcomes. This dependency makes the…

We study a competitive online optimization problem with multiple inventories. In the problem, an online decision maker seeks to optimize the allocation of multiple capacity-limited inventories over a slotted horizon, while the allocation…

This manuscript investigates the problem of locational complexity, a type of complexity that emanates from a companys territorial strategy. Using an entropy-based measure for supply chain structural complexity ( pars-complexity), we develop…

Price differentiation is a common strategy in many markets. In this paper, we study a static multiproduct price optimization problem with demand given by a discrete mixed multinomial logit model. By considering a mixed logit model that…