Discrete combinatorial optimization has a central role in many scientific disciplines, however, for hard problems we lack linear time algorithms that would allow us to solve very large instances.

A group of researchers at the Massachusetts Institute of Technology have devised a potentially more effective way of helping computers solve some of the toughest optimization problems they face. Their ...

Quantum computers can do wondrous things: too bad they do not exist yet. That has not stopped physicists from devising new algorithms for the devices, which can calculate a lot faster than ordinary ...

This paper deals with the nonlinear complementarity problem on the product space of unit simplices, S. A simplicial variable dimension algorithm developed by van der Laan and Talman for proper ...

Have a good mind for computational problem-solving? Fancy netting a cool $1 million for your efforts? Then the University of St. Andrews and the Clay Mathematics Institute sure have the competition ...

A research team has developed an extrapolation-based Doppler resolution enhancement algorithm for frequency modulated ...