DOIAbstract
A solution procedure for linear programs with one convex quadratic constraint is suggested. The method finds an optimal solution in finitely many iterations
A solution procedure for linear programs with one convex quadratic constraint is suggested. The method finds an optimal solution in finitely many iterations
Let (MQP) be a general mixed-integer quadratic program that consists of minimizing a quadratic funct...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
We describe the simplest technique to tackle 0-1 Quadratic Programs with linear constraints among th...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
We discuss some basic concepts and present a numerical procedure for finding the minimum-norm soluti...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We investigate the use of linear programming tools for solving semidefinite programming relaxations ...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
We describe the simplest technique to tackle 0-1 Quadratic Programs with linear constraints among th...
International audienceIn order to solve more easily combinatorial optimization problems, one way is ...
This paper presents a new heuristic to linearise the convex quadratic programming problem. The usual...
The problem of determining whether quadratic programming models possess either unique or multiple op...
The problem of determining whether quadratic programming models possess either unique or multiple op...
Let (MQP) be a general mixed-integer quadratic program that consists of minimizing a quadratic funct...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
We describe the simplest technique to tackle 0-1 Quadratic Programs with linear constraints among th...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
We discuss some basic concepts and present a numerical procedure for finding the minimum-norm soluti...
In this paper, we present an effective algorithm for globally solving quadratic programs with quadra...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We investigate the use of linear programming tools for solving semidefinite programming relaxations ...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
We describe the simplest technique to tackle 0-1 Quadratic Programs with linear constraints among th...
International audienceIn order to solve more easily combinatorial optimization problems, one way is ...
This paper presents a new heuristic to linearise the convex quadratic programming problem. The usual...
The problem of determining whether quadratic programming models possess either unique or multiple op...
The problem of determining whether quadratic programming models possess either unique or multiple op...
Let (MQP) be a general mixed-integer quadratic program that consists of minimizing a quadratic funct...
Computational methods are considered for finding a point that satisfies the second-order necessary c...
We describe the simplest technique to tackle 0-1 Quadratic Programs with linear constraints among th...
Add to ORKG