An exact algorithm for the minimum squared load assignment problem. (June 2019)

• Record Type: Journal Article
• Authors: Karsu, Özlem; Azizoglu, Meral
• Is Part Of: Computers & operations research. Volume 106(2019)
• Page Start: 76
• Page End: 90
• Publication Date: 2019-06
• Subjects: Assignment problem -- Squared load -- Branch -- Bound; Operations research -- Periodicals; Electronic digital computers -- Periodicals; 004.05
• DOI: 10.1016/j.cor.2019.02.011
• Languages: English
• ISSNs: 0305-0548

Abstract

Highlights: We study the minimum squared load assignment problem. We formulate the problem as a mixed integer linear programming model. We present a branch and bound algorithm for its solution. Our computational experiments show the satisfactory behavior of the algorithm. Abstract: In 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.