A line of engineering research seeks to develop computers that can tackle a class of challenges called combinatorial optimization problems. These are common in real-world applications such as ...

The traveling salesman problem is considered a prime example of a combinatorial optimization problem. Now a Berlin team led by theoretical physicist Prof. Dr. Jens Eisert of Freie Universität Berlin ...

You make decisions every day. Some are big, and some are small. But even the small decisions involve a great deal of complexity. Let me show you what I mean. Take something you probably do regularly: ...

Quantum computing is coming along faster than most realize. Multiple companies are developing several exciting technologies, ...

For years, quantum computers have carried a bold promise. They could solve problems so complex that even the world’s best ...

Dr. James McCaffrey of Microsoft Research uses full code samples to detail an evolutionary algorithm technique that apparently hasn't been published before. The goal of a combinatorial optimization ...