The simplest families of polytopes associated with NP-hard problems (Q2353062): Difference between revisions

@@ Property / cites work @@
+On affine reducibility of combinatorial polytopes
@@ Property / cites work: On affine reducibility of combinatorial polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+The common face of some 0/1-polytopes with NP-complete nonadjacency relation
+Normal rank
@@ Property / cites work @@
+Geometry of cuts and metrics
@@ Property / cites work: Geometry of cuts and metrics / rank @@
+Normal rank
@@ Property / cites work @@
+Linear vs. semidefinite extended formulations
@@ Property / cites work: Linear vs. semidefinite extended formulations / rank @@
+Normal rank
@@ Property / cites work @@
+On certain polytopes associated with graphs
@@ Property / cites work: On certain polytopes associated with graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4801577
@@ Property / cites work: Q4801577 / rank @@
+Normal rank
@@ Property / cites work @@
+Exact Algorithms for the Quadratic Linear Ordering Problem
+Normal rank