SOLUTION OF INTEGER LINEAR PROGRAMMING PROBLEMS BY DIRECT SEARCH

被引：11

作者：

ECHOLS, RE

COOPER, L

机构：

[1] Department of Applied Mathematics and Computer Science, Washington University, St. Louis, Missouri

来源：

JOURNAL OF THE ACM | 1968年 / 15卷 / 01期

关键词：

D O I：

10.1145/321439.321443

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

An approximate but fairly rapid method for solving integer linear programming problems is presented, which utilizes, in part, some of the philosophy of direct search methods. The method is divided into phases which can be applied in order and has the desirable characteristic that a best feasible solution is always available. Numerical results are presented for a number of test problems. Some possible extensions and improvements are also presented. © 1968, ACM. All right reserved.

引用

页码：75 / &

共 7 条

[1] INTEGER PROGRAMMING - METHODS, USES, COMPUTATION [J].