Skip to main navigation Skip to search Skip to main content

PARALLEL APPROXIMATE ALGORITHMS FOR THE 0-1 KNAPSACK PROBLEM.

  • University of Maryland, College Park

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

6 Scopus citations

Fingerprint

Dive into the research topics of 'PARALLEL APPROXIMATE ALGORITHMS FOR THE 0-1 KNAPSACK PROBLEM.'. Together they form a unique fingerprint.
Sort by

Computer Science

Keyphrases