The traveling salesman problem (TSP) is one of the most often-used NP-hard problems in
computer science to study the effectiveness of computing models and hardware platforms. In …

This paper reviews efforts to characterise the hardness of optimisation problem instances,
and to develop improved methodologies for empirical testing of the strengths and …

In this paper, we propose a quantum computing oriented benchmark for combinatorial
optimization. This benchmark, coined as QOPTLib, is composed of 40 instances equally …

We present a subproblemation scheme for heuristical solving of the JSP (Job Reassignment
Problem). The cost function of the JSP is described via a QUBO hamiltonian to allow …

The Traffic Assignment Problem (TAP) is a complex transportation optimisation problem
typically solved using meta-heuristics on classical computers. Quantum computers, despite …

This work is a survey and a position paper towards a higher abstraction in quantum
computing (QC) programming frameworks and software development kits (SDKs). Since in …

In this paper, we present a versatile and novel framework for antenna array synthesis and
optimization by leveraging simulated bifurcations of nonlinear oscillators. The desired …

In recent years, the Flow shop Scheduling Problem (FSP) has gained significant attention,
prompting researchers to develop various methods, from conventional to hybrid optimization …

The traveling salesman problem is the problem of finding out the shortest route in a network
of cities, that a salesman needs to travel to cover all the cities, without visiting the same city …

We present a QUBO (Quadratic Unconstrained Binary Optimization) form for the optimization
of electrical grid topologies, as a function of the state of its electrical maneuver elements, in …