On affine reducibility of combinatorial polytopes (Q1761001): Difference between revisions

@@ Property / cites work @@
+Q3882177
@@ Property / cites work: Q3882177 / rank @@
+Normal rank
@@ Property / cites work @@
+The adjacency relation on the traveling salesman polytope is NP-Complete
+Normal rank
@@ Property / cites work @@
+Adjacency on the constrained assignment problem
@@ Property / cites work: Adjacency on the constrained assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+A combinatorial study of partial order polytopes
@@ Property / cites work: A combinatorial study of partial order polytopes / rank @@
+Normal rank