A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming

DOI10.1016/J.ENDM.2010.05.035MaRDI QIDQ2883573zbMATH OpenOpenAlexFDO

Authors Dominique Quadri, Éric Soutif

Publication date 13 May 2012

Published in Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.endm.2010.05.035

zbMATH Keywords

knapsack problemsinteger quadratic programminglinearization techniquesnon separable function

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Semidefinite programming (90C22) Integer programming (90C10)

Recommendations

• scientific article; zbMATH DE number 4199965
• Une borne optimale pour la programmation entière quasi-convexe
• A Tight Linearization and an Algorithm for Zero-One Quadratic Programming Problems
• A provable better Branch and Bound method for a nonconvex integer quadratic programming problem
• scientific article; zbMATH DE number 4064773
• An improved linearization technique for a class of quadratic 0-1 programming problems
• A semidefinite programming method for integer convex quadratic minimization
• scientific article; zbMATH DE number 1500161
• A quadratically convergent method for linear programming

Cites work

• A Branch and Bound Algorithm for Integer Quadratic Knapsack Problems
• A genetic algorithm for the multidimensional knapsack problem
• An enumerative algorithm framework for a class of nonlinear integer programming problems
• Exact solution method to solve large scale integer quadratic multidimensional knapsack problems
• Solution of large quadratic knapsack problems through aggressive reduction

This page was built for publication: A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming

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