运筹学中的指派问题
On the Assigning Problem in Operation Research

作者: 赵天骁 :清华大学数学科学系,北京; 晁福刚 :华东师范大学数学系,上海; 任韩 :华东师范大学数学系,上海;上海市核心数学与实践重点实验室,上海;

关键词: 运筹学指派问题单纯形算法Operation Research Assigning Problem Simplicial Algorithm

摘要: 详细给出指派问题的定性刻化,同时提供一个可行算法,有效计算指派问题的最优解。在日常生活中会遇到类似的问题,需要用指派问题进行解决,使得完成任务的总效率最高,就需要用指派问题进行解决。由于是0-1问题,所以总能求的相对最优解。

Abstract: In this paper, we characterize the assigning problem and present an algorithm to compute the op-timal solutions efficiently. In our everyday life, such problems are always needed to use assigning methods to give a good solution. Since they are 0-1 problem, we may find relative optimal solutions.

文章引用: 赵天骁 , 晁福刚 , 任韩 (2016) 运筹学中的指派问题。 应用数学进展, 5, 45-50. doi: 10.12677/AAM.2016.51007

参考文献

[1] Athanasiou, E. (2013) A Solomonic Solution to the Problem of Assigning a Private Indivisible Good. Games and Economic Behavior, 82, 369-387.
http://dx.doi.org/10.1016/j.geb.2013.07.007

[2] Bastianoni, S., Pulselli, F.M. and Tiezzi, E. (2004) The Problem of Assigning Responsibility for Greenhouse Gas Emissions. Ecological Economics, 49, 253-257.
http://dx.doi.org/10.1016/j.ecolecon.2004.01.018

[3] 田丰, 马仲蕃. 图与网络流理论[M]. 北京: 科学出版社, 1987.

[4] 钱颂迪. 运筹学[M]. 北京: 清华大学出版社, 1997.

分享
Top