An Algorithm for the 0-1 Equality Knapsack Problem

DOI10.1057/JORS.1988.175MaRDI QIDQ3815132zbMATH OpenOpenAlexFDO

Authors Balasubramanian Ram, Sanjiv Sarin

Publication date 1988

Published in The Journal of the Operational Research Society (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1057/jors.1988.175

zbMATH Keywords

branch and boundequality knapsack problemrandomly generated test problems

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Linear programming (90C05) Boolean programming (90C09) Integer programming (90C10)

Recommendations

• The zero-one knapsack problem with equality constraint
• scientific article; zbMATH DE number 2130001
• A solution method for a knapsack problem and its variant
• A New Algorithm for the 0-1 Knapsack Problem
• Dynamic Programming and Strong Bounds for the 0-1 Knapsack Problem

Cited in

(8)

• The zero-one knapsack problem with equality constraint
• On the Dietrich-Escudero approach for solving the \(0-1\) knapsack problem with a \(0-1\) objective function
• On the solution of concave knapsack problems
• scientific article; zbMATH DE number 5733022 (Why is no real title available?)
• A Minimal Algorithm for the 0-1 Knapsack Problem
• scientific article; zbMATH DE number 1754727 (Why is no real title available?)
• scientific article; zbMATH DE number 2086933 (Why is no real title available?)
• scientific article; zbMATH DE number 2119958 (Why is no real title available?)

This page was built for publication: An Algorithm for the 0-1 Equality Knapsack Problem

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