The Ant Colony Optimization (ACO) algorithm is a metaheuristic nature-inspired technique for solving various combinatorial optimization problems. The shortest-path problem is an important ...

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

Graph algorithms constitute a pivotal component of modern computational science, underpinning diverse applications ranging from transportation optimisation and telecommunications to social network ...

It is known that minimum cost flow problems can be solved by successive augmentations along shortest paths. In this paper the issues of implementing shortest path algorithms in this context are ...

Conventional quantum algorithms are not feasible for solving combinatorial optimization problems (COPs) with constraints in the operation time of quantum computers. To address this issue ...

The team designed a fully dynamic APSP algorithm in the MPC model with low round complexity that is faster than all the existing static parallel APSP algorithms.

The Quantum Information Recursive Optimization (QIRO) algorithm is an optimization algorithm based on quantum computers, designed to tackle complex combinatorial optimization problems.