A BRANCH-AND-CUT APPROACH TO A TRAVELING SALESMAN PROBLEM WITH SIDE CONSTRAINTS

被引：11

作者：

PADBERG, M ^{[1
]}

RINALDI, G ^{[1
]}

机构：

[1] CNR,IST ANALISI SISTEMI & INFORMAT,I-00185 ROME,ITALY

来源：

MANAGEMENT SCIENCE | 1989年 / 35卷 / 11期

关键词：

D O I：

10.1287/mnsc.35.11.1393

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

引用

页码：1393 / 1412

页数：20

共 22 条

[1]

Bellman R., 1957, DYNAMIC PROGRAMMING

[2] CHANCE-CONSTRAINED PROGRAMMING [J].

CHARNES, A ;

COOPER, WW .

MANAGEMENT SCIENCE, 1959, 6 (01) :73-79

[3] THE TRAVELING SALESMAN PROBLEM ON A GRAPH AND SOME RELATED INTEGER POLYHEDRA [J].

CORNUEJOLS, G ;

FONLUPT, J ;

NADDEF, D .

MATHEMATICAL PROGRAMMING, 1985, 33 (01) :1-27

[4] ARTIFICIAL-INTELLIGENCE DESIGN CHALLENGE - BACKGROUND, ANALYSIS, AND RELATIVE PERFORMANCE OF ALGORITHMS [J].

DEUTSCH, OL .

JOURNAL OF GUIDANCE CONTROL AND DYNAMICS, 1988, 11 (05) :386-393

[5] AN OUTER-APPROXIMATION ALGORITHM FOR A CLASS OF MIXED-INTEGER NONLINEAR PROGRAMS [J].

DURAN, MA ;

GROSSMANN, IE .

MATHEMATICAL PROGRAMMING, 1986, 36 (03) :307-339

[6] A NEW CLASS OF CUTTING PLANES FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM [J].

FLEISCHMANN, B .

MATHEMATICAL PROGRAMMING, 1988, 40 (03) :225-246

[7]

FLEISCHMANN B, 1982, LINEAR PROGRAMMING A

[8]

Fulkerson D., 1971, MATH PROGRAM, V1, P168

[9]

Grotschel M., 1985, TRAVELING SALESMAN P, P251

[10]

HOFFMAN K, 1988, UNPUB BRANCH CUT OPT

← 1 2 3 →