A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Year of publication: |
1983
|
---|---|
Authors: | Orlin, James B. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | HD28 .M414 no.1484- | Simplexes (Mathematics) | Algorithms |
-
Combinatorial theorems on the simplotope that generalize results on the simplex and cube
Freund, Robert Michael., (1984)
-
On the simplex algorithm for networks and generalized networks
Orlin, James B., (1983)
-
Robust Estimators are Hard to Compute
Bernholt, Thorsten, (2006)
- More ...
-
Use of representative operation counts in computational testings of algorithms
Ahuja, Ravindra K., (1992)
-
Fast approximation schemes for multi-criteria flow, knapsack, and scheduling problems
Safer, Hershel M., (1995)
-
On a "primal" matroid intersection algorithm
Orlin, James B., (1983)
- More ...