We consider the estimation of a large number of GARCH models, of the order of several hundreds. To achieve parsimony, we classify the series in a small number of groups. Within a cluster, the series share the same model and the same parameters. Each cluster contains therefore similar series. We...

We investigate the problem of partitioning the nodes of a graph under capacity restriction on the sum of the node weights in each subset of the partition. The objective is to minimize the sum of the costs of the edges between the subsets of the partition. This problem has a variety of...

In this paper we consider the problem of k-partitioning the nodes of a graph with capacity restrictions on the sum of the node weights in each subset of the partition, and the objective of minimizing the sum of the costs of the edges between the subsets of the partition. Based on a study of...