@TechReport{cung94a,
  author =	 {V.~D. Cung and S. Dowaji and B. Le Cun and T. Mautor
                  and C. Roucairol},
  title =	 {Parallel and Distributed Branch-and-Bound/{A}*
                  Algorithms},
  institution =	 {Laboratoire {PRISM}, Universit\'{e} de Versailles},
  year =	 1994,
  number =	 {94/31},
  abstract =	 { In this report, we propose new concurrent data
                  structures and load balancing strategies for
                  Branch-and-Bound (B&B)/A* algorithms in two models
                  of parallel programming : shared and distributed
                  memory. For the shared memory model (SMM), we
                  present a general methodology which allows
                  concurrent manipulations for most tree data
                  structures, and show its usefulness for
                  implementation on multiprocessors with global shared
                  memory. Some priority queues which are suited for
                  basic operations performed by},
  keywords =     {distributed-search},
  citeseer =	 {cung94parallel.html},
  url = 	 {http://jmvidal.cse.sc.edu/library/cung94a.pdf}
}