| Books 1 - 7 of 7 | Previous | Next |
|
 | | Network Flows: Theory, Algorithms, and Applications (United States Ed Edition)
by Ravindra K. Ahuja, Thomas L. Magnanti, James B. Orlin
Hardcover, 864 Pages, Published 1993 by Prentice Hall, United States Ed Edition
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Polynomial dual network simplex algorithms (Report)
by James b Orlin
Unknown Binding, 23 Pages, Published 1991 by Dept. of Computer Science, Stanford University
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Minimum convex dynamic network flows (Technical report)
by James b Orlin
Unknown Binding, Published 1980 by Massachusetts Institute of Technology, Operations Research Center
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Application of the analogy between water flow with a free surface and two-dimensional compressible compressible gas flow (Report / National Advisory Committee for Aeronautics)
by W. James Orlin
Unknown Binding, 18 Pages, Published 1947 by U.S. G.P.O
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | The dynamic convex programming problem (Technical report)
by James b Orlin
Unknown Binding, Published 1980 by Massachusetts Institute of Technology, Operations Research Center
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | Maximum dynamic network flows (Technical report)
by James b Orlin
Unknown Binding, Published 1980 by Massachusetts Institute of Technology, Operations Research Center
Compare Prices | Add to Wish List | Set Price Alert |
|
 | | An 0(n²) algorithm for coloring proper circular arc graphs (Technical report)
by James b Orlin
Unknown Binding, Published 1980 by Massachusetts Institute of Technology, Operations Research Center
Compare Prices | Add to Wish List | Set Price Alert |
|
| Books 1 - 7 of 7 | Previous | Next |