最近有人兴趣确定无陆地的最长航海距离，以及无遇主要水体的最长陆地距离。本文提出使用分支定界法计算两条路径。 In its basic form, this is an optimisation problem, rendered chaotic by the presence of islands and lakes, and indeed the fractal nature of the coasts. In this paper we present a methodology for calculating the two paths using the branch-and-bound algorithm. Submission history From: Rohan Chabukswar [view email] [v1]Mon, 9 Apr 2018 20:01:44 UTC (5,683 KB)[v2]Sat, 5 May 2018 09:21:35 UTC (5,683 KB)[v3]Thu, 28 Jun 2018 14:16:45 UTC (5,447 KB)[v4]Mon, 2 Jul 2018 17:52:41 UTC (5,654 KB)