| A new heuristic algorithm for general integer linear programming problems |
| |
| 作者姓名： | GAO Pei-wang CAI Ying |
| |
| 作者单位： | Department of |
| |
| 基金项目： | We would like to thank the anonymous referees for their comments. |
| |
| 摘 要： | 1 Introduction ? Since the cutting plane method 1] and branch-and- bound principle 2] were developed as two types of efficient approaches for integer linear programming problems, how to improve them or to find new algorithms more efficient has become an…
|
| 关 键 词： | 整数规划 线性规划 目标函数超平面 切削平面 启发式算法 |
| 文章编号： | 1671-8224（2006）03-0170-05 |
| 收稿时间： | 2005-04-05 |
| 修稿时间： | 2006-05-19 |
A new heuristic algorithm for general integer linear programming problems |
| |
| GAO Pei-wang CAI Ying.A new heuristic algorithm for general integer linear programming problems[J].Journal of Chongqing University,2006,5(3):170-174. |
| |
| Authors: | GAO Pei-wang CAI Ying |
| |
| Institution: | GAO Pei-wang,CAI Ying Department of Finance,Guangxi University of Finance and Economics,Nanning,P. R. China Institute of Combined Traditional Chinese and Western Medicine,Xiangya Hospital affiliate,Central South University,Changsh |
| |
| Abstract: | A new heuristic algorithm is proposed for solving general integer linear programming problems. In the algorithm, the objective function hyperplane is used as a cutting plane, and then by introducing a special set of assistant sets, an efficient heuristic search for the solution to the integer linear program is carried out in the sets on the objective function hyperplane. A simple numerical example shows that the algorithm is efficient for some problems, and therefore, of practical interest. |
| |
| Keywords: | integer linear programming objective function hyperplane cutting plane heuristic algorithm |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
| 点击此处可从《重庆大学学报(英文版)》浏览原始摘要信息 |
| 点击此处可从《重庆大学学报(英文版)》下载免费的PDF全文 |
