Add to ORKGThe computational performance of inductive linearizations for binary quadratic programs in combination with a mixed-integer programming solver is investigated for several combinatorial optimization problems and established benchmark instances. Apparently, a few of these are solved to optimality for the first time
In this paper, the compact linearization approach originally proposed for binary quadratic programs ...
International audienceQuadratic programming problems have received an increasing amount of attention...
National audienceAbstract. In this paper we consider the mixed integer general quadratic problem (MI...
A linearization technique for binary quadratic programs (BQPs) that comprise linear constraints is p...
This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied...
We perform a theoretical and computational study of the classical linearisation techniques (LT) and ...
- Let (QP) be an integer quadratic program that consists in minimizing a quadratic function subject ...
We provide several applications of the linearization problem of a binary quadratic problem. We propo...
We consider binary quadratic programs (QP) having a quadratic objectivefunction, linear constraints...
This paper addresses the solution of a nonlinear boolean quadratic programming problem using three d...
AbstractWe present a linearization strategy for mixed 0-1 quadratic programs that produces small for...
In this paper it is shown that the compact linearization approach, that has been previously proposed...
We introduce and prove new necessary and sufficient conditions to carry out a compact linearization ...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
Very large nonlinear unconstrained binary optimization problems arise in a broad array of applicati...
In this paper, the compact linearization approach originally proposed for binary quadratic programs ...
International audienceQuadratic programming problems have received an increasing amount of attention...
National audienceAbstract. In this paper we consider the mixed integer general quadratic problem (MI...
A linearization technique for binary quadratic programs (BQPs) that comprise linear constraints is p...
This paper is concerned with binary quadratic programs (BQPs), which are among the most well-studied...
We perform a theoretical and computational study of the classical linearisation techniques (LT) and ...
- Let (QP) be an integer quadratic program that consists in minimizing a quadratic function subject ...
We provide several applications of the linearization problem of a binary quadratic problem. We propo...
We consider binary quadratic programs (QP) having a quadratic objectivefunction, linear constraints...
This paper addresses the solution of a nonlinear boolean quadratic programming problem using three d...
AbstractWe present a linearization strategy for mixed 0-1 quadratic programs that produces small for...
In this paper it is shown that the compact linearization approach, that has been previously proposed...
We introduce and prove new necessary and sufficient conditions to carry out a compact linearization ...
We reformulate a (indefinite) quadratic program (QP) as a mixed-integer linear programming (MILP) pr...
Very large nonlinear unconstrained binary optimization problems arise in a broad array of applicati...
In this paper, the compact linearization approach originally proposed for binary quadratic programs ...
International audienceQuadratic programming problems have received an increasing amount of attention...
National audienceAbstract. In this paper we consider the mixed integer general quadratic problem (MI...