Related papers: An Optimization Framework for Power Infrastructure…
Pathways that describe the optimal evolution of energy systems across multiple decades are important in energy system research and policy literature, with net-zero and similar climate policies being common drivers behind them. While there…
Classical shortest-path methods rely on binary tropical semirings $(\min,+)$, whose dyadic structure limits them to pairwise cost interactions. However, many real-world systems, including logistics, supply chains, communication networks,…
The reliable operation of large-scale electric power networks is increasingly challenging, particularly with the integration of stochastic renewable generation. In this work, we address the problem of minimizing network transients by…
In this paper, we examine the internet of things system which is dedicated for smart cities, smart factory, and connected cars, etc. To support such systems in wide area with low power consumption, energy harvesting technology without wired…
An efficient method for computing solutions to the Optimal Transportation (OT) problem with a wide class of cost functions is presented. The standard linear programming (LP) discretization of the continuous problem becomes intractible for…
We provide a geometric solution to the problem of optimal relay positioning to maximize the multicast rate for low-SNR networks. The networks we consider, consist of a single source, multiple receivers and the only intermediate and…
In this paper, we propose a novel wireless scheme that integrates satellite, airborne, and terrestrial networks aiming to support ground users. More specifically, we study the enhancement of the achievable users' throughput assisted with…
This paper is about the problem of finding a shortest $s$-$t$ path using at most $h$ edges in edge-weighted graphs. The Bellman--Ford algorithm solves this problem in $O(hm)$ time, where $m$ is the number of edges. We show that this running…
Finding a shortest path in a graph is one of the most classic problems in algorithmic and graph theory. While we dispose of quite efficient algorithms for this ordinary problem (like the Dijkstra or Bellman-Ford algorithms), some slight…
In this paper we consider the problem of optimizing the ecological connectivity of a landscape under a budget constraint by improving habitat areas and ecological corridors between them. We consider a formulation of this problem in terms of…
We address the problem of configuring a power distribution network with reliability and resilience objectives by satisfying the demands of the consumers and saturating each production source as little as possible. We consider power…
Modeling traffic distribution and extracting optimal flows in multilayer networks is of utmost importance to design efficient multi-modal network infrastructures. Recent results based on optimal transport theory provide powerful and…
Given a network infrastructure (e.g., data-center or on-chip-network) and a distribution on the source-destination requests, the expected path (route) length is an important measure for the performance, efficiency and power consumption of…
We propose an optimization approach to design cost-effective electrical power transmission networks. That is, we aim to select both the network structure and the line conductances (line sizes) so as to optimize the trade-off between network…
The service provided by mobile networks operated today is not adapted to spatio-temporal fluctuations in traffic demand, although such fluctuations offer opportunities for energy savings. In particular, significant gains in energy…
We present a study of the application of a variant of a recently introduced heuristic algorithm for the optimization of transport routes on complex networks to the problem of finding the optimal routes of communication between nodes on…
Optimal power flow (OPF) is the central optimization problem in electric power grids. Although solved routinely in the course of power grid operations, it is known to be strongly NP-hard in general, and weakly NP-hard over tree networks. In…
Optimal paths connecting randomly selected network nodes and fixed routers are studied analytically in the presence of non-linear overlap cost that penalizes congestion. Routing becomes increasingly more difficult as the number of selected…
Given a multidimensional free-energy or potential-energy landscape, finding reaction paths that connect an initial (or reactant) state and a final (or product) state is important for biophysics and materials science. The likelihood of a…
This work analyzes convergence times and robustness bounds for asynchronous distributed shortest-path computation. We focus on the Adaptive Bellman--Ford algorithm, a self-stabilizing method in which each agent updates its shortest-path…