The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable (Q1272311): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Primal-dual methods for vertex and facet enumeration
+Normal rank
@@ Property / cites work @@
+Analysis of backtrack algorithms for listing all vertices and all faces of a convex polyhedron.
+Normal rank
@@ Property / cites work @@
+Finding all the perfect matchings in bipartite graphs
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of the vertices of polyhedra associated with network LP's
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+The Complexity of Enumeration and Reliability Problems
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1016/s0925-7721(98)00021-2
+Normal rank
@@ Property / OpenAlex ID @@
+W1973868432
@@ Property / OpenAlex ID: W1973868432 / rank @@
+Normal rank