吕梁学院数学与应用数学专业毕业论文设计.docVIP

学校代码 10812 分 类 号 O157 学 号 20080420122 吕梁学院 毕业论文（设计） 国际会议议程安排方案设计 系 别 数学系 专 业 数学与应用数学 姓 名 指导教师 职 称 助 教 日 期 2012年6月 国内图书分类号：O157 太原师范学院吕梁学院办学点 本科毕业论文 系 别 数学系 专 业 数学与应用数学 申请学位 学士学位 指导教师 职 称 助 教 日 期 2012年6月 摘 要 随着社会经济的发展,中外交流日益频繁,目前的国际学术会议种类有很多,规模也在逐渐变大,往往出席人数超过千人,会议场次超过百场,可能分多个专题小组,这就涉及到议程安排问题,因此自动化的会议议程安排优化问题就应运而生. 本文利用图论作为工具讨论了一般科技会议的议程安排问题,给出了议程确定的一些准则,并解决了会议议程安排中两个问题: (1) 同一时间片内的场次与会场的安排; (2) 专题小组参会人员的划分. 对于这两个问题给出了其数学理论分析及用计算机进行自动安排议程的算法,实现了简单议程安排程序,方便地解决各种大型会议的议程自动安排问题,最后在C语言程序下实现算法. 关键词：会议议程安排;二部图;连通图;最大匹配 ABSTRACT With the development of society and economic, Chinese and foreign exchange increasingly frequent, there are so species of the current international academic conferences. Also in the increasingly large scale, often attend more than one thousand people, the more than games indefinitely may points more project team. This is involved the agenda. In the early days of the agenda process, because the number of events is not many, generally used the artificial arrangement, while it might need a certain amount of manpower, usually also within acceptable limits. Now the traditional artificial meeting agenda way already can not meet the requirements, so the meeting agenda automatic optimization problem was born. This paper by using graph theory as a tool to discuss the technology of general meeting agenda problem, this paper presents some of the criteria to determine the agenda, and solve the meeting agenda, two problems: (1) The number and the arrangement in the same time; (2) The division of project team of participants. For the two problems this paper gives the mathematical theory analysis and with a computer algorithm of automatic arrangement agenda, an agenda realized simple procedure, convenient to solve various large conference agenda to be automatic arrangement, and finally, in the C programming language algorithm. Key words: Course timetabling; Bipartite graph; Connected graph; Maxim