"The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential ..."

Sophia Heimann, Hung P. Hoang, Stefan Hougardy (2024)

> Home

Details and statistics

DOI: 10.4230/LIPICS.ICALP.2024.84

access: open

type: Conference or Workshop Paper

metadata version: 2024-07-02

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - conf/icalp/Heimann0H24
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/icalp/Heimann0H24
Sophia Heimann, Hung P. Hoang, Stefan Hougardy:
The k-Opt Algorithm for the Traveling Salesman Problem Has Exponential Running Time for k ≥ 5. ICALP 2024: 84:1-84:18

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.