Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization

Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag. Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. In M. H. Hamza, editor, Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004. pages 649-654, IASTED/ACTA Press, 2004.

@inproceedings{Abu-KhzamLS04,
  title = {Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization},
  author = {Faisal N. Abu-Khzam and Michael A. Langston and Pushkar Shanbhag},
  year = {2004},
  tags = {optimization, case study},
  researchr = {https://researchr.org/publication/Abu-KhzamLS04},
  cites = {0},
  citedby = {0},
  pages = {649-654},
  booktitle = {Proceedings of the IASTED International Conference on Parallel and Distributed Computing and Networks, Innsbruck, Austria, February 17-19, 2004},
  editor = {M. H. Hamza},
  publisher = {IASTED/ACTA Press},
}