AbstractThere is a class of assignment problems where the cost function depends on the assignment of pairs of variables. A method of finding the optimum solution by a systematic exploration of a limited part of the solution space is presented by means of a numerical example. It is not possible to give a formula for the length of the computation since this will depend on the actual costs of the particular problem being solved.