GENERALIZED SUBTOUR ELIMINATION CONSTRAINTS AND CONNECTIVITY CONSTRAINTS

被引：10

作者：

LAPORTE, G

机构：

[1] Ecole des Hautes Etudes Commerciales, de Montreal, Montreal, Que, Can, Ecole des Hautes Etudes Commerciales de Montreal, Montreal, Que, Can

来源：

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY | 1986年 / 37卷 / 05期

关键词：

MATHEMATICAL PROGRAMMING; LINEAR; -; VEHICLES; Scheduling;

D O I：

10.1057/jors.1986.86

中图分类号：

C93 [管理学];

学科分类号：

12 ; 1201 ; 1202 ; 120202 ;

摘要：

Several problems in connection with graphs can be formulated as integer linear programmes (I. L. P. s) possessing structural similarities. These include extensions of the well known travelling salesman problem (T. S. P. ) and a whole family of vehicle routeing problems. This paper shows how a class of constraints included in the T. S. P. formulation can be generalized. The results are applied to the formulation of three T. S. P. extensions having different characteristics.

引用

页码：509 / 514

页数：6

共 10 条

[1]

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

[2]

COFFMAN EJ, 1984, ALGORITHM DESIGN COM

[3] AN HEURISTIC METHOD FOR SOLVING TIME-SENSITIVE ROUTING-PROBLEMS [J].

EVANS, SR ;

NORBACK, JP .

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1984, 35 (05) :407-414

[4]

GAVISH B, 1984, 26 TIMS C COP

[5]

GOLDEN BL, 1985, 12TH INT S MATH PROG

[6] A BRANCH AND BOUND ALGORITHM FOR THE CAPACITATED VEHICLE-ROUTING PROBLEM [J].

LAPORTE, G ;

NOBERT, Y .

OR SPEKTRUM, 1983, 5 (02) :77-85

[7] AN EXACT ALGORITHM FOR MINIMIZING ROUTING AND OPERATING COSTS IN DEPOT LOCATION [J].

LAPORTE, G ;

NOBERT, Y .

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1981, 6 (02) :224-226

[8]

LAPORTE G, 1985, 10TH S OP RES MUN

[9]

LAPORTE G, 1986, SURVEYS COMBINATORIA

[10]

NOBERT Y, 1982, THESIS U MONTREAL

← 1 →