Research In Mixed-Integer Programming

研究将集中在开发所需的理论和技术上。 一般混合整数的一个鲁棒高效算法 编程问题。 将研究的主题包括高效 公式化，预处理，分解，逻辑测试，线性 编程、约束生成、分支和并行处理。 该项目还将涉及开发一个模块化的 实验代码来测试和评估的想法和方法， 基础研究的结果。 人们对一个高效、健壮的混合整数有着巨大的需求 编程算法，因为各种各样的实际问题 可以用这种方式来表达。 但许多更大的， 困难的问题不能在合理的范围内解决到（接近）最优。 根据现有的方法。 其中一些大型混合 整数模型产生于以下领域的优化问题： 物流和制造业。 因此，发展高效 方法将对改善规划和 生产和分销过程的操作。

The research will focus on the theory and techniques needed to develop a robust and efficient algorithm for the general mixed integer programming problem. Topics that will be studied include efficient formulation, preprocessing, decomposition, logical testing, linear programming, constraint generation, branching and parallel processing. The project will also involve the development of a modular experimental code to test and evaluate the ideas and methodology that result from the basic research. There is tremendous demand for an efficient and robust mixed integer programming algorithm because a great variety of practical problems can be formulated in this way. But many of the larger and more difficult ones cannot be solved to (near) optimality in a reasonable amount of time by the existing methodology. Some of these large mixed integer models arise from optimization problems in the areas of logistics and manufacturing. Thus, the development of efficient methods would have a significant impact on improving the planning and operation of production and distribution processes.