{
  "annotation_id": "c2e5bcc1-ea52-4979-a8cc-0544d5bd1ede",
  "date_created": "2026-03-02T18:01:10.812000Z",
  "date_modified": "2026-03-02T18:01:10.812000Z",
  "file_hash": "f6269d5ab4d51fc095c13f2cf25b740896088da0aab171a35d48ef1ddd993949",
  "private": false,
  "record": {
    "abstract": "When trying to find approximate solutions for the Traveling Salesman Problem\nwith heuristic optimization algorithms, small moves called Lin-$k$-Opts are\noften used. In our paper, we provide exact formulas for the numbers of possible\ntours into which a randomly chosen tour can be changed with a Lin-$k$-Opt.",
    "arxiv_id": "physics/0608269",
    "authors": [
      "Guenther Stattenberger",
      "Markus Dankesreiter",
      "Florian Baumgartner",
      "Johannes J. Schneider"
    ],
    "categories": [
      "physics.comp-ph",
      "physics.data-an"
    ],
    "title": "On the exact number of possibilities for cutting and reconnecting the   tour of a traveling salesman with Lin-$k$-Opts",
    "url": "https://arxiv.org/abs/physics/0608269"
  },
  "schema_id": "dorsal/arxiv",
  "source": {
    "execution_id": "5aea7724-6507-4ac9-86a4-86cd43e626ec",
    "id": "arXiv Dataset IDs",
    "type": "Model",
    "variant": "snapshot-2026-03-01",
    "version": "0.1.0"
  },
  "user_id": 1000002
}