Solving One-Dimensional Distance Geometry: a Comparison of GPU Annealing and Branch-and-Prune
This paper explores the application of the Quantix GPU annealer for solving the Subset Sum Problem (SSP) and equivalent cycle instances of the one-dimensional Distance Geometry Problem (DGP). We present a comparative study against the exact Branch and Prune (BP) algorithm across various instance classes to evaluate the...