scientific article; zbMATH DE number 5026927

zbMATH Open1108.90035MaRDI QIDQ5469596FDOQ5469596

Authors: Jun Pan, KenLi Li, Q. H. Li 

Publication date: 26 May 2006

Title of this publication is not available (Why is that?)

Recommendations

• An improved parallel algorithm for 0/1 knapsack problem
• A parallel two-list algorithm for the knapsack problem
• scientific article; zbMATH DE number 2075843
• A combined parallel algorithm for solving the knapsack problem
• A new algorithm for the integer knapsack problem and its parallelization
• Parallel Algorithms for Knapsack Type Problems
• Approximate algorithms for the Knapsack problem on parallel computers
• An efficient parallel algorithm for solving the knapsack problem on hypercubes

zbMATH Keywords

parallel algorithmNP-hardhardware-time tradeoff

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Abstract computational complexity for mathematical programming problems (90C60)

Cited In (4)

• The two list algorithm for the knapsack problem on an FPS T20
• A parallel time-memory-processor tradeoff \(O(2^{5n/6})\) for knapsack-like NP-complete problems
• Title not available (Why is that?)
• Comments on parallel algorithms for the knapsack problem.

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5469596)