A General Algorithm for One-Dimensional Knapsack Problems

DOI10.1287/OPRE.25.5.752MaRDI QIDQ4162968zbMATH OpenOpenAlexFDO

Authors Giorgio P. Ingargiola, James F. Korsh

Publication date 1977

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.25.5.752

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Integer programming (90C10)

Cited in

(4)

• A randomized parallel branch-and-bound algorithm
• A reduction dynamic programming algorithm for the bi-objective integer knapsack problem
• Algorithms for the bounded set-up knapsack problem
• A minimal algorithm for the bounded knapsack problem

This page was built for publication: A General Algorithm for One-Dimensional Knapsack Problems

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