THE FIXED-OUTDEGREE 1-ARBORESCENCE POLYTOPE

被引:17
作者
BALAS, E [1 ]
FISCHETTI, M [1 ]
机构
[1] UNIV BOLOGNA,I-40126 BOLOGNA,ITALY
关键词
TRAVELING SALESMAN (ASYMMETRIC); SPANNING ARBORESCENCE; POLYHEDRAL COMBINATORICS;
D O I
10.1287/moor.17.4.1001
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
A 1-arborescence is a spanning arborescence rooted at node 1, plus one arc incident into node 1. The 1-arborescence polytope, the convex hull of incidence vectors of 1-arborescences, is a well-known relaxation of the Asymmetric Traveling Salesman (ATS) polytope. In this paper we study the Fixed Outdegree 1-Arborescence (FDA) polytope, defined as the convex hull of incidence vectors of 1-arborescences having outdegree 1 at a prescribed subset F of nodes. The FDA polytope becomes the 1-arborescence polytope when F = empty set, and it becomes the ATS polytope when F is the entire node set. We derive several classes of valid inequalities for the FDA polytope and show that they are facet defining. This is done by using a theorem that establishes sufficient conditions for a facet defining inequality for the ATS polytope to also be facet defining for the FDA polytope. We then introduce the class of FD inequalities and show that they define facets of both the ATS polytope and the FDA polytope. Finally, we define a canonical form that facilitates rigorous comparisons between inequalities, and use it to show that the new facets are distinct from each other and from other known facets.
引用
收藏
页码:1001 / 1018
页数:18
相关论文
共 16 条
  • [1] BALAS E, 1989, IN PRESS MATH PROGRA
  • [2] BALAS E, 1989, SIAM J DISCRETE MATH, V3, P425
  • [3] THE TRAVELING SALESMAN PROBLEM ON A GRAPH AND SOME RELATED INTEGER POLYHEDRA
    CORNUEJOLS, G
    FONLUPT, J
    NADDEF, D
    [J]. MATHEMATICAL PROGRAMMING, 1985, 33 (01) : 1 - 27
  • [4] OPTIMUM BRANCHINGS
    EDMONDS, J
    [J]. JOURNAL OF RESEARCH OF THE NATIONAL BUREAU OF STANDARDS SECTION B-MATHEMATICAL SCIENCES, 1967, B 71 (04): : 233 - +
  • [5] FISCHETTI M, 1989, DEIS OR897 U BOL TEC
  • [6] FISCHETTI M, 1991, IN PRESS MATH OPER R
  • [7] Fulkerson D. R., 1974, Mathematical Programming, V6, P1, DOI 10.1007/BF01580218
  • [8] GILES R, 1975, THESIS U WATERLOO
  • [9] Grotschel M., 1977, Zeitschrift fur Operations Research, Serie A (Theorie), V21, P33, DOI 10.1007/BF01918456
  • [10] CLIQUE TREE INEQUALITIES AND THE SYMMETRICAL TRAVELING SALESMAN PROBLEM
    GROTSCHEL, M
    PULLEYBLANK, WR
    [J]. MATHEMATICS OF OPERATIONS RESEARCH, 1986, 11 (04) : 537 - 569