Related papers: AC-Feasibility on Tree Networks is NP-Hard
Given a graph $G$ rooted at a vertex $r$ and weight functions, $\gamma, \tau: E(G) \rightarrow \mathbb{R}$, the generalized cable-trench problem (CTP) is to find a single spanning tree that simultaneously minimizes the sum of the total edge…
In this paper, we study the complexity of the periodic temporal graph realization problem with respect to upper bounds on the fastest path durations among its vertices. This constraint with respect to upper bounds appears naturally in…
Cellular networks provide communication for different applications. Some applications have strict and very short latency requirements, while others require high bandwidth with varying priorities. The challenge of satisfying the requirements…
In this paper we address the problem of designing scheduling logic for stabilizing Networked Control Systems (NCSs) with plants and controllers remotely-located over a limited capacity communication network subject to data losses. Our…
The AC Optimal Power Flow (AC-OPF) problem is central to power system operation but challenging to solve efficiently due to its nonconvex and nonlinear nature. Neural networks (NNs) offer fast surrogates, yet their black-box behavior raises…
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…
This paper incorporates a continuous-type network flexibility into chance constrained economic dispatch (CCED). In the proposed model, both power generations and line susceptances are continuous variables to minimize the expected generation…
The problem considered is the following. Given a graph with edge weights satisfying the triangle inequality, and a degree bound for each vertex, compute a low-weight spanning tree such that the degree of each vertex is at most its specified…
We study the electrical distribution network reconfiguration problem, defined as follows. We are given an undirected graph with a root vertex, demand at each non-root vertex, and resistance on each edge. Then, we want to find a spanning…
Convex relaxations of AC optimal power flow (AC-OPF) problems have attracted significant interest as in several instances they provably yield the global optimum to the original non-convex problem. If, however, the relaxation is inexact, the…
Soft-thresholding has been widely used in neural networks. Its basic network structure is a two-layer convolution neural network with soft-thresholding. Due to the network's nature of nonlinearity and nonconvexity, the training process…
Accessibility percolation is a new type of percolation problem inspired by evolutionary biology. To each vertex of a graph a random number is assigned and a path through the graph is called accessible if all numbers along the path are in…
Dynamic network flows, sometimes called flows over time, extend the notion of network flows to include a transit time for each edge. While Ford and Fulkerson showed that certain dynamic flow problems can be solved via a reduction to static…
This paper proves that in an unbalanced multi-phase network with a tree topology, the semidefinite programming relaxation of optimal power flow problems is exact when critical buses are not adjacent to each other. Here a critical bus either…
Tree containment problem is a fundamental problem in phylogenetic study, as it is used to verify a network model. It asks whether a given network contain a subtree that resembles a binary tree. The problem is NP-complete in general, even in…
A wind farm can provide reactive power at sub-transmission and transmission buses in order to support and improve voltage profiles. It is common for the reactive power capability of a wind farm to be evaluated as the sum of the individual…
Graph connectivity and network design problems are among the most fundamental problems in combinatorial optimization. The minimum spanning tree problem, the two edge-connected spanning subgraph problem (2-ECSS) and the tree augmentation…
The magnitude of the August 2003 blackout affecting the United States has put the challenges of energy transmission and distribution into limelight. Despite all the interest and concerted effort, the complexity and interconnectivity of the…
Recent advances in bipartite consensus on matrix-weighted networks, where agents are divided into two disjoint sets with those in the same set agreeing on a certain value and those in different sets converging to opposite values, have…
Many complex systems demand manifold resources to be supplied from distinct channels to function properly, i.e, water, gas, and electricity for a city. Here, we study a model for viability of such systems demanding more than one type of…