A note on the approximability of deepest-descent circuit steps (Q2060534): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W3135613333
@@ Property / OpenAlex ID: W3135613333 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+The diameters of network-flow polytopes satisfy the Hirsch conjecture
+Normal rank
@@ Property / cites work @@
+On the Circuit Diameter of Dual Transportation Polyhedra
+Normal rank
@@ Property / cites work @@
+An implementation of steepest-descent augmentation for linear programs
+Normal rank
@@ Property / cites work @@
+On Augmentation Algorithms for Linear and Integer-Linear Programming: From Edmonds--Karp to Bland and Beyond
+Normal rank
@@ Property / cites work @@
+On the foundations of linear and integer linear programming I
+Normal rank
@@ Property / cites work @@
+Q4790463
@@ Property / cites work: Q4790463 / rank @@
+Normal rank
@@ Property / cites work @@
+On the positive sums property and the computation of Graver test sets
+Normal rank
@@ Property / cites work @@
+Q3050157
@@ Property / cites work: Q3050157 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonlinear discrete optimization. An algorithmic theory
+Normal rank
@@ Property / cites work @@
+Edge-directions of standard polyhedra with applications to network flows
+Normal rank
@@ Property / cites work @@
+Q5638111
@@ Property / cites work: Q5638111 / rank @@
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank
@@ Property / cites work @@
+Q3673577
@@ Property / cites work: Q3673577 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:2060534