We present an algorithm for a mixed set covering/partitioning model that includes as special cases the well-known set covering problem and set partitioning problem. The novel feature of our algorithm is the use of continuous heuristics applied to the dual of the linear programming relaxation to...

We consider a capital budgeting problem in which each potential project requires the performance of a known set of activities. In general, these sets of activities are not mutually exclusive. However, when a particular activity is common to the requirements of multiple projects, a single...

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