• Facets (new session)
• Description
• Metadata
• Settings
  • Rule: ActivityStreamsMapasEquivalentb3sb3sifpdbprdf-labelfacetshttp://dbpedia.org/resource/inference/rules/dbpedia#http://dbpedia.org/resource/inference/rules/opencyc#http://dbpedia.org/resource/inference/rules/umbel#http://dbpedia.org/resource/inference/rules/yago#http://dbpedia.org/schema/property_rules#http://www.ontologyportal.org/inference/rules/SUMO#http://www.ontologyportal.org/inference/rules/WordNet#http://www.w3.org/2002/07/owl#ldpoplwebskos-transurn:det:rdf:labelvirtrdf-labelvirtrdf-urlNone
    
  • Inverse Functional Properties: Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects
  • "Same As": Disabled (fastest) Apply to subjects only Apply to objects only Apply to both subjects and objects (recommended) Apply to subjects, objects and predicates (not recommended on big datasets) Apply to predicates only (special use cases only)

About: Analyst's traveling salesman theorem     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : yago:Theorem106752293, within Data Space : dbpedia.org associated with source document(s)

Type: yago:WikicatTheoremsInDiscreteMathematicsyago:Abstraction100002137yago:Communication100033020yago:Message106598915yago:Proposition106750804yago:Statement106722453yago:Theorem106752293 New Facet based on Instances of this Class

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 which plane sets are subsets of rectifiable curves of finite length. Whereas the original traveling salesman problem asks for the shortest way to visit every vertex in a finite set with a discrete path, this analytical version may require the curve to visit infinitely many points.