ON THE CHOICE OF STEP SIZE IN SUBGRADIENT OPTIMIZATION

被引：66

作者：

BAZARAA, MS ^{[1
]}

SHERALI, HD ^{[1
]}

机构：

[1] VIRGINIA POLYTECH INST & STATE UNIV,SCH IND ENGN & OPERAT RES,BLACKSBURG,VA 24061

来源：

关键词：

D O I：

10.1016/0377-2217(81)90096-5

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：380 / 388

页数：9

共 11 条

[1]

[Anonymous], 1954, OPERATIONS RES, DOI DOI 10.1287/OPRE.2.4.393

[2] GRAPHIC SOLUTION OF THE TRAVELING-SALESMAN PROBLEM [J].

BARACHET, LL .

[3]

EDWARDS TD, 1979, THESIS GEORGIA I TEC

[4] A DYNAMIC PROGRAMMING APPROACH TO SEQUENCING PROBLEMS [J].

HELD, M ;

KARP, RM .

JOURNAL OF THE SOCIETY FOR INDUSTRIAL AND APPLIED MATHEMATICS, 1962, 10 (01) :196-210

[5]

Held M., 1974, Mathematical Programming, V6, P62, DOI 10.1007/BF01580223

[6] TRAVELING-SALESMAN PROBLEM AND MINIMUM SPANNING TREES [J].

HELD, M ;

KARP, RM .

[7]

Held M, 1971, MATHEMATICAL PROGRAM, V1, P6, DOI [DOI 10.1007/BF01584070, 10.1007/BF01584070]

[8]

Karg L.L., 1964, MANAGE SCI, V10, P225

[9]

POLJAK BT, 1967, SOV MATH DOKL, V8, P593

[10]

POLJAK BT, 1969, USSR COMP MATH MATH, V9, P14