On the simplex algorithm for networks and generalized networks
Year of publication: |
1983
|
---|---|
Authors: | Orlin, James B. |
Institutions: | Sloan School of Management, Massachusetts Institute of Technology (MIT) |
Subject: | HD28 .M414 no.1467- | Simplexes (Mathematics) |
-
Combinatorial theorems on the simplotope that generalize results on the simplex and cube
Freund, Robert Michael., (1984)
-
A polynomial-time parametric simplex algorithm for the minimum cost network flow problem
Orlin, James B., (1983)
- More ...
-
New scaling algorithms for the assignment and minimum cycle mean problems
Orlin, James B., (1988)
-
A faster strongly polynomial minimum cost flow algorithm
Orlin, James B., (1989)
-
Some problems on dynamic/periodic graphs
Orlin, James B., (1983)
- More ...