Prior efforts to develop hardware for optimization problems have involved Ising machines, a category of hardware solvers that incorporate the Ising model to find the absolute or approximate “ground ...

A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial ...

We investigate risk-averse stochastic optimization problems with a risk-shaping constraint in the form of a stochastic-order relation. Both univariate and multivariate orders are considered. We extend ...

The optimization mode requires quantum effects, can solve a growing list of problems.

Quantum computers could provide significantly better solutions more quickly. Credit: HZB The traveling salesman problem is considered a prime example of a combinatorial optimization problem.

ExxonMobil and IBM's researchers have been working together to find quantum algorithms that could manage the global fleet of merchant ships.

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.