Short simplex paths in lattice polytopes (Q2117352): Difference between revisions

@@ Property / DOI @@
-.1007/s00454-020-00268-y
@@ Property / DOI: 10.1007/s00454-020-00268-y / rank @@
-Normal rank
@@ Property / arXiv ID @@
+.05712
@@ Property / arXiv ID: 1912.05712 / rank @@
+Normal rank
@@ Property / cites work @@
+On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid
+Normal rank
@@ Property / cites work @@
+Q3056948
@@ Property / cites work: Q3056948 / rank @@
+Normal rank
@@ Property / cites work @@
+Anti-Hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
+Normal rank
@@ Property / cites work @@
+Q4011309
@@ Property / cites work: Q4011309 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Length of Monotone Paths in Polyhedra
@@ Property / cites work: On the Length of Monotone Paths in Polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+Integer Programming
@@ Property / cites work: Integer Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the diameter of lattice polytopes
@@ Property / cites work: On the diameter of lattice polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Primitive zonotopes
@@ Property / cites work: Primitive zonotopes / rank @@
+Normal rank
@@ Property / cites work @@
+Improved bounds on the diameter of lattice polytopes
+Normal rank
@@ Property / cites work @@
+The diameter of lattice zonotopes
@@ Property / cites work: The diameter of lattice zonotopes / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+An application of simultaneous diophantine approximation in combinatorial optimization
+Normal rank
@@ Property / cites work @@
+Scaling algorithms for network problems
@@ Property / cites work: Scaling algorithms for network problems / rank @@
+Normal rank
@@ Property / cites work @@
+On the number of solutions generated by the dual simplex method
+Normal rank
@@ Property / cites work @@
+A bound for the number of different basic solutions generated by the simplex method
+Normal rank
@@ Property / cites work @@
+On the diameter of convex polytopes
@@ Property / cites work: On the diameter of convex polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Solving MIPs via scaling-based augmentation
@@ Property / cites work: Solving MIPs via scaling-based augmentation / rank @@
+Normal rank
@@ Property / cites work @@
+Factoring polynomials with rational coefficients
@@ Property / cites work: Factoring polynomials with rational coefficients / rank @@
+Normal rank
@@ Property / cites work @@
+The simplex method using Tardos' basic algorithm is strongly polynomial for totally unimodular LP under nondegeneracy assumption
+Normal rank
@@ Property / cites work @@
+The Hirsch conjecture is true for (0,1)-polytopes
@@ Property / cites work: The Hirsch conjecture is true for (0,1)-polytopes / rank @@
+Normal rank
@@ Property / cites work @@
+Restarting algorithms: sometimes there is free lunch
+Normal rank
@@ Property / cites work @@
+Q3818127
@@ Property / cites work: Q3818127 / rank @@
+Normal rank
@@ Property / cites work @@
+Combinatorial optimization. Polyhedra and efficiency (3 volumes)
+Normal rank
@@ Property / cites work @@
+/1-Integer programming: Optimization and Augmentation are equivalent
+Normal rank
@@ Property / cites work @@
+A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs
+Normal rank
@@ Property / cites work @@
+Q4518979
@@ Property / cites work: Q4518979 / rank @@
+Normal rank
@@ Property / DOI @@
+.1007/S00454-020-00268-Y
@@ Property / DOI: 10.1007/S00454-020-00268-Y / rank @@
+Normal rank