The efficiency enhanced branch and bound algorithm for the knapsack model

MaRDI QIDQ3639649zbMATH OpenFDO

Authors Elias Munapo

Publication date 23 October 2009

Full work available at URL http://www.ripublication.com/Volume/aamav3n1.htm

zbMATH Keywords

Gomory cut and branch and boundknapsack modelsimplex method

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)

Recommendations

• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
• A new bound for the quadratic knapsack problem and its use in a branch and bound algorithm
• The use of duality to increase the effectiveness of the branch and bound method when solving the knapsack problem
• scientific article; zbMATH DE number 4093178
• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems

Cited in

(5)

• Knapsack constraint reformulation: A new approach that significantly reduces the number of sub-problems in the branch and bound algorithm
• Ring theory-based improved monkey algorithm for bounded knapsack problem
• Core accelerated firefly algorithm for solving bounded knapsack problem
• Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model
• Experimental investigations of combined algorithms of branch and bound method and dynamic programming method for knapsack problems

This page was built for publication: The efficiency enhanced branch and bound algorithm for the knapsack model

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