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

The Quantum Approximate Optimization Algorithm (QAOA) represents a leading framework for addressing combinatorial optimisation problems on near-term quantum devices. By alternating between a cost ...

A framework based on advanced AI techniques can solve complex, computationally intensive problems faster and in a more more scalable way than state-of-the-art methods, according to a new study. A ...

Particle Swarm Optimization (PSO) has emerged as a versatile metaheuristic for tackling NP-hard combinatorial optimisation challenges by emulating the collective intelligence of social organisms. In ...

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 proposed algorithm combines variational scheduling with post-processing to achieve near-optimal solutions to combinatorial optimization problems with constraints within the operation time of ...

A fully-connected annealer extendable to a multi-chip system and featuring a multi-policy mechanism has been designed by Tokyo Tech researchers to solve a broad class of combinatorial optimization (CO ...

Annealing processors are more energy efficient and quicker at solving mathematical optimization problems than PCs. Researchers at Tokyo University of Science have now developed a new approach to ...

Hardware technology has been developed that can solve the core challenge of the big data and artificial intelligence era—the "combinatorial optimization problem"—faster and more efficiently. A ...

Dr. James McCaffrey of Microsoft Research shows how to implement simulated annealing for the Traveling Salesman Problem (find the best ordering of a set of discrete items). The goal of a combinatorial ...

A new technical paper titled “Analog optical computer for AI inference and combinatorial optimization” was published by researchers at Microsoft Research, Barclays and University of Cambridge.

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