An algorithm for the continuous variable upper bound knapsack problem

MaRDI QIDQ1108930zbMATH OpenFDO

Authors Robert L. Bulfin

Publication date 1988

Published in Opsearch (Search for Journal in Brave)

zbMATH Keywords

knapsack problemsmachine loadingpolynomial algorithm

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Deterministic scheduling theory in operations research (90B35) Linear programming (90C05) Integer programming (90C10) Combinatorial optimization (90C27)

Review text

This paper presents a polynomial algorithm for a class of knapsack problems where some of the problem variables serve as bounds on other problem variables. The author applies this algorithm to the machine loading problem.

Recommendations

• An algorithm for solving a class of knapsack problems and its generalization
• An exact algorithm for large unbounded knapsack problems
• On the continuous quadratic knapsack problem
• A new lower bound for the linear knapsack problem with general integer variables
• scientific article; zbMATH DE number 4093178

Cited in

(5)

• Variable fixing method by weighted average for the continuous quadratic knapsack problem
• A linear-time algorithm for solving continuous maximin knapsack problems
• scientific article; zbMATH DE number 6263683 (Why is no real title available?)
• A new lower bound for the linear knapsack problem with general integer variables
• Variable fixing algorithms for the continuous quadratic Knapsack problem

This page was built for publication: An algorithm for the continuous variable upper bound knapsack problem

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