% IMPORTANT: The following is UTF-8 encoded.  This means that in the presence
% of non-ASCII characters, it will not work with BibTeX 0.99 or older.
% Instead, you should use an up-to-date BibTeX implementation like “bibtex8” or
% “biber”.

@ARTICLE{Gurke:811184,
      author       = {Gurke, Renate},
      title        = {{T}he approximate solution of the {E}uclidean traveling
                      salesman problem on a {CRAY} {X}-{MP}},
      journal      = {Parallel computing},
      volume       = {8},
      number       = {1-3},
      issn         = {0167-8191},
      address      = {Amsterdam [u.a.]},
      publisher    = {North-Holland, Elsevier Science},
      reportid     = {FZJ-2016-03693},
      pages        = {177 - 183},
      year         = {1988},
      abstract     = {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.},
      cin          = {ZAM / JSC},
      ddc          = {004},
      cid          = {I:(DE-Juel1)VDB62 / I:(DE-Juel1)JSC-20090406},
      pnm          = {899 - ohne Topic (POF3-899)},
      pid          = {G:(DE-HGF)POF3-899},
      typ          = {PUB:(DE-HGF)16},
      UT           = {WOS:A1988R035300019},
      doi          = {10.1016/0167-8191(88)90122-6},
      url          = {https://juser.fz-juelich.de/record/811184},
}