Upper bounds for large scale integer quadratic multidimensional knapsack problems

MaRDI QIDQ5447757zbMATH OpenFDO

Authors Dominique Quadri, Éric Soutif, Pierre Tolla

Publication date 20 March 2008

zbMATH Keywords

surrogate relaxation

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06) Integer programming (90C10) Quadratic programming (90C20) Combinatorial optimization (90C27)

Recommendations

• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• The quadratic knapsack problem -- a survey
• A new upper bound for the 0-1 quadratic knapsack problem
• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem

Cited in

(9)

• A surrogate relaxation based algorithm for a general quadratic multi- dimensional knapsack problem
• A new upper bound for the multiple knapsack problem
• Improving an exact approach for solving separable integer quadratic knapsack problems
• On The Strength Of Relaxations Of Multidimensional Knapsack Problems
• A tight upper bound for quadratic knapsack problems in grid-based wind farm layout optimization
• Completely positive and copositive program modelling for quadratic optimization problems
• Reformulation of the quadratic multidimensional knapsack problem as copositive/completely positive programs
• A Branch-and-Bound Algorithm to Solve Large Scale Integer Quadratic Multi-Knapsack Problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems

This page was built for publication: Upper bounds for large scale integer quadratic multidimensional knapsack problems

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