The Quadratic Unconstrained Binary Optimization (QUBO) model has gained prominence in
recent years with the discovery that it unifies a rich variety of combinatorial optimization …

Combinatorial optimization is anticipated to be one of the primary use cases for quantum
computation in the coming years. The Quantum Approximate Optimization Algorithm and …

In recent years the unconstrained binary quadratic program (UBQP) has grown in
importance in the field of combinatorial optimization due to its application potential and its …

The Capacitated Vehicle Routing Problem (CVRP) is an NP-optimization problem (NPO)
that has been of great interest for decades for both, science and industry. The CVRP is a …

Written by prominent experts in the field, this monograph provides the first comprehensive,
unified presentation of the structural, algorithmic and applied aspects of the theory of …

The inability of conventional electronic architectures to efficiently solve large combinatorial
problems motivates the development of novel computational hardware. There has been …

This work focuses on expressing the TSP with Time Windows (TSPTW for short) as a
quadratic unconstrained binary optimization (QUBO) problem. The time windows impose …

This paper describes an experimental study of a novel computing system (algorithm plus
platform) that carries out quantum annealing, a type of adiabatic quantum computation, to …

User demand for increasing amounts of wireless capacity continues to outpace supply, and
so to meet this demand, significant progress has been made in new MIMO wireless physical …

We present both an overview and a perspective of recent experimental advances and
proposed new approaches to performing computation using memristors. A memristor is a 2 …