( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
A Faster Strongly Polynominal Minimum Cost Flow Algorithm

. STOC, стр. 377-387. ACM, (1988)

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

 

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

An O(nm) time algorithm for finding the min length directed cycle in a graph., и . SODA, стр. 1866-1879. SIAM, (2017)A simple combinatorial algorithm for submodular function minimization., и . SODA, стр. 1230-1237. SIAM, (2009)Directed Shortest Paths via Approximate Cost Balancing., и . SODA, стр. 235-254. SIAM, (2021)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)Very Large-Scale Neighborhood Search Techniques in Timetabling Problems., и . PATAT, том 3867 из Lecture Notes in Computer Science, стр. 24-39. Springer, (2006)Robust Monotone Submodular Function Maximization., , и . IPCO, том 9682 из Lecture Notes in Computer Science, стр. 312-324. Springer, (2016)A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.. IPCO, том 4513 из Lecture Notes in Computer Science, стр. 240-251. Springer, (2007)A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model., , , , и . INFORMS J. Comput., 19 (3): 416-428 (2007)