Separating clique tree and bipartition inequalities in polynomial time (Q5101404): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-59408-6_40
+Normal rank
@@ Property / OpenAlex ID @@
+W1597374843
@@ Property / OpenAlex ID: W1597374843 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Travelling Salesman Polytopes
@@ Property / cites work: Small Travelling Salesman Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Clique Tree Inequalities and the Symmetric Travelling Salesman Problem
+Normal rank
@@ Property / cites work @@
+Q4845366
@@ Property / cites work: Q4845366 / rank @@
+Normal rank
@@ Property / cites work @@
+Odd Minimum Cut-Sets and <i>b</i>-Matchings
@@ Property / cites work: Odd Minimum Cut-Sets and <i>b</i>-Matchings / rank @@
+Normal rank
@@ Property / cites work @@
+Facet identification for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+The Binested Inequalities for the Symmetric Traveling Salesman Polytope
+Normal rank