The effectiveness of finite improvement algorithms for finding global optima (Q4201810): Difference between revisions

@@ Property / cites work @@
+The generalized simplex method for minimizing a linear form under linear inequality restraints
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Maximal Flow Through a Network
@@ Property / cites work: Maximal Flow Through a Network / rank @@
+Normal rank
@@ Property / cites work @@
+A Simple Algorithm for Finding Maximal Network Flows and an                         Application to the Hitchcock Problem
+Normal rank
@@ Property / cites work @@
+An Out-of-Kilter Method for Minimal-Cost Flow Problems
+Normal rank
@@ Property / cites work @@
+How easy is local search?
@@ Property / cites work: How easy is local search? / rank @@
+Normal rank
@@ Property / cites work @@
+A new polynomial-time algorithm for linear programming
+Normal rank
@@ Property / cites work @@
+Bimatrix Equilibrium Points and Mathematical Programming
+Normal rank
@@ Property / cites work @@
+A finite descent theory for linear programming, piecewise linear convex minimization, and the linear complementarity problem
+Normal rank
@@ Property / cites work @@
+The Simplex and Projective Scaling Algorithms as Iteratively Reweighted Least Squares Methods
+Normal rank
@@ Property / cites work @@
+On the number of iterations of local improvement algorithms
+Normal rank