A BOUNDED DUAL (ALL-INTEGER) INTEGER PROGRAMMING ALGORITHM WITH AN OBJECTIVE CUT

被引：6

作者：

AUSTIN, LM ^{[1
]}

HANNA, ME ^{[1
]}

机构：

[1] UNIV TEXAS,COLL BUSINESS ADM,ARLINGTON,TX 76010

来源：

NAVAL RESEARCH LOGISTICS | 1983年 / 30卷 / 02期

关键词：

D O I：

10.1002/nav.3800300208

中图分类号：

C93 [管理学]; O22 [运筹学];

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：271 / 281

页数：11

共 17 条

[1] ITERATION SKIPPING IN PRIMAL INTEGER PROGRAMMING [J].

ARNOLD, LR ;

BELLMORE, M .

OPERATIONS RESEARCH, 1974, 22 (01) :129-136

[2] GENERATED CUT FOR PRIMAL INTEGER PROGRAMMING [J].

ARNOLD, LR ;

BELLMORE, M .

OPERATIONS RESEARCH, 1974, 22 (01) :137-143

[3]

BENISRAEL A, 1962, CAHIERS CTR ETUDES R, V4, P215

[4] A TREE-SEARCH ALGORITHM FOR MIXED INTEGER PROGRAMMING-PROBLEMS [J].

DAKIN, RJ .

COMPUTER JOURNAL, 1965, 8 (03) :250-253

[5]

FLORIAN M, 1979, OPER RES, V27, pR7

[6]

Gomory R.E, 1963, RECENT ADV MATH PROG, P269

[7] ON RELATION BETWEEN INTEGER AND NONINTEGER SOLUTIONS TO LINEAR PROGRAMS [J].

GOMORY, RE .

PROCEEDINGS OF THE NATIONAL ACADEMY OF SCIENCES OF THE UNITED STATES OF AMERICA, 1965, 53 (02) :260-&

[8]

Gomory RE, 1958, B AM MATH SOC, V64, P275, DOI DOI 10.1090/S0002-9904-1958-10224-4

[9]

Hu T.C., 1969, INTEGER PROGRAMMING

[10] AN AUTOMATIC METHOD OF SOLVING DISCRETE PROGRAMMING-PROBLEMS [J].

LAND, AH ;

DOIG, AG .

ECONOMETRICA, 1960, 28 (03) :497-520

← 1 2 →