A systolic algorithm for solving knapsack problems

DOI10.1080/00207169408804335MaRDI QIDQ4844566zbMATH OpenOpenAlexFDO

Authors Chau-Jy Lin, Sheue-Jiau Chen

Publication date 27 August 1995

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/00207169408804335

zbMATH Keywords

0/1-knapsack problemssystolic algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Cellular automata (computational aspects) (68Q80) Distributed algorithms (68W15) Hardware implementations of nonnumerical algorithms (VLSI algorithms, etc.) (68W35) Combinatorial optimization (90C27) Dynamic programming (90C39) Abstract computational complexity for mathematical programming problems (90C60)

Recommendations

• scientific article; zbMATH DE number 150456
• scientific article; zbMATH DE number 4023019
• Parallel Algorithms for Knapsack Type Problems
• A parallel two-list algorithm for the knapsack problem
• A new algorithm for the integer knapsack problem and its parallelization

Cites work

• A parallel algorithm for generating combinations
• Efficient systolic algorithm for finding bridges in a connected graph
• Parallel generation of permutations on systolic arrays
• Solution of dense linear systems on an optimal systolic architecture
• Systolic algorithms

Cited in

(5)

• A systolic algorithm for dynamic programming
• A systolic simplex algorithm
• Systolic algorithms for the dynamic programming problem
• scientific article; zbMATH DE number 150456 (Why is no real title available?)
• Parallel Algorithms for Knapsack Type Problems

This page was built for publication: A systolic algorithm for solving knapsack problems

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