EFFICIENT HEURISTIC PROCEDURES FOR INTEGER LINEAR PROGRAMMING WITH AN INTERIOR

被引：67

作者：

HILLIER, FS

机构：

来源：

OPERATIONS RESEARCH | 1969年 / 17卷 / 04期

关键词：

D O I：

10.1287/opre.17.4.600

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Evaluation of sone new heuristic procedures for seeking approximate solution of pure integer linear programming problems that have only inequality constraints; computation time required by these methods has benerally been only fraction of that used by simplex method for problems tested; solution obtained consistently has been close to optimal and frequently has been optimal; plans for generalizing methods discussed are outlined.

引用

页码：600 / &

共 40 条

[1]

BALAS E, 1964, CR HEBD ACAD SCI, V258, P5136

[2] AN ADDITIVE ALGORITHM FOR SOLVING LINEAR PROGRAMS WITH 0-1 VARIABLES [J].