"Parallelization of the Traveling Salesman Problem by Clustering its Nodes ..."

Vadim V. Romanuke (2023)

> Home

Details and statistics

DOI: 10.2478/ACSS-2023-0019

access: open

type: Journal Article

metadata version: 2024-03-16

- view
  - electronic edition via DOI (open access)
  authority control:
- export record
  dblp key:
  - journals/rigaacs/Romanuke23a
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/rigaacs/Romanuke23a
Vadim V. Romanuke:
Parallelization of the Traveling Salesman Problem by Clustering its Nodes and Finding the Best Route Passing through the Centroids. Appl. Comput. Syst. 28(2): 189-202 (2023)

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.