A Branch Search Algorithm for the Knapsack Problem

DOI10.1287/MNSC.16.5.327zbMATH Open0191.48401OpenAlexW2066850897MaRDI QIDQ5585877FDOQ5585877

R. L. Hegerich, Harold Greenberg

Publication date: 1970

Published in: Management Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1287/mnsc.16.5.327

zbMATH Keywords

operations research

Cited In (20)

• An improved upper bound for the zero-one knapsack problem. A note on the paper by Martello and Toth
• A branch and bound algorithm for the generalized assignment problem
• An algorithm for the 0/1 Knapsack problem
• A linear-time algorithm for solving continuous maximin knapsack problems
• The Collapsing 0–1 Knapsack Problem
• A branch and search algorithm for a class of nonlinear knapsack problems
• An upper bound for the zero-one knapsack problem and a branch and bound algorithm
• Upper and lower bounds for the complexity of the branch and bound method for the knapsack problem
• Resolution of the 0–1 knapsack problem: Comparison of methods
• A o(n logn) algorithm for LP knapsacks with GUB constraints
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• An algorithm and efficient data structures for the binary knapsack problem
• Redundancy optimization by linear knapsack approach
• Local-search based heuristics for advertisement scheduling
• The zero-one knapsack problem with equality constraint
• A generalized knapsack problem with variable coefficients
• An algorithm for the solution of the 0-1 knapsack problem
• Dynamic programming algorithms for the zero-one knapsack problem
• Heuristics and their design: A survey
• The pure fixed charge transportation problem

This page was built for publication: A Branch Search Algorithm for the Knapsack Problem

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