scientific article; zbMATH DE number 1090093

MaRDI QIDQ4366593zbMATH OpenFDO

Authors Mohamed Ettaouil

Publication date 25 May 1998

zbMATH Keywords

0-1 quadratic knapsackbranch-and-boundconstraint satisfactionLagrangean heuristic

Mathematics Subject Classification ID

Boolean programming (90C09) Quadratic programming (90C20)

Recommendations

• Linear programming for the \(0-1\) quadratic knapsack problem
• A new upper bound for the 0-1 quadratic knapsack problem
• Constrained 0-1 quadratic programming: basic approaches and extensions
• An exact method based on Lagrangian decomposition for the 0-1 quadratic knapsack problem
• Exact Solution of the Quadratic Knapsack Problem

Cited in

(1)

• The quadratic 0-1 knapsack problem with series-parallel support

This page was built for publication:

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