Related papers: New commodity representations for multicommodity n…
This paper discusses the fixed-hub single allocation problem (FHSAP). In this problem, a network consists of hub nodes and terminal nodes. Hubs are fixed and fully connected; each terminal node is connected to a single hub which routes all…
Mixed packing and covering problems are problems that can be formulated as linear programs using only non-negative coefficients. Examples include multicommodity network flow, the Held-Karp lower bound on TSP, fractional relaxations of set…
We propose a unified coded framework for distributed computing with straggling servers, by introducing a tradeoff between "latency of computation" and "load of communication" for some linear computation tasks. We show that the coded scheme…
The increasing number of flexible devices and distributed energy resources in power grids renders the coordination of transmission and distribution systems increasingly complex. In this paper, we discuss and compare two different approaches…
Recently, we proposed a capacity expansion approach for transmission grids that combines the upgrade of transmission capacity with a transition in system structure to improve grid operation. The key to this concept is a particular hybrid…
We consider a mobile cloud computing system with multiple users, a remote cloud server, and a computing access point (CAP). The CAP serves both as the network access gateway and a computation service provider to the mobile users. It can…
In this paper, we introduce a new framework for approximately solving flow problems in capacitated, undirected graphs and apply it to provide asymptotically faster algorithms for the maximum $s$-$t$ flow and maximum concurrent…
We address the joint optimization of multiple stream joins in a scale-out architecture by tailoring prior work on multi-way stream joins to predicate-driven data partitioning schemes. We present an integer linear programming (ILP)…
We consider the problem of reserving link capacity in a network in such a way that any of a given set of flow scenarios can be supported. In the optimal capacity reservation problem, we choose the reserved link capacities to minimize the…
We study financial networks where banks are connected through bilateral liabilities and may default when resources are insufficient to meet obligations. We consider both the standard proportional clearing model and a priority-proportional…
In this paper, we consider the network slicing (NS) problem which attempts to map multiple customized virtual network requests (also called services) to a common shared network infrastructure and manage network resources to meet diverse…
The widespread diffusion of distributed energy resources, especially those based on renewable energy, and energy storage devices has deeply modified power systems. As a consequence, demand response, the ability of customers to respond to…
While globally optimal solutions to many convex programs can be computed efficiently in polynomial time, this is, in general, not possible for nonconvex optimization problems. Therefore, locally optimal approaches or other efficient…
Given a flow network, the Minimum Flow Decomposition (MFD) problem is finding the smallest possible set of weighted paths whose superposition equals the flow. It is a classical, strongly NP-hard problem that is proven to be useful in RNA…
We aim to derive effective lower bounds for the Discrete Cost Multicommodity Network Design Problem (DCMNDP). Given an undirected graph, the problem requires installing at most one facility on each edge such that a set of point-to-point…
In this paper, the cooperative jobs dispatching problem in an edge computing network with multiple access points (APs) and edge servers is considered. Due to the uncertain traffic in the network between APs and edge servers, the job…
The adoption of market-based principles in resource management systems for computational infrastructures such as grids and clusters allows for matching demand and supply for resources in a utility maximizing manner. As such, they offer a…
This paper presents a novel approach to solve capacitated facility location problems (FLP) that encompass various resource allocation problems. FLPs are a class of NP-hard combinatorial optimization problems, involving optimal placement and…
Maritime Inventory Routing Problem (MIRP) plays a crucial role in the integration of global maritime commerce levels. However, there are still no well-established methodologies capable of efficiently solving large MIRP instances or their…
The goal to decarbonize the energy sector has led to increased research in modeling and optimizing multi-energy systems. One of the most promising techniques for modeling (multi-)energy optimization problems is mixed-integer programming…