Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM

@article{Brngger1998SolvingLQ,
  title={Solving Large-Scale QAP Problems in Parallel with the Search Library ZRAM},
  author={Adrian Br{\"u}ngger and Ambros Marzetta and Jens Clausen and Michael Perregaard},
  journal={J. Parallel Distrib. Comput.},
  year={1998},
  volume={50},
  pages={157-169}
}
Program libraries are one tool to make the cooperation between specialists from various fields successful: the separation of application-specific knowledge from application-independent tasks ensures portability, maintenance, extensibility, and flexibility. The current paper demonstrates the success in combining problemspecific knowledge for the quadratic assignment problem (QAP) with the raw computing power offered by contemporary parallel hardware by using the library of parallel search… CONTINUE READING
17 Citations
11 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-10 of 11 references

Joining forces in solving large-scale QAP in parallel, in “Proceedings of IPPS ’97, 11

  • A. Brüngger, A. Marzetta, J. Clausen, M. Perregaard
  • IEEE International Parallel Processing Symposium…
  • 1997

Solving large job shop scheduling problems in parallel, [ Ann

  • M. Perregaard, J. Clausen
  • Oper. Res. , to appear.] Received April 1,
  • 1997

BOB: a unified platform for implementing branch-and-bound like algorithms, Tech

  • B. Le Cun, C. Roucairol
  • Report 95/16, Laboratoire PRiSM, Universite de…
  • 1995
1 Excerpt

A branch-and-bound-based heuristic for solving the quadratic assignment problem,Naval

  • M. S. Bazaraa, O. Kirca
  • Res. Logist
  • 1983
1 Excerpt

Estimating the E  ciency of Backtrack Programs

  • C. Roucairol Mautor
  • Math . Comp .
  • 1975

Similar Papers

Loading similar papers…