51 citations · 64 across the 4 of their papers we have counts for
6 papers
A Variable Neighbourhood Descent Heuristic for Conformational Search Using a Quantum Annealer
D. J. J. Marchand, M. Noori, A. Roberts +6
Discovering the low-energy conformations of a molecule is of great interest to computational chemists, with applications in {\em in silico} materials design and drug discovery. In…
A characterization of Linearizable instances of the Quadratic Traveling Salesman Problem
Abraham P. Punnen, Matthias Walter, Brad D. Woods
We consider the linearization problem associated with the quadratic traveling salesman problem (QTSP). Necessary and sufficient conditions are given for a cost matrix of QTSP t…
A class of exponential neighbourhoods for the quadratic travelling salesman problem
Brad Woods, Abraham Punnen
The Quadratic Travelling Salesman Problem (QTSP) is to find a least-cost Hamiltonian cycle in an edge-weighted graph, where costs are defined on all pairs of edges such that each e…
Solving constrained quadratic binary problems via quantum adiabatic evolution
Pooya Ronagh, Brad Woods, Ehsan Iranmanesh
Quantum adiabatic evolution is perceived as useful for binary quadratic programming problems that are a priori unconstrained. For constrained problems, it is a common practice to r…
Building an iterative heuristic solver for a quantum annealer
Gili Rosenberg, Mohammad Vazifeh, Brad Woods +1
A quantum annealer heuristically minimizes quadratic unconstrained binary optimization (QUBO) problems, but is limited by the physical hardware in the size and density of the probl…
A Linear Time Algorithm for the -neighbour Traveling Salesman Problem on Halin graphs and extensions
Brad Woods, Abraham Punnen, Tamon Stephen
The Quadratic Travelling Salesman Problem (QTSP) is to find a least cost Hamilton cycle in an edge-weighted graph, where costs are defined on all pairs of edges contained in the Ha…