Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

8

IPPS
1997
IEEE

favoriteEmaildiscussreport

109views Distributed And Parallel Com...» more IPPS 1997»

An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube

13 years 8 months ago

An Efficient Parallel Algorithm for Solving the Knapsack Problem on the Hypercube

Download ipdps.cc.gatech.edu

Alfredo Goldman, Denis Trystram

Real-time Traffic

Distributed And Parallel Computing | IPPS 1997 |

claim paper

Related Content

» Solving a 2D Knapsack Problem on an Associative Computer Augmented with a Linear Network

» Approximate and exact algorithms for the fixedcharge knapsack problem

» An efficient approximation for the Generalized Assignment Problem

» A Practical Efficient Fptas for the 01 Multiobjective Knapsack Problem

» An Evaluation of Parallel Knapsack Algorithms on Multicore Architectures

» Oblivious DeadlockFree Routing in a Faulty Hypercube

» A BranchandPrice Algorithm for the Multilevel Generalized Assignment Problem

» A Performance Model of Speculative Prefetching in Distributed Information Systems

» Probabilistic analysis of knapsack core algorithms

Post Info
More Details (n/a)

Added	06 Aug 2010
Updated	06 Aug 2010
Type	Conference
Year	1997
Where	IPPS
Authors	Alfredo Goldman, Denis Trystram

Comments (0)