Researchers have developed a method using the branch‑and‑bound algorithm to calculate the longest continuous routes on land and water that avoid major bodies of water or land. The problem is complicated by islands, lakes, and the fractal nature of coastlines, making simple distance calculations difficult. Published on arXiv in 2018, the study addresses this optimization challenge. The authors applied branch‑and‑bound techniques to determine maximum distances for uninterrupted travel across terrestrial and marine environments, using digital elevation and bathymetric data. Their approach provides reproducible path lengths and can be adapted to other geographic constraints. The work offers a systematic algorithmic solution to a longstanding geographical optimization problem, though further validation may be needed for practical applications.