A sequential delimitative and combinatorial algorithm for a class of integer programming

摘要：

In this paper, the algorithm was given for solving a class of integer programming problems, this algorithm generates all combinations according to a certain order of the magnitude of objective function by using a multi-level generating method of preceding for higher place. In the procedure of generating combinations, the algorithm eliminates a majority of infeasible and non-optimum combinations by using sequential delimitative and combinatorial method so that the algorithm has a higher computational efficiency.

关键词： Integer programming Combinations Combinatorial optimization

作者: Shi Lian-shuan Chai Shan Da Lin

作者单位: Computer Department, Tianjin Vocational Technical Teacher College, Tianjin 300222,China Science research institute, Shandong Engineering Institute.Zibo 255012, China Mathematic Department, Inner Mongolia University, HuHeHoT, 010021, China

会议类型: 国际会议

会议名称: Proceedings of The Fourth International Conference on Parallel and Distribyted Computing,Applications and Technologies(第四届并行与分布式计算应用与技术国际会议)

会议地点: 成都

会议语种:英文

页码: 801-804

在线出版日期: 2003-08-27（万方平台首次上网日期，不代表论文的发表时间）