A belief propagation algorithm for 0-1 knapsack problem

DOI10.13705/J.ISSN.1671-6841.2020300MaRDI QIDQ4996576zbMATH OpenFDO

Authors

Publication date 1 July 2021

Full work available at URL https://doi.org/10.13705/J.ISSN.1671-6841.2020300

zbMATH Keywords

0-1 knapsack problembelief propagation algorithmfactor graphlinear programming

Mathematics Subject Classification ID

Approximation algorithms (68W25) Linear programming (90C05) Combinatorial optimization (90C27) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A New Algorithm for the 0-1 Knapsack Problem
• Based on a greedy strategy overall distribution optimization algorithm to solve 0-1 knapsack problem
• An improved genetic algorithm for solving 0-1 knapsack problems
• A knapsack-problem optimization algorithm based on complex network
• scientific article; zbMATH DE number 5951334

Cited in

(3)

• Solving 0-1 knapsack problems based on amoeboid organism algorithm
• A knapsack-problem optimization algorithm based on complex network
• scientific article; zbMATH DE number 6263318 (Why is no real title available?)

This page was built for publication: A belief propagation algorithm for 0-1 knapsack problem

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