A competitive (dual) simplex method for the assignment problem (Q3730345): Difference between revisions

@@ Property / cites work @@
+Signature Methods for the Assignment Problem
@@ Property / cites work: Signature Methods for the Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Q3042873
@@ Property / cites work: Q3042873 / rank @@
+Normal rank
@@ Property / cites work @@
+The Hirsch Conjecture for Dual Transportation Polyhedra
+Normal rank
@@ Property / cites work @@
+Faces of dual transportation polyhedra
@@ Property / cites work: Faces of dual transportation polyhedra / rank @@
+Normal rank
@@ Property / cites work @@
+The alternating basis algorithm for assignment problems
+Normal rank
@@ Property / cites work @@
+A network simplex method
@@ Property / cites work: A network simplex method / rank @@
+Normal rank
@@ Property / cites work @@
+Theoretical Properties of the Network Simplex Method
+Normal rank
@@ Property / cites work @@
+Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
+Normal rank
@@ Property / cites work @@
+Efficient dual simplex algorithms for the assignment problem
+Normal rank
@@ Property / cites work @@
+Technical Note—A Polynomial Simplex Method for the Assignment Problem
+Normal rank
@@ Property / cites work @@
+On the simplex algorithm for networks and generalized networks
+Normal rank