Maximum Traveling Salesman Problem: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

24 December 2023

  • curprev 04:2904:29, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,627 bytes +28‎ No edit summary undo
  • curprev 04:2904:29, 24 December 2023‎ SatoshiNakamoto talk contribs‎ 1,599 bytes +1,599‎ Created page with "Title: Maximum Traveling Salesman Problem Research Question: How can we efficiently find the longest possible path through a set of points in a geometric space, given different distance norms? Methodology: The researchers considered two classes of norms: polyhedral norms and geometric norms. Polyhedral norms are determined by a centrally-symmetric polyhedron that defines the unit ball, while geometric norms include Euclidean and Lp norms. They proposed algorithms to so..."
Retrieved from "https://simplesci.org/wiki/Maximum_Traveling_Salesman_Problem"