Shortest Path Network Interdiction with Asymmetric Uncertainty

This paper considers an extension of the shortest path network interdiction problem that incorporates robustness to account for parameter uncertainty. The shortest path interdiction problem is a game of two players with conflicting agendas and capabilities: an evader, who traverses the arcs of a network from a source node to a sink node using the … Read more

Network Migration Problem: A Logic-based Benders Decomposition Driven by Column Generation and Constraint Programming

Telecommunication networks frequently face technological advancements and need to upgrade their infrastructure. Adapting legacy networks to the latest technology requires synchronized technicians responsible for migrating the equipment. The goal of the network migration problem is to find an optimal plan for this process. This is a defining step in the customer acquisition of telecommunications service … Read more

Analysis of Process Flexibility Designs under Disruptions

Most of the previous studies of process flexibility designs have focused on expected sales and demand uncertainty. In this paper, we examine the worst-case performance of flexibility designs in the case of demand and supply uncertainties, where the latter can be in the form of either plant or arc disruptions. We define the Plant Cover … Read more

Network-based Approximate Linear Programming for Discrete Optimization

We develop a new class of approximate linear programs (ALPs) that project the high-dimensional value function of dynamic programs onto a class of basis functions, each defined as a network that represents aggregrations over the state space. The resulting ALP is a minimum-cost flow problem over an extended variable space that synchronizes flows across multiple … Read more

Uniqueness of Market Equilibria on Networks with Transport Costs

We study the existence and uniqueness of equilibria for perfectly competitive markets in capacitated transport networks. The model under consideration is rather general so that it captures basic aspects of related models in, e.g., gas or electricity networks. We formulate the market equilibrium model as a mixed complementarity problem and show the equivalence to a … Read more

Uniqueness and Multiplicity of Market Equilibria on DC Power Flow Networks

We consider uniqueness and multiplicity of market equilibria in a short-run setup where traded quantities of electricity are transported through a capacitated network in which power flows have to satisfy the classical lossless DC approximation. The firms face fluctuating demand and decide on their production, which is constrained by given capacities. Today, uniqueness of such … Read more

GasLib – A Library of Gas Network Instances

The development of mathematical simulation and optimization models and algorithms for solving gas transport problems is an active field of research. In order to test and compare these models and algorithms, gas network instances together with demand data are needed. The goal of GasLib is to provide a set of publicly available gas network instances … Read more

Uniqueness of Market Equilibrium on a Network: A Peak-Load Pricing Approach

In this paper we establish conditions under which uniqueness of market equilibrium is obtained in a setup where prior to trading of electricity, transmission capacities between different market regions are fixed. In our setup, firms facing fluctuating demand decide on the size and location of production facilities. They make production decisions constrained by the invested … Read more

Mathematical Programming techniques in Water Network Optimization

In this article we survey mathematical programming approaches to problems in the field of water network optimization. Predominant in the literature are two different, but related problem classes. One can be described by the notion of network design, while the other is more aptly termed by network operation. The basic underlying model in both cases … Read more

Competitive location in networks with threshold-sensitive customer behaviour

We consider the (r|X_p)-medianoid problem in networks. Goods are assumed to be essential and the only decision criterion is the travel distance. The portion of demand captured by the competitors is modelled by a general capture function which includes the binary, partially binary and proportional customer choice rules as specific cases. We prove that, under … Read more