( en | de | ru )

 

Disambiguation of "Orlin, James B."

Author of the publication

copydeleteadd this publication to your clipboard
On the complexity of four polyhedral set containment problems.

, and . Math. Program., 33 (2): 139-145 (1985)

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

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)Very Large-Scale Neighborhood Search., , , and . Handbook of Approximation Algorithms and Metaheuristics, Chapman and Hall/CRC, (2007)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)Faster Parametric Shortest Path and Minimum Balance Algorithms, , and . CoRR, (2002)A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model., , , , and . INFORMS J. Comput., 19 (3): 416-428 (2007)Developing Fitter Genetic Algorithms., and . INFORMS J. Comput., 9 (3): 251-253 (1997)Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs., , , , and . SIAM J. Discret. Math., 28 (4): 1725-1796 (2014)Optimal Rounding of Instantaneous Fractional Flows Over Time., and . SIAM J. Discret. Math., 13 (2): 145-153 (2000)