We describe a branch and bound algorithm for the generalized assignment problem in which bounds are obtained from a Lagrangian relaxation with the multipliers set by a heuristic adjustment method. The algorithm was tested on a large sample of small random problems and a number of large problems...

We consider a competitive version of the traditional aggregate production planning model with capacity constraints. In the general case, multiple products are produced by a few competing producers (oligopoly) with limited capacities. Production quantities, prices and consequently profits depend...