Solving multiple knapsack problems by cutting planes

In this paper ve consider the multiple knapsack problem, which is defined as follows: given a set N of items with weights f(i), i is an element of N, a set M of knapsacks with capacities F-k, k is an element of M, and a profit function c(ik),i is an element of N, k is an element of M, find an assignment of a subset of the set of items to the set of knapsacks that yields minimum cost. We consider the multiple knapsack problem from a polyhedral point of view. The inequalities that we describe here serve as the theoretical basis for a cutting plane algorithm. We present some of the implementation details of this algorithm, including a discussion and evaluation of different separation and primal heuristics. Our algorithm is applied to practical problem instances arising in the design of main frame computers, in the layout of electronic circuits, and in sugar cane alcohol production.