( en | de | ru )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of energy storage problems.

, , and . Discret. Optim., (2018)

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

Maximum Flow Problem., , and . Encyclopedia of Optimization, Springer, (2009)Fully polynomial time approximation schemes for stochastic dynamic programs., , , , and . SODA, page 700-709. SIAM, (2008)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)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)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)