THE MIXED CUTTING PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING

被引：2

作者：

AUSTIN, LM ^{[1
]}

RUPAREL, BC ^{[1
]}

机构：

[1] CLARK UNIV,GRAD SCH MANAGEMENT,WORCESTER,MA 01610

来源：

COMPUTERS & OPERATIONS RESEARCH | 1986年 / 13卷 / 04期

关键词：

D O I：

10.1016/0305-0548(86)90026-2

中图分类号：

TP39 [计算机的应用];

学科分类号：

081203 ; 0835 ;

摘要：

引用

页码：395 / 401

页数：7

共 13 条

[1] AN ADVANCED DUAL ALGORITHM WITH CONSTRAINT RELAXATION FOR ALL-INTEGER PROGRAMMING [J].

AUSTIN, LM ;

GHANDFOROUSH, P .

NAVAL RESEARCH LOGISTICS, 1983, 30 (01) :133-143

[2] A BOUNDED DUAL (ALL-INTEGER) INTEGER PROGRAMMING ALGORITHM WITH AN OBJECTIVE CUT [J].

AUSTIN, LM ;

HANNA, ME .

NAVAL RESEARCH LOGISTICS, 1983, 30 (02) :271-281

[3] A SURROGATE CUTTING PLANE ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

AUSTIN, LM ;

GHANDFOROUSH, P .

COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (03) :241-250

[4]

CROWN JC, 1982, AM MATH SOC M CINCIN

[5]

Garey MR., 1979, COMPUTERS INTRACTABI

[6]

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

[7]

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

[8] AN ADVANCED START ALGORITHM FOR ALL-INTEGER PROGRAMMING [J].

HANNA, ME ;

AUSTIN, LM .

COMPUTERS & OPERATIONS RESEARCH, 1985, 12 (03) :301-309

[9]

HANNA ME, 1981, THESIS TEXAS TU LUBB

[10]

RUPAREL BC, 1983, HYBRID BOUNDED ENUME

← 1 2 →