.png){kind=icon}
返回
Sensitivity analysis for bottleneck assignment problems
.png){kind=icon}
OA
AI
DOI：10.1016/j.ejor.2022.02.037.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In assignment problems, decision makers are often interested in not only the optimal assignment, but also the sensitivity of the optimal assignment to perturbations in the assignment weights. Typically, only perturbations to individual assignment weights are considered. We present a novel extension of the tra-ditional sensitivity analysis by allowing for simultaneous variations in all assignment weights. Focusing on the bottleneck assignment problem, we provide two different methods of quantifying the sensitivity of the optimal assignment, and present algorithms for each. Numerical examples as well as a discussion of the complexity for all algorithms are provided. (c) 2022 Elsevier B.V. All rights reserved.
Keyword:
Assignment
Robustness and sensitivity analysis
Bottleneck
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6
论文数:
2.2W
被引数:
6.4W
机构
引用论文
.png){kind=icon}
Squatting Cycles in Barcelona: Identities, Repression and the Controversy of Institutionalisation
PREAI
分享收藏分享收藏A robust optimization solution to bottleneck generalized assignment problem under uncertainty不确定条件下瓶颈广义指派问题的鲁棒优化解
PREAI
分享收藏
查看更多内容