A systolic algorithm for solving knapsack problems

DOI10.1080/00207169408804335zbMath0831.90098OpenAlexW1977515275MaRDI QIDQ4844566

Sheue-Jiau Chen, Chau-Jy Lin

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

systolic algorithm0/1-knapsack problems

Mathematics Subject Classification ID

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

Cites Work

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

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