A rigorous method for solving 0-1 polynomial knapsack problem

MaRDI QIDQ3408762zbMATH OpenFDO

Authors Hongbo Sheng, Juan Sun, Xiaoling Sun

Publication date 15 November 2006

Mathematics Subject Classification ID

Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Boolean programming (90C09)

Recommendations

• An exact algorithm for 0-1 polynomial Knapsack problems
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• A new Lagrangian based branch and bound algorithm for the 0-1 knapsack problem
• \(0\)-\(1\) knapsack problems

Cited in

(2)

• An exact algorithm for 0-1 polynomial Knapsack problems
• scientific article; zbMATH DE number 1754727 (Why is no real title available?)

This page was built for publication: A rigorous method for solving 0-1 polynomial knapsack problem

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