We present a fast distributed solution to the convex network flow optimization problem. Our
approach uses a family of dual descent algorithms that approximate the Newton direction to …

This paper presents a bi‐level model to optimize automated‐vehicle‐friendly subnetworks in
urban road networks and an efficient algorithm to solve the model, which is relevant for the …

In this paper, we address a districting problem motivated by a real-world case study to
partition residential areas of a region for a healthcare system operation under interval …

An introductory professional course in industrial engineering (IE) on operations research
(OR) was initially designed to solve companies' practical optimisation problems. Research …

Algorithms for network flow problems, such as maximum flow, minimum cost flow, and multi-
commodity flow problems, are continuously developed and improved, and so, random …

The article describes transients caused by direct-on-line starting of induction motor occurring
in the proposed measuring circuit for negative sequence currents based on Rogowski coils …

We present a fast distributed solution to the capacity constrained convex network flow
optimization problem. Our solution is based on a distributed approximation of Newtons …

Databases usually contain incoherent information due to, for instance, the presence of noise
in the data. The detection of the incoherent information is an important challenge in different …

The main objective of the research was to compare the operation of the genetic algorithm
with selected heuristics (savings heuristics, Dijkstra heuristic, Christofides heuristics) for the …

We expand and refine the convergence rate analysis of the Accelerated Dual Descent
(ADD) Algorithm, a fast distributed solution to the convex network flow optimization problem …