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

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

Darinka Dentcheva, Gabriela Martinez, Eli Wolfhagen, Augmented Lagrangian Methods for Solving Optimization Problems with Stochastic-Order Constraints, Operations Research, Vol. 64, No. 6 ...

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.

The big difference is that the formal mathematics behind solving maximum weight independent set problems is much more thoroughly worked out. But, with the new paper, the parallels go a bit deeper.

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