.png){kind=icon}
返回
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}
分享.png){kind=icon}
收藏
摘要
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.
Keyword:
Assignment problem
Squared load
Branch
Bound
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
Modification of cellulose model surfaces by cationic polymer latexes prepared by RAFT-mediated surfactant-free emulsion polymerization.png)
Polym. Chem.OAAI
Polym. Chem.IF0
OAAI分享收藏
Immunomodulatory Screening Test of Corn Oil Administered Orally to Female Mice: Effect of Timing of Dosing Within 24 Hours口服给予雌性小鼠玉米油的免疫调节筛选试验：24小时内给药时间的影响
PREAI
分享收藏Reducing physical ergonomic risks at assembly lines by line balancing and job rotation: A surveyOAAI
OAAI分享收藏分享收藏
查看更多内容