( en | de | ru )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
A Parametric Worst Case Analysis of the LPT Heuristic for Two Uniform Machines.

, , and . Operations Research, 45 (1): 116-125 (1997)

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)Very Large-Scale Neighborhood Search., , , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)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)Faster Parametric Shortest Path and Minimum Balance Algorithms, , and . CoRR, (2002)Packing Shelves with Items that Divide the Shelves' Length: a Case of a Universal Number Partition Problem., , and . Discret. Math. Algorithms Appl., 2 (2): 189-198 (2010)Fully polynomial time approximation schemes for stochastic dynamic programs., , , , and . SODA, page 700-709. SIAM, (2008)Maximum Flow Problem., , and . Encyclopedia of Optimization, Springer, (2009)A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.. IPCO, volume 4513 of Lecture Notes in Computer Science, page 240-251. Springer, (2007)