( en | de | ru )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
Dynamic matchings and quasidynamic fractional matchings. I.

. Networks, 13 (4): 551-562 (1983)

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. You can also use the button next to the name to display some publications already assigned to the person.

James Orlin

James R B Love

Michael James

Audrein James

Katherine James

 

Other publications of authors with the same name

Faster Parametric Shortest Path and Minimum Balance Algorithms, , and . CoRR, (2002)Developing Fitter Genetic Algorithms., and . INFORMS J. Comput., 9 (3): 251-253 (1997)A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model., , , , and . INFORMS J. Comput., 19 (3): 416-428 (2007)Optimal Rounding of Instantaneous Fractional Flows Over Time., and . SIAM J. Discret. Math., 13 (2): 145-153 (2000)Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs., , , , and . SIAM J. Discret. Math., 28 (4): 1725-1796 (2014)Robust Monotone Submodular Function Maximization., , and . IPCO, volume 9682 of Lecture Notes in Computer Science, page 312-324. Springer, (2016)A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.. IPCO, volume 4513 of Lecture Notes in Computer Science, page 240-251. Springer, (2007)Very Large-Scale Neighborhood Search Techniques in Timetabling Problems., and . PATAT, volume 3867 of Lecture Notes in Computer Science, page 24-39. Springer, (2006)A Faster Strongly Polynominal Minimum Cost Flow Algorithm. STOC, page 377-387. ACM, (1988)Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-Sizing Problems When Data Is Given by an Oracle., , and . Operations Research, 60 (2): 429-446 (2012)