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 ...

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.

A canonical problem in computer science is to find the shortest route to every point in a network. A new approach beats the classic algorithm taught in textbooks.

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 ...

Martin Desrochers, Jacques Desrosiers, Marius Solomon, A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows, Operations Research, Vol. 40 ...

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