The negative cycles polyhedron and hardness of checking some polyhedral properties (Q646701): Difference between revisions

@@ Property / cites work @@
+Q4452091
@@ Property / cites work: Q4452091 / rank @@
+Normal rank
@@ Property / cites work @@
+A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra
+Normal rank
@@ Property / cites work @@
+Reverse search for enumeration
@@ Property / cites work: Reverse search for enumeration / rank @@
+Normal rank
@@ Property / cites work @@
+How good are convex hull algorithms?
@@ Property / cites work: How good are convex hull algorithms? / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+Primal-dual methods for vertex and facet enumeration
+Normal rank
@@ Property / cites work @@
+The vertex set of a \(0/1\)-polytope is strongly \(\mathcal P\)-enumerable
+Normal rank
@@ Property / cites work @@
+The complexity of recognizing linear systems with certain integrality properties
+Normal rank
@@ Property / cites work @@
+A polyhedron with all \(s-t\) cuts as vertices, and adjacency of cuts
+Normal rank
@@ Property / cites work @@
+Generating all vertices of a polyhedron is hard
@@ Property / cites work: Generating all vertices of a polyhedron is hard / rank @@
+Normal rank
@@ Property / cites work @@
+On recognizing integer polyhedra
@@ Property / cites work: On recognizing integer polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient enumeration of the vertices of polyhedra associated with network LP's
+Normal rank
@@ Property / cites work @@
+Bounds on Backtrack Algorithms for Listing Cycles, Paths, and Spanning Trees
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank