A note on the polytope of bipartite TSP (Q1682883): Difference between revisions

@@ Property / DOI @@
-.1016/j.dam.2017.09.009
@@ Property / DOI: 10.1016/j.dam.2017.09.009 / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.10821
@@ Property / arXiv ID: 1703.10821 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3425132
@@ Property / cites work: Q3425132 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for the Euclidean bipartite TSP
+Normal rank
@@ Property / cites work @@
+Edmonds polytopes and weakly hamiltonian graphs
@@ Property / cites work: Edmonds polytopes and weakly hamiltonian graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Solution of a Large-Scale Traveling-Salesman Problem
+Normal rank
@@ Property / cites work @@
+Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+The traveling salesman problem and its variations
@@ Property / cites work: The traveling salesman problem and its variations / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum cuts in near-linear time
@@ Property / cites work: Minimum cuts in near-linear time / rank @@
+Normal rank
@@ Property / cites work @@
+Q4461904
@@ Property / cites work: Q4461904 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient separation routines for the symmetric traveling salesman problem. I: General tools and comb separation
+Normal rank
@@ Property / DOI @@
+.1016/J.DAM.2017.09.009
@@ Property / DOI: 10.1016/J.DAM.2017.09.009 / rank @@
+Normal rank