"Solving the Traveling Salesman Problem Using Efficient Randomized Parallel ..."

Keqin Li (1997)

> Home

Details and statistics

DOI: 10.1080/10637199708915622

access: closed

type: Journal Article

metadata version: 2017-05-20

- view
  - electronic edition via DOI
  - unpaywalled version
  authority control:
- export record
  dblp key:
  - journals/paapp/Li97
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/paapp/Li97
Keqin Li:
Solving the Traveling Salesman Problem Using Efficient Randomized Parallel Approximation Algorithms. Parallel Algorithms Appl. 10(3-4): 271-281 (1997)

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.