A note on the polytope of bipartite TSP

Gergely Kovács, Z. Tuza, Béla Vizvári, Hajieh K. Jabbari

Research output: Contribution to journalArticle

Abstract

The main result of this paper is that the polytope of the bipartite TSP is significantly different from that of the general TSP. Comb inequalities are known as facet defining ones in the general case. In the bipartite case, however, many of them are satisfied whenever all degree and subtour elimination constraints are satisfied, i.e. these comb inequalities are not facet defining. The inequalities in question belong to the cases where vertices of one of the two classes occur in less than the half of the intersections of the teeth and the hand. Such side conditions are necessary, as simple example shows that the comb inequality can be violated when each class has vertices in more than the half of the intersections.

Original languageEnglish
Pages (from-to)92-100
Number of pages9
JournalDiscrete Applied Mathematics
Volume235
DOIs
Publication statusPublished - Jan 30 2018

    Fingerprint

Keywords

  • Bipartite graph
  • Optimization of robot route
  • TSP

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics
  • Applied Mathematics

Cite this