A BOUND-AND-SCAN ALGORITHM FOR PURE INTEGER LINEAR PROGRAMMING WITH GENERAL VARIABLES

被引：18

作者：

HILLIER, FS

机构：

来源：

OPERATIONS RESEARCH | 1969年 / 17卷 / 04期

关键词：

D O I：

10.1287/opre.17.4.638

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

New algorithm presented and evaluated proceeds by obtaining tight bounds or conditional bounds on relevant values of respective variables, and then identifies sequence of constantly improving feasible solutions by scanning relevant solutions; computational experience suggests that algorithm compares favorably in efficiency with existing algorithms; plans for investigating ways of further increasing efficiency of algorithm and of extending it to more general problems are outlined.

引用

页码：638 / &

共 55 条

[41]

MARTIN GT, 1963, RECENT ADV MATH PROG, P311

[42]

MASON TE, 1947, BRIEF ANALYTIC GEOME

[43]

Petersen C. C., 1967, MANAGE SCI, V13, P736

[44]

RYSER HJ, 1963, 14 MATH ASS AM CAR M

[45] AN INVESTIGATION OF SOME COMPUTATIONAL ASPECTS OF INTEGER PROGRAMMING [J].

SRINIVASAN, AV .

JOURNAL OF THE ACM, 1965, 12 (04) :525-+

[46]

STORY A, 1963, IND SCHEDULING, P207

[47]

THOMPSON GL, 1965, 1965 EAST M I MAN SC

[48]

THOMPSON GL, IN PRESS

[49]

THOMPSON GL, 1964, REVUE FRANCAISE RECH, V8, P159

[50] PREVENTIVE MAINTENANCE SCHEDULING BY MATHEMATICAL-PROGRAMMING [J].

WAGNER, HM ;

GIGLIO, RJ ;

GLASER, RG .

MANAGEMENT SCIENCE, 1964, 10 (02) :316-334

← 1 2 3 4 5 6 →