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)
-
Open Linked Statistical Data (OLSD): prospects and issues
Saxena, Stuti, (2017)
- More ...
-
A capacity scaling algorithm for the constrained maximum flow problem
Ahuja, Ravindra K., (1993)
-
Ahuja, Ravindra K., (1998)
-
Combinatorial algorithms for inverse network flow problems
Ahuja, Ravindra K., (1998)
- More ...