Separating over classes of TSP inequalities defined by 0 node-lifting in polynomial time (Q4645942): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/3-540-61310-2_34
+Normal rank
@@ Property / OpenAlex ID @@
+W1576649545
@@ Property / OpenAlex ID: W1576649545 / rank @@
+Normal rank
@@ Property / cites work @@
+Small Travelling Salesman Polytopes
@@ Property / cites work: Small Travelling Salesman Polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Separating Clique Trees and Bipartition Inequalities Having a Fixed Number of Handles and Teeth in Polynomial Time
+Normal rank
@@ Property / cites work @@
+Q4845366
@@ Property / cites work: Q4845366 / rank @@
+Normal rank
@@ Property / cites work @@
+Random sampling in cut, flow, and network design problems
+Normal rank
@@ Property / cites work @@
+On some connectivity properties of Eulerian graphs
+Normal rank
@@ Property / cites work @@
+The graphical relaxation: A new framework for the symmetric traveling salesman polytope
+Normal rank
@@ Property / cites work @@
+Expressing combinatorial optimization problems by linear programs
+Normal rank