SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (Q3130161): Difference between revisions
From MaRDI portal
Latest revision as of 11:17, 27 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS |
scientific article |
Statements
SOLVING THE TRAVELING SALESMAN PROBLEM USING EFFICIENT RANDOMIZED PARALLEL APPROXIMATION ALGORITHMS (English)
0 references
9 October 1997
0 references
Monte Carlo CREW PRAM algorithm
0 references
traveling salesman
0 references