Add to ORKGA standard trick in integer programming is to replace bounded integer variables with binary variables, using a bit representation. In a previous paper, we showed that this process can be used to improve linear programming relaxations of mixed-integer quadratic programs. In this paper, we show that it can also be used to improve {\em semidefinite}\/ programming relaxations
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
International audienceThe class of mixed-integer quadratically constrained quadratic programs (QCQP)...
A standard trick in integer programming is to replace bounded integer variables with binary variabl...
It is well known that, under certain conditions, one can use bit representation to transform both in...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
In the literature on the quadratic 0-1 knapsack problem, several alternative ways have been given to...
We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-...
International audienceIn this paper we introduce new semidefinite programming relaxations to box-con...
We model the cardinality-constrained portfolio problem using semidefinite matrices and investigate a...
International audienceQuadratic programming problems have received an increasing amount of attention...
In recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very ...
International audienceLet (QP) be a mixed integer quadratic program that consists of minimizing a qu...
This thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic ass...
We survey some of the recently developed Semidefinite Programming (SDP) approaches and results for q...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
International audienceThe class of mixed-integer quadratically constrained quadratic programs (QCQP)...
A standard trick in integer programming is to replace bounded integer variables with binary variabl...
It is well known that, under certain conditions, one can use bit representation to transform both in...
It is well known that semidefinite programming (SDP) can be used to derive useful relaxations for a ...
In the literature on the quadratic 0-1 knapsack problem, several alternative ways have been given to...
We study mixed-integer programming (MIP) relaxation techniques for the solution of non-convex mixed-...
International audienceIn this paper we introduce new semidefinite programming relaxations to box-con...
We model the cardinality-constrained portfolio problem using semidefinite matrices and investigate a...
International audienceQuadratic programming problems have received an increasing amount of attention...
In recent years, the semidefinite relaxation (SDR) technique has been at the center of some of very ...
International audienceLet (QP) be a mixed integer quadratic program that consists of minimizing a qu...
This thesis looks at the solution techniques of two NP-hard, large scale problems, the quadratic ass...
We survey some of the recently developed Semidefinite Programming (SDP) approaches and results for q...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
International audienceThe class of mixed-integer quadratically constrained quadratic programs (QCQP)...