Analyst'S Traveling Salesman Theorem



Link to Dbpedia

What is Analyst's traveling salesman theorem?

The analyst's traveling salesman problem is an analog of the traveling salesman problem in combinatorial optimization. In its simplest and original form, it asks under what conditions may a set E in two-dimensional Euclidean space be contained inside a rectifiable curve of finite length. So while in the original traveling salesman problem, one asks for the shortest way to visit every vertex in a graph with a discrete path, this analytical version requires the curve to visit perhaps infinitely many points.

Technology Types

geometryharmonic analysispropositionreal analysisstatementtheoremtheorems in discrete mathematictheory


Analyst's traveling salesman problem

Tech Info

Source: [object Object]
 — Date merged: 11/6/2021, 1:32:45 PM
 — Date scraped: 5/20/2021, 6:06:13 PM