A combined parallel algorithm for solving the knapsack problem

DOI10.1134/S1064230708040072zbMATH Open1180.90277OpenAlexW2024439802MaRDI QIDQ734010FDOQ734010

Authors: I. Kh. Sigal, M. A. Posypkin 

Publication date: 19 October 2009

Published in: Journal of Computer and Systems Sciences International (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1134/s1064230708040072

Recommendations

• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems
• A new algorithm for the integer knapsack problem and its parallelization
• Parallel-distribute realization of recursive algorithm for two-level many-dimensional knapsack problem
• Approximate algorithms for the Knapsack problem on parallel computers
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems

Mathematics Subject Classification ID

Parallel numerical computation (65Y05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27)

Cites Work

• Parallel Branch-and-Branch Algorithms: Survey and Synthesis
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (11)

• Load balancing methods and parallel dynamic programming algorithm using dominance technique applied to the 0-1 knapsack problem
• Parallel-distribute realization of recursive algorithm for two-level many-dimensional knapsack problem
• A parallel time/hardware tradeoff T.H=O(2/sup n/2/) for the knapsack problem
• Computational Science - ICCS 2004
• Title not available (Why is that?)
• Title not available (Why is that?)
• Experiments with parallel algorithms for combinatorial problems
• Approximate algorithms for the Knapsack problem on parallel computers
• Parallel computational optimization in operations research: a new integrative framework, literature review and research directions
• A Survey Of Parallel Algorithms For One-Dimensional Integer Knapsack Problems
• Investigation of algorithms of parallel computations in knapsack-type discrete optimization problems

This page was built for publication: A combined parallel algorithm for solving the knapsack problem

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