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 |
-
On the simplex algorithm for networks and generalized networks
Orlin, James B., (1983)
-
Combinatorial theorems on the simplotope that generalize results on the simplex and cube
Freund, Robert Michael., (1984)
-
Market impacts of a multiyear mechanical fuel treatment program in the U.S.
Prestemon, Jeffrey P., (2008)
- More ...
-
Approximate Local Search in Combinatorial Optimization
Orlin, James B., (2003)
-
QuickMatch--a very fast algorithm for the assignment problem
Orlin, James B., (1993)
-
Parallel algorithms for the assignment and minimum-cost flow problems
Orlin, James B., (1992)
- More ...