SYMMETRIC TRAVELING SALESMAN PROBLEM .2. LIFTING THEOREMS AND FACETS

被引:84
作者
GROTSCHEL, M [1 ]
PADBERG, MW [1 ]
机构
[1] NYU,NEW YORK,NY 10003
关键词
Convex Polytopes; Facets; Lifting Theorems; Linear Inequalities; Travelling Salesman Problem;
D O I
10.1007/BF01582117
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
Four lifting theorems are derived for the symmetric travelling salesman polytope. They provide constructions and state conditions under which a linear inequality which defines a facet of the n-city travelling salesman polytope retains its facetial property for the (n + m)-city travelling salesman polytope, where m ≥ 1 is an arbitrary integer. In particular, they permit a proof that all subtour-elimination as well as comb inequalities define facets of the convex hull of tours of the n-city travelling salesman problem, where n is an arbitrary integer. © 1979 The Mathematical Programming Society.
引用
收藏
页码:281 / 302
页数:22
相关论文
共 5 条
  • [1] Chvatal V., 1973, Mathematical Programming, V5, P29, DOI 10.1007/BF01580109
  • [2] GROTSCHEL M, 1977, THESIS U BONN
  • [3] GROTSCHEL M, 1979, MATH PROGRAMMING, V1, P265
  • [4] MAURRAS JF, 1976, THESIS U PARIS
  • [5] PADBERG MW, 1977, SYMMETRIC TRAVELLING