"A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal ..."

J. H. Halton, Routo Terada (1982)

> Home

Details and statistics

DOI: 10.1137/0211003

access: closed

type: Journal Article

metadata version: 2017-05-27

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/siamcomp/HaltonT82
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/siamcomp/HaltonT82
J. H. Halton, Routo Terada:
A Fast Algorithm for the Euclidean Traveling Salesman Problem, Optimal with Probability One. SIAM J. Comput. 11(1): 28-46 (1982)

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.