NSF/CBMS Regional Conference in the Mathematical Sciences "Combinatorial Optimization:Packing and Covering" 5/18/99- 5/22/99

组合优化涉及从一个大的隐式描述集合中有效地选择最优元素。此类问题的实例出现在许多重要的应用领域（例如，航空机组调度，制造物流，vlsi电路设计，路由和实验设计）。许多这样的问题可以表述为整数规划的打包问题或覆盖问题。事实上，这种提法是解决许多此类问题的最成功手段。通过积分多面体、图、超图、拟阵和杂波的理论，可以获得有用的算法和结构见解，这些见解通常直接影响我们解决这些问题的实际实例的能力。特别是，分解方法起着中心作用。我们的项目是一个为期五天的会议，在肯塔基大学举行，专门讨论这个话题。本次会议的主要活动是由卡内基梅隆大学的Gerard Cornuejols博士主持的十场系列讲座。讲座将向数学家（离散数学和其他领域的知名研究人员、博士后研究员和研究生）介绍包装和覆盖的最新研究。由于该领域在过去几年中在理论和应用方面都取得了迅速的发展，因此这次会议特别及时。

Combinatorial optimization involves the efficient choice of an optimal element from a large, implicitly-described set. Instances of such problems occur in many important applied domains (e.g., airline-crew scheduling, manufacturing logistics, VLSI-circuit design, routing, and experimental design). Many such problems can be formulated as integer-programming packing or covering problems. Indeed, such formulations have been the most successful means of attacking many of these problems. Useful algorithmic and structural insights, which often have direct impact on our ability to solve practical instances of these problems, are achieved through the theories of integral polyhedra, graphs, hypergraphs, matroids and clutters. In particular, decomposition methods play a central role. Our project is a five-day conference, held at the University of Kentucky, devoted to this topic. The main activity of this conference is a series of ten lectures by Dr. Gerard Cornuejols of Carnegie Mellon University. The lectures will serve to introduce mathematicians (established researchers in discrete mathematics and in other areas, postdoctoral fellows and graduate students) to current research in packing and covering. This conference is particularly timely since the field has seen rapid development in the last several years, in terms of both theory and application.