.png){kind=icon}
返回
Computing k different solutions to the assignment problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cie.2019.06.025.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Assignment problems are about the best way of matching the elements of a first set with the elements of a second set. In Semi-Assignment problems, more than one element of the first set can be assigned to each element of the second. In many situations, a solution to the same Assignment or Semi-Assignment problem has to be implemented more than once, and for a fairness reason it may not be desirable to always implement the same solution. Another common situation is when more than a single solution to the (Semi-)Assignment has to be generated, so as to give the decision maker a portfolio of options to choose in. This can happen because not all the problem constraints could be considered in the problem formulation, and the decision maker may want to choose between alternative solutions. In both cases, one is interested in defining several alternative solutions to the problem, still optimizing their cost. In this paper we discuss two specific situations for which we present optimization algorithms. The algorithms are computationally tested on a set of instances from the literature and from a real world application.
Keyword:
Assignment problems
Semi-assignment
Ranking solutions
Computational experiments
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.5
论文数:
1.0W
被引数:
3.8W
机构
引用论文
.png){kind=icon}
分享收藏分享收藏Hydrothermal preparation and low temperature magnetic properties of TbOOH, DyOOH, HoOOH, ErOOH, and YbOOHTbOOH，DyOOH，HoOOH，ErOOH和YbOOH的水热制备和低温磁性
PREAI
分享收藏 没有更多内容
没有更多内容