AN ADVANCED DUAL ALGORITHM WITH CONSTRAINT RELAXATION FOR ALL-INTEGER PROGRAMMING

被引：10

作者：

AUSTIN, LM ^{[1
]}

GHANDFOROUSH, P ^{[1
]}

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV,DEPT MANAGEMENT SCI,BLACKSBURG,VA 24061

来源：

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

关键词：

Compendex;

D O I：

10.1002/nav.3800300110

中图分类号：

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

学科分类号：

070105 ; 12 ; 1201 ; 1202 ; 120202 ;

摘要：

MATHEMATICAL TECHNIQUES - Numerical Methods - OPTIMIZATION

引用

页码：133 / 143

页数：11

共 10 条

[1]

AUSTIN LM, 1981, NOV P NAT M AM I DEC

[2]

AUSTIN LM, 1979, BOUNDED DESCENT ALGO

[3]

AUSTIN LM, 1980, MAY JOINT NAT ORSA T

[4] A PRIMAL-DUAL CUTTING-PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

GHANDFOROUSH, P ;

AUSTIN, LM .

NAVAL RESEARCH LOGISTICS, 1981, 28 (04) :559-566

[5]

GHANDFOROUSH P, 1980, THESIS TEXAS TU

[6]

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

[7] A BOUND-AND-SCAN ALGORITHM FOR PURE INTEGER LINEAR PROGRAMMING WITH GENERAL VARIABLES [J].

HILLIER, FS .

OPERATIONS RESEARCH, 1969, 17 (04) :638-&

[8]

SINHA P, 1981, COMMUNICATION

[9] INTEGER LINEAR PROGRAMMING - STUDY IN COMPUTATIONAL EFFICIENCY [J].

TRAUTH, CA ;

WOOLSEY, RE .

MANAGEMENT SCIENCE SERIES A-THEORY, 1969, 15 (09) :481-493

[10] A SIMPLIFIED PRIMAL (ALL-INTEGER) INTEGER PROGRAMMING ALGORITHM [J].

YOUNG, RD .

OPERATIONS RESEARCH, 1968, 16 (04) :750-&

← 1 →