A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming

MaRDI QIDQ2950853zbMATH OpenFDO

Authors Peng Wang, Jian-Ling Li, Jinbao Jian

Publication date 9 October 2015

zbMATH Keywords

branch-and-boundLagrangian relaxationLagrangian dual boundindefinite quadratic integer programming

Mathematics Subject Classification ID

Quadratic programming (90C20) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Integer programming (90C10)

Recommendations

• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new branch and bound algorithm for indefinite integer quadratic programs
• A new branch-and-bound algorithm for indefinite quadratic programming problems
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming
• A new global optimization algorithm for indefinite quadratic programs

Cited in

(4)

• A new branch and bound algorithm for indefinite integer quadratic programs
• A new algorithm for finding global solution of indefinite quadratic programming problems
• A new branch-and-bound algorithm for indefinite quadratic programming problems
• Convex relaxation and Lagrangian decomposition for indefinite integer quadratic programming

This page was built for publication: A new algorithm based on Lagrangian relaxation for solving indefinite quadratic integer programming

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