An efficient compact quadratic convex reformulation for general integer quadratic programs

ISSN： 0926-6003

Source： Computational Optimization and Applications, Vol.54, Iss.1, 2013-01, pp. : 141-162

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

A Note on Convex Reformulation Schemes for Mixed Integer Quadratic Programs

By Newby Eric Ali M.

Journal of Optimization Theory and Applications, Vol. 160, Iss. 2, 2014-02 ,pp. : 457-469

Springer Publishing Company

Access to resources Recommend Favorite

An Efficient Algorithm for Solving Convex–Convex Quadratic Fractional Programs

By Yamamoto R. Konno H.

Journal of Optimization Theory and Applications, Vol. 133, Iss. 2, 2007-05 ,pp. : 241-255

Springer Publishing Company

Access to resources Recommend Favorite

Using quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints

By Bai Lijie Mitchell John Pang Jong-Shi

Optimization Letters, Vol. 8, Iss. 3, 2014-03 ,pp. : 811-822

Springer Publishing Company

Access to resources Recommend Favorite

Convex quadratic relaxations of nonconvex quadratically constrained quadratic programs

By Mitchell John E. Pang Jong-Shi Yu Bin

Optimization Methods and Software, Vol. 29, Iss. 1, 2014-01 ,pp. : 120-136

Taylor & Francis Ltd

Access to resources Recommend Favorite

Perturbing the Dual Feasible Region for Solving Convex Quadratic Programs

By Fang S.C. Tsao H.S.J.

Journal of Optimization Theory and Applications, Vol. 94, Iss. 1, 1997-07 ,pp. : 73-85

Springer Publishing Company

Access to resources Recommend Favorite