"Scalable parallel algorithms for difficult combinatorial problems: A case ..."

Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag (2004)

> Home

Details and statistics

DOI: —

access: unavailable

type: Conference or Workshop Paper

metadata version: 2006-11-08

- no documents available
- export record
  dblp key:
  - conf/pdcn/Abu-KhzamLS04
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/conf/pdcn/Abu-KhzamLS04
Faisal N. Abu-Khzam, Michael A. Langston, Pushkar Shanbhag:
Scalable parallel algorithms for difficult combinatorial problems: A case study in optimization. Parallel and Distributed Computing and Networks 2004: 649-654

a service of

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.