Related papers: On Solving the Maximum Flow Problem with Conflict …
Convex relaxations of non-convex optimal power flow (OPF) problems have recently attracted significant interest. While existing relaxations globally solve many OPF problems, there are practical problems for which existing relaxations fail…
The paper focuses on a multidimensional optimization problem, which is formulated in terms of tropical mathematics and consists in minimizing a nonlinear objective function subject to linear inequality constraints. To solve the problem, we…
This article treats optimal sparse control problems with multiple constraints defined at intermediate points of the time domain. For such problems with intermediate constraints, we first establish a new Pontryagin maximum principle that…
Constraint Programming is roughly a new software technology introduced by Jaffar and Lassez in 1987 for description and effective solving of large, particularly combinatorial, problems especially in areas of planning and scheduling. In the…
The maximum multicommodity flow problem is a natural generalization of the maximum flow problem to route multiple distinct flows. Obtaining a $1-\epsilon$ approximation to the multicommodity flow problem on graphs is a well-studied problem.…
In this work, we aim to compare different methods and formulations to solve a problem in air traffic management to global optimality. In particular, we focus on the aircraft deconfliction problem, where we are given n aircraft, their…
The use of reduced and mixed precision computing has gained increasing attention in high-performance computing (HPC) as a means to improve computational efficiency, particularly on modern hardware architectures like GPUs. In this work, we…
We consider integer programming problems with bounded general-integer variables belonging to the general class of network flow problems. For those, we computationally investigate the effect on mixed-integer linear programming (MIP) solvers…
The bottleneck network flow problem (BNFP) is a generalization of several well-studied bottleneck problems such as the bottleneck transportation problem (BTP), bottleneck assignment problem (BAP), bottleneck path problem (BPP), and so on.…
We consider the all-pairs multicommodity network flow problem on a network with capacitated edges. The usual treatment keeps track of a separate flow for each source-destination pair on each edge; we rely on a more efficient formulation in…
In this letter, we present an alternative mixed-integer non-liner programming formulation of the reactive optimal power flow (ROPF) problem. We utilize a mixed-integer second-order cone programming (MISOCP) based approach to find global…
Data flow analysis and optimization is considered for homogeneous rectangular mesh networks. We propose a flow matrix equation which allows a closed-form characterization of the nature of the minimal time solution, speedup and a simple…
Our goal is to develop a flux limiter of the Flux-Corrected Transport method for a nonconservative convection-diffusion equation. For this, we consider a hybrid difference scheme that is a linear combination of a monotone scheme and a…
In many power system optimization problems, we observe that only a small fraction of the line flow constraints ever become active at the optimal solution, despite variations in the load profile and generation costs. This observation has…
In this paper, we present an improved algorithm for the maximum flow problem on general networks with $n$ vertices and $m$ arcs. We show how to solve the problem in $O(mn)$ time, when $m = O(n^{2-\epsilon})$, for some $0 <\epsilon \leq 1$.…
We present sufficient conditions for the load-flow solvability under security constraints in DC distribution networks. In addition, we show that a load-flow solution that fulfills security constraints can be obtained via a convex…
This manuscript describes the notions of blocker and interdiction applied to well-known optimization problems. The main interest of these two concepts is the capability to analyze the existence of a combinatorial structure after some…
The study of the fundamental limits of information systems is a central theme in information theory. Both the traditional analytical approach and the recently proposed computational approach have significant limitations, where the former is…
Flow-based generative models have emerged as powerful priors for solving inverse problems. One option is to directly optimize the initial latent code (noise), such that the flow output solves the inverse problem. However, this requires…
This article treats three problems of sparse and optimal multiplexing a finite ensemble of linear control systems. Given an ensemble of linear control systems, multiplexing of the controllers consists of an algorithm that selects, at each…