Nov 26, 2020
I wonder if you can frame it in terms of a quadratic unconstrained binary optimization. I believe the shortest path you explained in this post is a subset of the traveling salesman problem.
Written by Riccardo Di Sipio
Senior Machine Learning developer at Dayforce. NLP, LLMs, graph neural networks. Formerly physicist at U Toronto, Bologna, CERN LHC/ATLAS.