An algorithm for the continuous variable upper bound knapsack problem

zbMATH Open0654.90057MaRDI QIDQ1108930FDOQ1108930

Authors: Robert L. Bulfin 

Publication date: 1988

Published in: Opsearch (Search for Journal in Brave)

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

zbMATH Keywords

polynomial algorithmknapsack problemsmachine loading

Mathematics Subject Classification ID

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

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
• Title not available (Why is that?)
• Variable fixing algorithms for the continuous quadratic Knapsack problem
• A new lower bound for the linear knapsack problem with general integer variables

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)