We consider the problem of maximizing a quadratic function on the set {-1,1}^n. This problem is related to some graph partitioning problems. We propose a path following method to compute an upper bound to the previous maximization problem. Numerical implementation of the proposed method and related numerical experience are presented
Let A be a real symmetric n x n-matrix with eigenvalues, lambda(1),..., lambda(n) ordered after decr...
We present a new heuristic for the global solution of box constrained quadratic problems, based on t...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
We consider the problem of maximizing a quadratic function on the set {-1,1}^n. This problem is rela...
In this paper the problem or maximizing a quadratic function defined in {-l, l}^n is considered. We ...
Consider the optimization (i.e. maximization or minimization) of a real valued function f defined o...
We present an approximation scheme for optimizing certain Quadratic Integer Program-ming problems wi...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We review Quadratic Convex Reformulation (QCR) for quadratic pro-grams with general integer variable...
This paper addresses itself to the maximization of a convex quadratic function subject to linear con...
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simp...
In this paper, we consider a class of quadratic maximization problems. One important instance in tha...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
Let A be a real symmetric n x n-matrix with eigenvalues, lambda(1),..., lambda(n) ordered after decr...
We present a new heuristic for the global solution of box constrained quadratic problems, based on t...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...
We consider the problem of maximizing a quadratic function on the set {-1,1}^n. This problem is rela...
In this paper the problem or maximizing a quadratic function defined in {-l, l}^n is considered. We ...
Consider the optimization (i.e. maximization or minimization) of a real valued function f defined o...
We present an approximation scheme for optimizing certain Quadratic Integer Program-ming problems wi...
We consider an integer program (QQP) where both the objective function and the constraints contain q...
We review Quadratic Convex Reformulation (QCR) for quadratic pro-grams with general integer variable...
This paper addresses itself to the maximization of a convex quadratic function subject to linear con...
A standard quadratic optimization problem (StQP) consists in minimizing a quadratic form over a simp...
In this paper, we consider a class of quadratic maximization problems. One important instance in tha...
SoumisNational audienceThis paper presents new semidefinite programming bounds for 0-1 quadratic pro...
We consider a general integer program (QQP) where both the objective function and the constraints ar...
This paper describes a method of minimizing a strictly convex quadratic functional of several variab...
Let A be a real symmetric n x n-matrix with eigenvalues, lambda(1),..., lambda(n) ordered after decr...
We present a new heuristic for the global solution of box constrained quadratic problems, based on t...
INTRODUCTION Let G = (V; E) be an undirected graph, where V = f1; \Delta \Delta \Delta ; ng is the ...