"travelling salesman problem" meaning in All languages combined

See travelling salesman problem on Wiktionary

Noun [English]

Head templates: {{en-noun|?|head=travelling salesman problem}} travelling salesman problem
  1. (mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city. Wikipedia link: travelling salesman problem Tags: Canada, UK Categories (topical): Mathematics Synonyms: travelling-salesman problem [British, Canada], traveling salesman problem [US], traveling-salesman problem [US] Related terms: Hamiltonian path, MathWorld article on the travelling salesman problem Translations (mathematical problem): problém obchodního cestujícího (Czech), handelsreizigersprobleem (Dutch), kauppamatkustajan ongelma (Finnish), problème du voyageur de commerce [masculine] (French), problème du commis voyageur [masculine] (French), Problem des Handlungsreisenden [neuter] (German), πρόβλημα του πλανόδιου πωλητή (próvlima tou planódiou polití) [neuter] (Greek), בעיית הסוכן הנוסע (Hebrew), az utazó ügynök problémája (Hungarian), problem komiwojażera (Polish), problema do caixeiro viajante [masculine] (Portuguese), seyyar satıcı problemi (Turkish)
    Sense id: en-travelling_salesman_problem-en-noun-RNOyacuw Categories (other): British English, Canadian English, English entries with incorrect language header Topics: mathematics, sciences

Alternative forms

Download JSON data for travelling salesman problem meaning in All languages combined (3.4kB)

{
  "head_templates": [
    {
      "args": {
        "1": "?",
        "head": "travelling salesman problem"
      },
      "expansion": "travelling salesman problem",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "British English",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Canadian English",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Mathematics",
          "orig": "en:Mathematics",
          "parents": [
            "Formal sciences",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "glosses": [
        "The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city."
      ],
      "id": "en-travelling_salesman_problem-en-noun-RNOyacuw",
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "optimization",
          "optimization"
        ]
      ],
      "raw_glosses": [
        "(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city."
      ],
      "related": [
        {
          "word": "Hamiltonian path"
        },
        {
          "urls": [
            "http://mathworld.wolfram.com/TravelingSalesmanProblem.html"
          ],
          "word": "MathWorld article on the travelling salesman problem"
        }
      ],
      "synonyms": [
        {
          "tags": [
            "British",
            "Canada"
          ],
          "word": "travelling-salesman problem"
        },
        {
          "tags": [
            "US"
          ],
          "word": "traveling salesman problem"
        },
        {
          "tags": [
            "US"
          ],
          "word": "traveling-salesman problem"
        }
      ],
      "tags": [
        "Canada",
        "UK"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "translations": [
        {
          "code": "cs",
          "lang": "Czech",
          "sense": "mathematical problem",
          "word": "problém obchodního cestujícího"
        },
        {
          "code": "nl",
          "lang": "Dutch",
          "sense": "mathematical problem",
          "word": "handelsreizigersprobleem"
        },
        {
          "code": "fi",
          "lang": "Finnish",
          "sense": "mathematical problem",
          "word": "kauppamatkustajan ongelma"
        },
        {
          "code": "fr",
          "lang": "French",
          "sense": "mathematical problem",
          "tags": [
            "masculine"
          ],
          "word": "problème du voyageur de commerce"
        },
        {
          "code": "fr",
          "lang": "French",
          "sense": "mathematical problem",
          "tags": [
            "masculine"
          ],
          "word": "problème du commis voyageur"
        },
        {
          "code": "de",
          "lang": "German",
          "sense": "mathematical problem",
          "tags": [
            "neuter"
          ],
          "word": "Problem des Handlungsreisenden"
        },
        {
          "code": "el",
          "lang": "Greek",
          "roman": "próvlima tou planódiou polití",
          "sense": "mathematical problem",
          "tags": [
            "neuter"
          ],
          "word": "πρόβλημα του πλανόδιου πωλητή"
        },
        {
          "code": "he",
          "lang": "Hebrew",
          "sense": "mathematical problem",
          "word": "בעיית הסוכן הנוסע"
        },
        {
          "code": "hu",
          "lang": "Hungarian",
          "sense": "mathematical problem",
          "word": "az utazó ügynök problémája"
        },
        {
          "code": "pl",
          "lang": "Polish",
          "sense": "mathematical problem",
          "word": "problem komiwojażera"
        },
        {
          "code": "pt",
          "lang": "Portuguese",
          "sense": "mathematical problem",
          "tags": [
            "masculine"
          ],
          "word": "problema do caixeiro viajante"
        },
        {
          "code": "tr",
          "lang": "Turkish",
          "sense": "mathematical problem",
          "word": "seyyar satıcı problemi"
        }
      ],
      "wikipedia": [
        "travelling salesman problem"
      ]
    }
  ],
  "word": "travelling salesman problem"
}
{
  "head_templates": [
    {
      "args": {
        "1": "?",
        "head": "travelling salesman problem"
      },
      "expansion": "travelling salesman problem",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "related": [
    {
      "word": "Hamiltonian path"
    },
    {
      "urls": [
        "http://mathworld.wolfram.com/TravelingSalesmanProblem.html"
      ],
      "word": "MathWorld article on the travelling salesman problem"
    }
  ],
  "senses": [
    {
      "categories": [
        "British English",
        "Canadian English",
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English multiword terms",
        "English nouns",
        "English nouns with unknown or uncertain plurals",
        "en:Mathematics"
      ],
      "glosses": [
        "The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city."
      ],
      "links": [
        [
          "mathematics",
          "mathematics"
        ],
        [
          "combinatorial",
          "combinatorial"
        ],
        [
          "optimization",
          "optimization"
        ]
      ],
      "raw_glosses": [
        "(mathematics, UK, Canada) The problem in combinatorial optimization in which, given a number of cities and the costs of travelling from one to the other, it is required to determine the cheapest route that visits each city once and then returns to the initial city."
      ],
      "tags": [
        "Canada",
        "UK"
      ],
      "topics": [
        "mathematics",
        "sciences"
      ],
      "wikipedia": [
        "travelling salesman problem"
      ]
    }
  ],
  "synonyms": [
    {
      "tags": [
        "British",
        "Canada"
      ],
      "word": "travelling-salesman problem"
    },
    {
      "tags": [
        "US"
      ],
      "word": "traveling salesman problem"
    },
    {
      "tags": [
        "US"
      ],
      "word": "traveling-salesman problem"
    }
  ],
  "translations": [
    {
      "code": "cs",
      "lang": "Czech",
      "sense": "mathematical problem",
      "word": "problém obchodního cestujícího"
    },
    {
      "code": "nl",
      "lang": "Dutch",
      "sense": "mathematical problem",
      "word": "handelsreizigersprobleem"
    },
    {
      "code": "fi",
      "lang": "Finnish",
      "sense": "mathematical problem",
      "word": "kauppamatkustajan ongelma"
    },
    {
      "code": "fr",
      "lang": "French",
      "sense": "mathematical problem",
      "tags": [
        "masculine"
      ],
      "word": "problème du voyageur de commerce"
    },
    {
      "code": "fr",
      "lang": "French",
      "sense": "mathematical problem",
      "tags": [
        "masculine"
      ],
      "word": "problème du commis voyageur"
    },
    {
      "code": "de",
      "lang": "German",
      "sense": "mathematical problem",
      "tags": [
        "neuter"
      ],
      "word": "Problem des Handlungsreisenden"
    },
    {
      "code": "el",
      "lang": "Greek",
      "roman": "próvlima tou planódiou polití",
      "sense": "mathematical problem",
      "tags": [
        "neuter"
      ],
      "word": "πρόβλημα του πλανόδιου πωλητή"
    },
    {
      "code": "he",
      "lang": "Hebrew",
      "sense": "mathematical problem",
      "word": "בעיית הסוכן הנוסע"
    },
    {
      "code": "hu",
      "lang": "Hungarian",
      "sense": "mathematical problem",
      "word": "az utazó ügynök problémája"
    },
    {
      "code": "pl",
      "lang": "Polish",
      "sense": "mathematical problem",
      "word": "problem komiwojażera"
    },
    {
      "code": "pt",
      "lang": "Portuguese",
      "sense": "mathematical problem",
      "tags": [
        "masculine"
      ],
      "word": "problema do caixeiro viajante"
    },
    {
      "code": "tr",
      "lang": "Turkish",
      "sense": "mathematical problem",
      "word": "seyyar satıcı problemi"
    }
  ],
  "word": "travelling salesman problem"
}

This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-05-12 from the enwiktionary dump dated 2024-05-02 using wiktextract (ae36afe and 304864d). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.

If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.