The quadratic multiple knapsack problem (QMKP) consists in assigning a set of objects, which interact through paired profit values, exclusively to different capacity-constrained knapsacks with the aim of maximising total profit. Its many applications include the assignment of workmen to...

Some straightforward but unconventional strategies are proposed for implementing branch and bound methods. These include 'shrinking' the branch and bound tree and instituting 'branch reversals' by reference to the notion of the relative influence of particular branches in the current solution....

Over a long and remarkably productive career, Professor William W. (Bill) Cooper has made many pioneering contributions to Operations Research and Management Science (OR/MS), with notable forays into the areas of (a) linear and non-linear programming, (b) goal programming, (c) chance-constrained...

The paper describes a procedure for mixed integer programming that allows branches to be imposed 'by degrees', which can subsequently be revised or weeded out according to their relative influence. It is an adaptive approach in which the branch and bound tree can be manipulated and restructured....