A compact variant of the QCR method for quadratically constrained quadratic 0–1 programs

L Galli, AN Letchford - Optimization Letters, 2014 - Springer
Abstract Quadratic Convex Reformulation (QCR) is a technique that was originally proposed
for quadratic 0–1 programs, and then extended to various other problems. It is used to …

Semidefinite relaxation for two mixed binary quadratically constrained quadratic programs: algorithms and approximation bounds

Z Xu, MY Hong - Journal of the Operations Research Society of China, 2016 - Springer
This paper develops new semidefinite programming (SDP) relaxation techniques for two
classes of mixed binary quadratically constrained quadratic programs and analyzes their …

[PDF][PDF] Programmation Mathématique en variables entières: théorie et applications

D Quadri - 2015 - inria.hal.science
Mes activités de recherche portent, d'une part, sur le développement de nouvelles
formulations et techniques de résolution adaptéesa des programmes mathématiques non …

[PDF][PDF] A compact variant of the qcr method for 0-1 quadratically constrained quadratic programs

L Galli, AN Letchford - 2013 - compass2.di.unipi.it
Abstract Quadratic Convex Reformulation (QCR) is a technique that was originally proposed
for 0-1 quadratic programs, and then extended to various other problems. It is used to …

Semidefinite approximation bound for a class of nonhomogeneous nonconvex quadratically constrained quadratic programming problem

Z Xu, S Tao, K Lou - Optimization Letters, 2019 - Springer
In this paper, we consider a class of nonconvex nonhomogeneous quadratically constrained
quadratic optimization problem. We derive some sufficient condition for the input data, and …

[引用][C] Extending the QCR method to mixed-integer quadratically constrained programs

L Galli, AN Letchford - Submitted to Math. Program, 2012