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.
The Use of Ordinary Differential Equations in Quadratic Maximization with Integer Constraints
MAPONI, Pierluigi;
1996-01-01
Abstract
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.File in questo prodotto:
Non ci sono file associati a questo prodotto.
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
