scientific article; zbMATH DE number 4152148

MaRDI QIDQ3481489zbMATH OpenFDO

Authors Paulo R. C. Villela, Cláudio Thomaz Bornstein

Publication date 1988

zbMATH Keywords

branch-and-boundDantzig's upper bound

Mathematics Subject Classification ID

Computational methods for problems pertaining to operations research and mathematical programming (90-08) Boolean programming (90C09)

Recommendations

• scientific article; zbMATH DE number 432989
• A New Algorithm for the 0-1 Knapsack Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• Upper Bounds and Algorithms for Hard 0-1 Knapsack Problems
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem

Cited in

(8)

• scientific article; zbMATH DE number 5733022 (Why is no real title available?)
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem
• The knapsack problem with generalized upper bounds
• Lower Bounds on Time-Accuracy Trade-Offs for the 0-1 Knapsack Problem
• A note on 0.5-bounded greedy algorithms for the 0/1 knapsack problem
• scientific article; zbMATH DE number 7561569 (Why is no real title available?)
• A simple 0.5-bounded greedy algorithm for the 0/1 knapsack problem
• Improved Exponential Time Lower Bound of Knapsack Problem Under BT Model

This page was built for publication:

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