A new algorithm for the integer knapsack problem and its parallelization

DOI10.1007/BF02568586zbMath0853.90087OpenAlexW2073728218MaRDI QIDQ1919114

C. Rodríguez, F. Almeida, F. García, J. L. Roda, D. G. Morales

Publication date: 1 August 1996

Published in: Top (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02568586

zbMATH Keywords

sequential algorithmtransputer networklocal area networkinteger knapsack problem

Mathematics Subject Classification ID

Integer programming (90C10) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39) Parallel numerical computation (65Y05)

Cites Work

• An improved parallel algorithm for 0/1 knapsack problem
• Partitioning and Mapping Algorithms into Fixed Size Systolic Arrays
• Communicating sequential processes
• Multistage Cutting Stock Problems of Two and More Dimensions
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A new algorithm for the integer knapsack problem and its parallelization