毕业论文《整数规划的算法及其应用》.docVIP

PAGE 2 摘 要 0-1整数规划在整数规划中占有重要地位。许多实际问题，例如指派问题、选地问题、送货问题都可归结为0-1整数规划问题。正是由于0-1整数规划具有深刻的背景和广泛的应用，所以研究0-1整数规划的算法是十分必要且具有重要意义。本文主要研究0-1整数规划的几种算法及其应用。 首先介绍0-1整数规划的相关概念、特点及其作用，通过实际问题建立0-1整数规划的数学模型。然后分别对穷举法，隐枚举法（过滤隐枚举法、分枝定界法和分枝——隐枚举法），组合直接搜寻法等几种算法进行介绍，并以具体的计算实例对上述算法加以运用，最后阐明了各种算法的优缺点。 关键词 整数规划；0-1整数规划；枚举法；组合直接搜寻法 Abstract 0-1 integer linear programming plays an important role in integer programming. In many practical problems, such as assignment problem, site selection problem and deliver goods problem, they are all boiled down to 0-1 integer linear programming problem. And just because of the 0-1 integer linear programming has profound background and widely used, it is very necessary and important practical sense to study its algorithm. In this paper, we mainly study the algorithms for 0-1 integer linear programming and its applications. Firstly, we introduce the related concepts, features and functions, and set up the mathematical model based on the practical problems in the paper. Secondly, we study three algorithms about method of exhaustion, implicit enumeration method (which includes filter implicit enumeration, branch and bound method and branch-implied enumeration) and the method of combination and direction-finding. And then, we apply the algorithms to work out the practical examples of calculation. At last, we compare and expound the advantages and disadvantages of every algorithm in this paper. Key words integer programming；0-1 integer linear programming；enumeration method；the method of combination and direction-finding 目 录 TOC \o 1-3 \h \z \u HYPERLINK \l _Toc263723558 摘 要 Ⅰ HYPERLINK \l _Toc263723559 ABSTRACT Ⅱ HYPERLINK \l _Toc263723560 第1章 绪论 PAGEREF _Toc263723560 \h 1 HYPERLINK \l _Toc263723561 1.1 研究背景及意义 PAGEREF _Toc263723561 \h 1 HYPERLINK \l _Toc263723562 1.2 国内外研究方法综述 PAGEREF _Toc263723562 \h 1 HYPERLINK \l _Toc263723563 1.3 本文主要研究内容 2 HYPERLINK \l _Toc263723564 第2章 0-1整数规划的数学模型 PAGEREF _Toc263723564 \h 3 HYPERLINK \l _Toc263723