@techreport{TR-DCC-95-18,
  number = {DCC-95-18},
  author = {Rodrigues, Rosiane F. and de Souza, Pedro S.},
  title = {{Asynchronous Teams}: {A} Multi-Algorithm Approach for Solving Combinatorial Multiobjective Optimization Problems},
  month = {November},
  year = {1995}, 
  institution = {Department of Computer Science, University of Campinas},
  note = {In English, 11 pages.
    \par\selectlanguage{english}\textbf{Abstract}
      The fundamental question in solving multi-objective function
      problems lays in the determination of solutions that would best
      meet all the objectives involved.  The aim of this work is to
      present {\em Asynchronous Teams} (or {\em A-Teams}) as an
      appropriate method to detect this set of solutions for
      combinatorial problems. A-Teams basic principle is the
      asynchronous cooperation among a set of heuristic algorithms in
      order to produce better solutions than those obtained using each
      algorithm separately.  As an example of a combinatorial
      multiobjective function problem we propose a generalization of the
      classical Traveling Salesman Problem for several distance
      matrices, named {\em Multi-Distance Traveling Salesman Problem}
      (or {\em MDTSP}).
  }
}