Transportation problems which can be solved by the use of hirsch-paths for the dual problems (Q3783840): Difference between revisions

@@ Property / cites work @@
+The Hirsch Conjecture for Dual Transportation Polyhedra
+Normal rank
@@ Property / cites work @@
+Signature Methods for the Assignment Problem
@@ Property / cites work: Signature Methods for the Assignment Problem / rank @@
+Normal rank
@@ Property / cites work @@
+A competitive (dual) simplex method for the assignment problem
+Normal rank
@@ Property / cites work @@
+Assignment and matching problems: solution methods with FORTRAN-programs. In cooperation with T. Bönniger and G. Katzakidis
+Normal rank
@@ Property / cites work @@
+Efficient dual simplex algorithms for the assignment problem
+Normal rank
@@ Property / cites work @@
+Solving the Assignment Problem by Relaxation
@@ Property / cites work: Solving the Assignment Problem by Relaxation / rank @@
+Normal rank
@@ Property / cites work @@
+The <i>d</i>-Step Conjecture and Its Relatives
@@ Property / cites work: The <i>d</i>-Step Conjecture and Its Relatives / rank @@
+Normal rank
@@ Property / cites work @@
+The \(d\)-step conjecture for polyhedra of dimension \(d<6\)
+Normal rank
@@ Property / cites work @@
+Q3243274
@@ Property / cites work: Q3243274 / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithm for the assignment problem
@@ Property / cites work: An algorithm for the assignment problem / rank @@
+Normal rank
@@ Property / cites work @@
+On some techniques useful for solution of transportation network problems
+Normal rank