Lecture notes in computer science

Separable Non-convex Underestimators for Binary Quadratic Programming

Christoph Buchheim, Emiliano Traversi

Published Jan 1, 2013• 8 citations

Related papers

Convex reformulation for binary quadratic programming problems via average objective value maximization

Cheng Zhu Lu, Xiaoling Guo

Quadratic convex reformulation for nonconvex binary quadratically constrained quadratic programming via surrogate constraint

Xiaojin Zheng, Yutong Pan, Xueting Cui

Quadratic Convex Reformulations for MultiObjective Binary Quadratic Programming

Marianna De Santis, Lucas Létocart, Yue Zhang

Quadratic Convex Reformulations for MultiObjective Binary Quadratic Programming

Quadratic convex reformulations for quadratic 0–1 programming

Marie-Christine Plateau

Semidefinite Programming Based Convex Relaxation for Nonconvex Quadratically Constrained Quadratic Programming

Rujun Jiang, Duan Li

Quadratic Convex Reformulations for Integer and Mixed-Integer Quadratic Programs

Baiyi Wu, Rujun Jiang