From post

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.

 

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

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)Extended neighborhood: Definition and characterization., и . Math. Program., 101 (3): 537-559 (2004)A polynomial algorithm for integer programming covering problems satisfying the integer round-up property.. Math. Program., 22 (1): 231-235 (1982)Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs., , и . Math. Program., 102 (2): 355-369 (2005)A faster strongly polynomial time algorithm for submodular function minimization.. Math. Program., 118 (2): 237-251 (2009)Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle., , и . Operations Research, 60 (2): 429-446 (2012)A network simplex algorithm with O(n) consecutive degenerate pivots., , , и . Oper. Res. Lett., 30 (3): 141-148 (2002)