### 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 language | English |
---|---|

Pages (from-to) | 92-100 |

Number of pages | 9 |

Journal | Discrete Applied Mathematics |

Volume | 235 |

DOIs | |

Publication status | Published - Jan 30 2018 |

### Fingerprint

### Keywords

- Bipartite graph
- Optimization of robot route
- TSP

### ASJC Scopus subject areas

- Discrete Mathematics and Combinatorics
- Applied Mathematics

### Cite this

*Discrete Applied Mathematics*,

*235*, 92-100. https://doi.org/10.1016/j.dam.2017.09.009