ACCELERATED BOUND-AND-SCAN ALGORITHM FOR INTEGER PROGRAMMING

被引：7

作者：

FAALAND, BH

HILLIER, FS

机构：

[1] UNIV WASHINGTON,SEATTLE,WA 98104

[2] STANFORD UNIV,STANFORD,CA 94305

来源：

OPERATIONS RESEARCH | 1975年 / 23卷 / 03期

关键词：

ALGORITHMS - INTEGER PROGRAMMING;

D O I：

10.1287/opre.23.3.406

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

This paper presents a new implicit enumeration algorithm for solving the pure integer linear programming problem. The theory of equivalent integer programming problems is first used to reformulate the problem. A technique originally used with particular success in the bound-and-scan algorithm to deal with only a subset of the variables is extended to all of the variables in the restructured problem.

引用

页码：406 / 425

页数：20

共 16 条

[1] ALGORITHMS FOR HERMITE AND SMITH NORMAL MATRICES AND LINEAR DIOPHANTINE EQUATIONS [J].