scientific article; zbMATH DE number 1500161

MaRDI QIDQ4501308zbMATH OpenFDO

Authors Wenxing Zhu, Liansheng Zhang

Publication date 4 September 2000

zbMATH Keywords

lower boundingconvex quadratic programming0-1 quadratic programming

Mathematics Subject Classification ID

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

Recommendations

• On lower bounds for a class of quadratic 0,1 programs
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Decomposition and linearization for 0-1 quadratic programming
• A continuous approch for globally solving linearly constrained quadratic
• A lower bound for a constrained quadratic \(0\)-\(1\) minimization problem

Cited in

(7)

• A roof linearization algorithm to obtain a tight upper bound for integer nonseparable quadratic programming
• An improved linearization strategy for zero-one quadratic programming problems
• A new penalty parameter for linearly constrained 0--1 quadratic programming problems
• Constrained 0-1 quadratic programming: basic approaches and extensions
• On lower bounds for a class of quadratic 0,1 programs
• A continuous approch for globally solving linearly constrained quadratic
• Improved compact linearizations for the unconstrained quadratic 0-1 minimization problem

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 Q4501308)