( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Fast and Simple Algorithm for the Maximum Flow Problem.

, и . Operations Research, 37 (5): 748-759 (1989)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

James Orlin

James R B Love

Michael James

Audrein James

Katherine James

 

Другие публикации лиц с тем же именем

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment., , и . Operations Research, 33 (4): 820-834 (1985)Very Large-Scale Neighborhood Search., , , и . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming., и . SODA, стр. 131-135. ACM/SIAM, (1991)On the power of randomization in network interdiction., , и . CoRR, (2013)A Faster Algorithm for Finding the Minimum Cut in a Directed Graph., и . J. Algorithms, 17 (3): 424-446 (1994)Faster Parametric Shortest Path and Minimum Balance Algorithms, , и . CoRR, (2002)Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem., , и . Discret. Math. Algorithms Appl., 2 (2): 189-198 (2010)Fully polynomial time approximation schemes for stochastic dynamic programs., , , , и . SODA, стр. 700-709. SIAM, (2008)Maximum Flow Problem., , и . Encyclopedia of Optimization, Springer, (2009)A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.. IPCO, том 4513 из Lecture Notes in Computer Science, стр. 240-251. Springer, (2007)