A NEW CLASS OF CUTTING PLANES FOR THE SYMMETRIC TRAVELING SALESMAN PROBLEM

被引：32
作者：
FLEISCHMANN, B
机构：
来源：
MATHEMATICAL PROGRAMMING | 1988年 / 40卷 / 03期
关键词：
D O I：
10.1007/BF01580734
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
引用
收藏
页码：225 / 246
页数：22
相关论文
共 16 条
[1]   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
[2]  
CORNUEJOLS G, 1983, 378 LAB INF MATH APP
[3]   SOLVING LARGE-SCALE SYMMETRIC TRAVELING SALESMAN PROBLEMS TO OPTIMALITY [J].
CROWDER, H ;
PADBERG, MW .
MANAGEMENT SCIENCE, 1980, 26 (05) :495-509
[4]   A CUTTING PLANE PROCEDURE FOR THE TRAVELING SALESMAN PROBLEM ON ROAD NETWORKS [J].
FLEISCHMANN, B .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1985, 21 (03) :307-317
[5]   DISTANCE CONSERVING REDUCTIONS FOR NONORIENTED NETWORKS [J].
FLEISCHMANN, B .
OR SPEKTRUM, 1983, 5 (04) :195-205
[6]  
GROTSCHEL M, 1980, MATH PROGRAM STUD, V12, P61
[7]   SYMMETRIC TRAVELING SALESMAN PROBLEM .1. INEQUALITIES [J].
GROTSCHEL, M ;
PADBERG, MW .
MATHEMATICAL PROGRAMMING, 1979, 16 (03) :265-280
[8]  
GROTSCHEL M, IN PRESS MATH OPERAT
[9]  
Grotschel M., 1985, TRAVELING SALESMAN P, P251
[10]  
LAND A, 1979, SOLUTION SOME 100 CI
12