Karsu, ÖzlemAzizoglu, M.2020-01-282020-01-2820190305-0548http://hdl.handle.net/11693/52865In this study, we consider an assignment problem with the objective to minimize the sum of squared loads over all agents. We provide mixed integer nonlinear and linear programming formulations of the problem and present a branch and bound algorithm for their solution. The results of our computational experiment have shown the satisfactory behavior of our branch and bound algorithm.EnglishAssignment problemSquared loadBranchBoundAn exact algorithm for the minimum squared load assignment problemArticle10.1016/j.cor.2019.02.011