摘要： 对从企业业务流程管理中抽象出来的大规模整数规划问题的计算机求解方法进行讨论。提出一种内存优化管理方法，能更高效地存储海量数据。同时对求解整数规划问题的经典算法——分枝定界算法进行研究，利用人工智能的搜索思想，给出分枝定界法的改进算法，使其能快速求解大规模整数规划问题。

关键词: 大规模整数规划问题, 分枝定界求解算法, 内存优化管理

Abstract: This paper researches the computer solving method of large-scale integer programming problem which is abstracted from enterprise business process management. A memory optimizing management method is proposed, which can memorize massive data efficiently. In the meanwhile, the classic algorithm of integer programming problem——branch & bound is studied, and an advanced algorithm of branch & bound by using the thought of artificial intelligence which can solve the large-scale integer programming problem rapidly is proposed.

Key words: large-scale integer programming problem, branch & bound algorithm, memory optimizing management

中图分类号: 

• TP301.6