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...

Caterpillar recently embarked on an ambitious program to radically change how it markets and sells key products of its Building Construction Products division (BCP). The goal was to move from a strict build-to-order strategy, in which customers selected one of millions of possible...