.png){kind=icon}
.png){kind=icon}
Return
An exact algorithm for the minimum squared load assignment problem
.png){kind=icon}
OA
AI
DOI：10.1016/j.cor.2019.02.011.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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. (C) 2019 Elsevier Ltd. All rights reserved.
Keywords:
Assignment problem
Squared load
Branch
Bound
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
C
IF:
4.3
Papers:
6.5K
Citations:
1.8W