Quadratic convex reformulations for quadratic 0-1 programming

DOI10.1007/S10288-007-0044-6MaRDI QIDQ941006zbMATH OpenOpenAlexFDO

Authors Marie-Christine Plateau

Publication date 4 September 2008

Published in 4OR (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s10288-007-0044-6

zbMATH Keywords

experimentsquadratic convex reformulationquadratic programmingsemidefinite programming

Mathematics Subject Classification ID

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

Recommendations

• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
• Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Extending the QCR method to general mixed-integer programs

Cites work

• Pseudo-Boolean optimization
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Solving Graph Bisection Problems with Semidefinite Programming
• State-of-the-Art Survey—Constrained Nonlinear 0–1 Programming

Cited in

(16)

• Improving the performance of standard solvers for quadratic 0-1 programs by a tight convex reformulation: The QCR method
• Two new reformulation convexification based hierarchies for 0-1 MIPs
• Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint
• Combining QCR and CHR for convex quadratic pure 0--1 programming problems with linear constraints
• Solving unconstrained 0-1 polynomial programs through quadratic convex reformulation
• Dantzig-Wolfe reformulations for binary quadratic problems
• Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
• A compact variant of the QCR method for quadratically constrained quadratic 0-1 programs
• Constrained 0-1 quadratic programming: basic approaches and extensions
• Exact quadratic convex reformulations of mixed-integer quadratically constrained problems
• Quadratic 0–1 programming: Tightening linear or quadratic convex reformulation by use of relaxations
• Efficient Reduction of Polynomial Zero-One Optimization to the Quadratic Case
• Perspective Reformulations of Semicontinuous Quadratically Constrained Quadratic Programs
• scientific article; zbMATH DE number 7152114 (Why is no real title available?)
• Extended canonical duality and conic programming for solving 0-1 quadratic programming problems
• Quadratic convex reformulations for a class of complex quadratic programming problems

This page was built for publication: Quadratic convex reformulations for quadratic 0-1 programming

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