Gast ::
| Hauptseite > Publikationsdatenbank > The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP > print |
| Hauptseite > Publikationsdatenbank > The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP > print |
| 001 | 811184 | ||
| 005 | 20210129223755.0 | ||
| 024 | 7 | _ | |a 10.1016/0167-8191(88)90122-6 |2 doi |
| 024 | 7 | _ | |a 0167-8191 |2 ISSN |
| 024 | 7 | _ | |a 1872-7336 |2 ISSN |
| 024 | 7 | _ | |a WOS:A1988R035300019 |2 WOS |
| 024 | 7 | _ | |a altmetric:2874362 |2 altmetric |
| 037 | _ | _ | |a FZJ-2016-03693 |
| 082 | _ | _ | |a 004 |
| 100 | 1 | _ | |a Gurke, Renate |0 P:(DE-HGF)0 |b 0 |e Corresponding author |
| 245 | _ | _ | |a The approximate solution of the Euclidean traveling salesman problem on a CRAY X-MP |
| 260 | _ | _ | |a Amsterdam [u.a.] |c 1988 |b North-Holland, Elsevier Science |
| 336 | 7 | _ | |a article |2 DRIVER |
| 336 | 7 | _ | |a Output Types/Journal article |2 DataCite |
| 336 | 7 | _ | |a Journal Article |b journal |m journal |0 PUB:(DE-HGF)16 |s 1467793955_25740 |2 PUB:(DE-HGF) |
| 336 | 7 | _ | |a ARTICLE |2 BibTeX |
| 336 | 7 | _ | |a JOURNAL_ARTICLE |2 ORCID |
| 336 | 7 | _ | |a Journal Article |0 0 |2 EndNote |
| 520 | _ | _ | |a The efficient use of MIMD computers calls for a careful choice of adequate algorithms as for an implementation taking into account the particular architecture. To demonstrate these facts, a parallel algorithm to find an approximate solution to the Euclidean Traveling Salesman Problem (ETSP) is presented. The algorithm is a parallelization of Karp's partitioning algorithm. It is a divide-and-conquer method for solving the ETSP approximately. Since the successor vertex to any vertex in the tour is usually a nearby vertex, the problem can be ‘geographically’ partitioned into subproblems which then can be solved independently. The resulting subtours can be combined into a single tour which is an approximate solution to the ETSP. The algorithm is implemented on a CRAY X-MP with two and four processors, and results using macrotasking and microtasking are presented. |
| 536 | _ | _ | |a 899 - ohne Topic (POF3-899) |0 G:(DE-HGF)POF3-899 |c POF3-899 |f POF III |x 0 |
| 588 | _ | _ | |a Dataset connected to CrossRef |
| 773 | _ | _ | |a 10.1016/0167-8191(88)90122-6 |g Vol. 8, no. 1-3, p. 177 - 183 |0 PERI:(DE-600)1466340-5 |n 1-3 |p 177 - 183 |t Parallel computing |v 8 |y 1988 |x 0167-8191 |
| 909 | C | O | |o oai:juser.fz-juelich.de:811184 |p VDB |
| 913 | 1 | _ | |a DE-HGF |b Programmungebundene Forschung |l ohne Programm |1 G:(DE-HGF)POF3-890 |0 G:(DE-HGF)POF3-899 |2 G:(DE-HGF)POF3-800 |v ohne Topic |x 0 |4 G:(DE-HGF)POF |3 G:(DE-HGF)POF3 |
| 915 | _ | _ | |a JCR |0 StatID:(DE-HGF)0100 |2 StatID |b PARALLEL COMPUT : 2014 |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0200 |2 StatID |b SCOPUS |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0300 |2 StatID |b Medline |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0199 |2 StatID |b Thomson Reuters Master Journal List |
| 915 | _ | _ | |a WoS |0 StatID:(DE-HGF)0111 |2 StatID |b Science Citation Index Expanded |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)0150 |2 StatID |b Web of Science Core Collection |
| 915 | _ | _ | |a DBCoverage |0 StatID:(DE-HGF)1160 |2 StatID |b Current Contents - Engineering, Computing and Technology |
| 915 | _ | _ | |a IF < 5 |0 StatID:(DE-HGF)9900 |2 StatID |
| 920 | 1 | _ | |0 I:(DE-Juel1)VDB62 |k ZAM |l Zentralinstitut für Angewandte Mathematik |x 0 |
| 920 | 1 | _ | |0 I:(DE-Juel1)JSC-20090406 |k JSC |l Jülich Supercomputing Center |x 1 |
| 980 | _ | _ | |a journal |
| 980 | _ | _ | |a VDB |
| 980 | _ | _ | |a I:(DE-Juel1)VDB62 |
| 980 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| 980 | _ | _ | |a UNRESTRICTED |
| 981 | _ | _ | |a I:(DE-Juel1)JSC-20090406 |
| Library | Collection | CLSMajor | CLSMinor | Language | Author |
|---|