Quadratic convex reformulations for quadratic 0-1 programming

DOI10.1007/s10288-007-0044-6zbMath1151.90494OpenAlexW1998607366MaRDI QIDQ941006

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

quadratic programmingsemidefinite programmingexperimentsquadratic convex reformulation

Mathematics Subject Classification ID

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

Related Items (1)

Dantzig-Wolfe reformulations for binary quadratic problems

Cites Work

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

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