( en | de | ru )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
Commentary - On Experimental Methods for Algorithm Simulation.

. INFORMS J. Comput., 8 (1): 21-23 (1996)

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

Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Groupings for Joint Replenishment., , and . Operations Research, 33 (4): 820-834 (1985)Recognizing Strong Connectivity in (Dynamic) Periodic Graphs and its Relation to Integer Programming., and . SODA, page 131-135. ACM/SIAM, (1991)On the power of randomization in network interdiction., , and . CoRR, (2013)A Faster Algorithm for Finding the Minimum Cut in a Directed Graph., and . J. Algorithms, 17 (3): 424-446 (1994)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 network simplex algorithm with O(n) consecutive degenerate pivots., , , and . Oper. Res. Lett., 30 (3): 141-148 (2002)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)Sensitivity analysis for shortest path problems and maximum capacity path problems in undirected graphs., , and . Math. Program., 102 (2): 355-369 (2005)