Computer scientists are abuzz over a fast new algorithm for solving one of the central problems in the field.

In one sign of the potential gains, a researcher at Google claimed recently to have devised a 20-fold reduction in the scale of a quantum computer that would be needed to run Shor’s algorithm, which ...

The new algorithm solves these two problems in “almost linear” time, which means that the algorithm’s runtime is roughly proportional to the amount of time it takes merely to write down the details of ...

Dimitri P. Bertsekas, The Auction Algorithm for Assignment and Other Network Flow Problems: A Tutorial, Interfaces, Vol. 20, No. 4, The Practice of Mathematical ...

When we tested our algorithms with the widely used sample data sets, we were surprised at how well they performed relative to open-source algorithms assembled by IBM.

We describe an algorithm for the 0-1 knapsack problem (KP), which relies mainly on three new ideas. The first one is to focus on what we call the core of the problem, namely, a knapsack problem ...