Fakultät für Informatik - Technische Universität München Lehrstuhl für Effiziente Algorithmen

Die bibliographische Datenbank LEABib

Suchen • Liste der Journale • Liste der Serien • Liste der Konferenzen • Ausgewählte Publikationen [2]	Hilfe

Suche: Series=LNCS AND Volume=980

• Parallel search for combinatorial optimization: Genetic algorithms, simulated annealing, tabu search and GRASP
  P.M. Pardalos, L. Pitsoulis, T. Mavridou, M.G.C. Resende
  Lecture Notes in Computer Science 980, 1995, pp. 317-331
• Better algorithms for parallel backtracking
  Peter Sanders
  Lecture Notes in Computer Science 980, 1995, pp. 333-347
• Parallel game tree search on SIMD machines
  Holger Hopp, Peter Sanders
  Lecture Notes in Computer Science 980, 1995, pp. 349-361
• Asynchronous parallel branch and bound and anomalies
  A. de Bruin, G.A.P. Kindervater, H.W.J.M. Trienekens
  Lecture Notes in Computer Science 980, 1995, pp. 363-377
• Fast priority queues for parallel branch-and-bound
  Peter Sanders
  Lecture Notes in Computer Science 980, 1995, pp. 379-393
• A parallel formulation for general branch-and bound algorithms
  Ricardo Corrêa
  Lecture Notes in Computer Science 980, 1995, pp. 395-409