Abstract: The multi-commodity flow problem plays an important role in network optimization, routing, and service scheduling. With the network partitioning and the intermittent connectivity, the ...

Abstract: We study the maximum flow problem (MFP) employing the concepts of Recurrent Neural Networks (RNN)s. The aim of the present attempt is to find a solution for MFP utilizing projection RNN ...

Computer scientists have written a network flow algorithm that computes almost as fast as is mathematically possible. This algorithm computes the maximum traffic flow with minimum transport costs for ...

In 2022, a team of computer scientists presented a groundbreaking algorithm for the maximum flow problem: How does one transport the most supplies from a source node to a sink node in a network while ...

A team of computer scientists has come up with a dramatically faster algorithm for one of the oldest problems in computer science: maximum flow. The problem asks how much material can flow through a ...

The present study is to improve the volume flow rate of an axial fan through optimizing the blade shape under the demand for a specified static pressure. Fourteen design variables were selected to ...

Quantum annealing algorithms belong to the class of metaheuristic tools, applicable for solving binary optimization problems. Hardware implementations of quantum annealing, such as the quantum ...