Spatial branch-and-bound algorithms for global minimization of non-convex problems require both lower and upper bounding procedures that finally converge to a globally optimal value in order to ensure termination of these methods. Whereas convergence of lower bounds is commonly guaranteed for...

Background: Accurate route planning is a core challenge in logistics, particularly for small- and medium-sized enterprises that lack access to costly geospatial tools. This study explores whether usable distance matrices and routing outputs can be generated solely from geographic coordinates...