A Closed-Form Solution To A Class Of Quadratic Knapsack Problems

DOI10.1080/03155986.1992.11732180MaRDI QIDQ4009107zbMATH OpenOpenAlexFDO

Authors Michael Magazine

Publication date 27 September 1992

Published in INFOR: Information Systems and Operational Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1080/03155986.1992.11732180

zbMATH Keywords

discrete optimizationbatchingbottlenecksdata base managementquadratic knapsack problems

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Deterministic scheduling theory in operations research (90B35) Integer programming (90C10) Database theory (68P15) Production models (90B30)

Recommendations

• A note on optimal solutions to quadratic knapsack problems
• Quadratic bottleneck knapsack problems
• Exact Solution of the Quadratic Knapsack Problem
• Integer quadratic knapsack problems
• An O(n) algorithm for quadratic knapsack problems

Cited in

(5)

• A note on optimal solutions to quadratic knapsack problems
• Quadratic bottleneck knapsack problems
• A Newton's method for the continuous quadratic knapsack problem
• The quadratic knapsack problem -- a survey
• Representations of quadratic combinatorial optimization problems: a case study using quadratic set covering and quadratic knapsack problems

This page was built for publication: A Closed-Form Solution To A Class Of Quadratic Knapsack Problems

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