"subtour" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "tour"
      },
      "expansion": "sub- + tour",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + tour.",
  "forms": [
    {
      "form": "subtours",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "subtour (plural subtours)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with sub-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Graph theory",
          "orig": "en:Graph theory",
          "parents": [
            "Mathematics",
            "Visualization",
            "Formal sciences",
            "Computing",
            "Interdisciplinary fields",
            "Sciences",
            "Technology",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Ulrich Pferschy, Rostislav Stanek, “Generating subtour elimination constraints for the TSP from pure integer solutions”, in arXiv:",
          "text": "The resulting problem is solved to integer optimality, violated constraints (which are trivial to find) are added and the process is repeated until a feasible solution is found. In order to speed up the algorithm we pursue several attempts to find as many relevant subtours as possible.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A tour that makes up part of a larger tour."
      ],
      "id": "en-subtour-en-noun-Z8v6w3Ba",
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "tour",
          "tour"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A tour that makes up part of a larger tour."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "subtour"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "sub",
        "3": "tour"
      },
      "expansion": "sub- + tour",
      "name": "prefix"
    }
  ],
  "etymology_text": "From sub- + tour.",
  "forms": [
    {
      "form": "subtours",
      "tags": [
        "plural"
      ]
    }
  ],
  "head_templates": [
    {
      "args": {},
      "expansion": "subtour (plural subtours)",
      "name": "en-noun"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "noun",
  "senses": [
    {
      "categories": [
        "English countable nouns",
        "English entries with incorrect language header",
        "English lemmas",
        "English nouns",
        "English terms prefixed with sub-",
        "English terms with quotations",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Graph theory"
      ],
      "examples": [
        {
          "ref": "2015, Ulrich Pferschy, Rostislav Stanek, “Generating subtour elimination constraints for the TSP from pure integer solutions”, in arXiv:",
          "text": "The resulting problem is solved to integer optimality, violated constraints (which are trivial to find) are added and the process is repeated until a feasible solution is found. In order to speed up the algorithm we pursue several attempts to find as many relevant subtours as possible.",
          "type": "quote"
        }
      ],
      "glosses": [
        "A tour that makes up part of a larger tour."
      ],
      "links": [
        [
          "graph theory",
          "graph theory"
        ],
        [
          "tour",
          "tour"
        ]
      ],
      "raw_glosses": [
        "(graph theory) A tour that makes up part of a larger tour."
      ],
      "topics": [
        "graph-theory",
        "mathematics",
        "sciences"
      ]
    }
  ],
  "word": "subtour"
}