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

This paper presents a new branch and bound algorithm for the single machine total weighted tardiness problem. It obtains lower bounds using a Lagrangian relaxation approach with subproblems that are ...

A discrete time model is presented for dynamic traffice assignment with a single destination. Congestion is treated explicitly in the flow equations. The model is a nonlinear and nonconvex ...

The algorithm would be able to augment its own ability by also looking at potential combinations of code for how a problem could be solved.

It’s been difficult to find important questions that quantum computers can answer faster than classical machines, but a new algorithm appears to do so for some critical optimization tasks.

A nice thought experiment, perhaps, but one that assumes the people who write algorithms know with any level of precision or individuality how they work.