{"id":16,"date":"2017-08-09T02:59:18","date_gmt":"2017-08-09T02:59:18","guid":{"rendered":"http:\/\/mitmgmtfaculty.mit.edu\/jorlin\/research-publications\/"},"modified":"2023-02-16T19:18:36","modified_gmt":"2023-02-16T19:18:36","slug":"publications","status":"publish","type":"page","link":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/","title":{"rendered":"Publications"},"content":{"rendered":"<div id=\"pl-16\"  class=\"panel-layout\" ><div id=\"pg-16-0\"  class=\"panel-grid panel-no-style\" ><div id=\"pgc-16-0-0\"  class=\"panel-grid-cell\" ><div id=\"panel-16-0-0-0\" class=\"so-panel widget widget_mit-pf-research widget_mit_pf_research panel-first-child\" data-index=\"0\" ><h2 class=\"widget-title\">Research Interests<\/h2><div class=\"textwidget\"><p>His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization as well as the development of efficient data structures for network optimization problems. \u00a0He is also interested in algorithms and heuristics in network optimization as applied to a wide range of different problems.<\/p>\n<p><a href=\"https:\/\/scholar.google.com\/citations?user=pzT_DS8AAAAJ&amp;hl=en&amp;oi=ao\" target=\"_blank\" rel=\"noopener\">See his work on Google Scholar.<\/a><\/p>\n<\/div><\/div><div id=\"panel-16-0-0-1\" class=\"so-panel widget widget_mit_faculty_research_publications panel-last-child\" data-index=\"1\" ><h3 class=\"widget-title\">Publications<\/h3>\t\t\t<ul class=\"nav nav-tabs nav-tabs--publications\">\n\t\t\t\t<li class=\"publication-type-select\">\n\t\t\t\t\t<span class=\"nav-tab--selected\">Articles<\/span>\n\t\t\t\t\t<i class='fa fa-angle-down'><\/i>\n\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t<li class=\"nav-item nav-tab active\">\n\t\t\t\t\t\t<a href=\"#articles\" class=\"active\" data-toggle=\"tab\">\n\t\t\t\t\t\t\t<div class=\"nav-dropdown-spacer\">Articles<\/div>\n\t\t\t\t\t\t<\/a>\n\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t<li class=\"nav-item nav-tab\">\n\t\t\t\t\t\t<a href=\"#working-papers\" class=\"\" data-toggle=\"tab\">\n\t\t\t\t\t\t\t<div class=\"nav-dropdown-spacer\">Working Papers<\/div>\n\t\t\t\t\t\t<\/a>\n\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t<li class=\"nav-item nav-tab\">\n\t\t\t\t\t\t<a href=\"#books\" class=\"\" data-toggle=\"tab\">\n\t\t\t\t\t\t\t<div class=\"nav-dropdown-spacer\">Books<\/div>\n\t\t\t\t\t\t<\/a>\n\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t<li class=\"nav-item nav-tab\">\n\t\t\t\t\t\t<a href=\"#other-types-of-publications\" class=\"\" data-toggle=\"tab\">\n\t\t\t\t\t\t\t<div class=\"nav-dropdown-spacer\">Other Types of Publications<\/div>\n\t\t\t\t\t\t<\/a>\n\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t<\/ul>\n\n\t\t\t<div class=\"tab-content\">\n\t\t\t\t\t\t\t\t\t<ul class=\"tab-pane active\" id=\"articles\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"From Incremental Transitive Cover to Strongly Polynomial Maximum Flow.\"<\/h4> Dadush, Daniel, James B. Orlin, Aaron Sidford, L\u00e1szl\u00f3 A. V\u00e9gh. <i>Proceedings of the Symposium on Discrete Algorithms<\/i>. Forthcoming. <a target=\"_blank\" href=https:\/\/arxiv.org\/abs\/2510.20368>arXiv<\/a>.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/ijoo.2024.0030\">\"The Strong Maximum Circulation Algorithm: A New Method for Aggregating Preference Rankings.\"<\/a><\/h4> Atkinson, Nathan, Scott Ganz, Dorit Hochbaum, and James B. Orlin. <i>INFORMS Journal on Optimization<\/i> Vol. 7, No. 2 (2025): 142-155.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/3565019\">\"Directed Shortest Paths via Approximate Cost Balancing.\"<\/a><\/h4> Orlin, James B., and L\u00e1szl\u00f3 A. V\u00e9gh. <i>Journal of the Association for Computing Machinery<\/i> Vol. 70, No. 1 (2022): 1-33. <a target=\"_blank\" href=\"https:\/\/arxiv.org\/abs\/2007.07975\">arXiv Preprint<\/a>. <a target=\"_blank\" href=\"https:\/\/epubs.siam.org\/doi\/epdf\/10.1137\/1.9781611976465.16\t\">2021 Conference Paper<\/a>.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.22001\">\"A Fast Max Flow Algorithm.\"<\/a><\/h4> Orlin, James B. and Xiaoyue Gong. <i>Networks<\/i> Vol. 77, No. 2 (2021): 287-321. <a target=\"_blank\" href=\"https:\/\/arxiv.org\/pdf\/1910.04848.pdf\">arXiv Preprint<\/a>.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s10107-018-1320-2\">\"Robust Monotone Submodular Function Maximization.\"<\/a><\/h4> Orlin, James B., Andreas S. Schulz, and Rajan Udwani. <i>Mathematical Programming<\/i> Vol. 172, No. 1\/2 (2018): 505-537.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.disopt.2017.11.001\">\"On the Complexity of Energy Storage Problems.\"<\/a><\/h4> Halman, Nir, Giacomo Nannicini, and James B. Orlin. <i>Discrete Optimization<\/i> Vol. 28, (2018): 31-53.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.dam.2017.10.011\">\"Randomized Algorithms for Finding the Shortest Negative Cost Cycle in Networks.\"<\/a><\/h4> Orlin, James B., K.Subramani, and Piotr Wojciechowki. <i>Discrete Applied Mathematics<\/i> Vol. 236, (2018): 387-394.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.21686\">\"A Characterization of Irreducible Infeasible Subsystems in Flow Networks.\"<\/a><\/h4> Joormann, Imke, James B. Orlin, and Marc E. Pfetsch. <i>Networks<\/i> Vol. 68, No. 2 (2016): 121-129.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.orl.2015.11.005\">\"On the Power of Randomization in Network Interdiction.\"<\/a><\/h4> Bertsimas, Dimitris, Ebrahim Nasrabadi and James B. Orlin. <i>Operations Research Letters <\/i> Vol. 44, No. 1 (2016): 114\u2013120.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/130925153\">\"Fully Polynomial Time Approximation Schemes for Stochastic Dynamic Programs.\"<\/a><\/h4> Halman, Nir, Diego Klabjan, Chung-Lun Li, James Orlin and David Simchi-Levi. <i>SIAM Journal on Discrete Mathematics<\/i> Vol. 28, No. 4 (2014): 1725\u20131796.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/13094774X\">\"A Computationally Fast FPTAS for Convex Stochastic Dynamic Programs.\"<\/a><\/h4> Halman, Nir, Giacamo Nannicini and James B. Orlin. <i>SIAM Journal on Optimization<\/i> Vol. 25, No. 1 (2013): 317\u2013350.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.21517\">\"Fast Algorithms for Convex Cost Flow Problems on Circles, Lines, and Trees.\"<\/a><\/h4> Orlin, James B. and Balachandran Vaidyanathan. <i>Networks<\/i> Vol. 62, No. 4 (2013): 288-296.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.ipl.2013.04.001\">\"On the hardness of finding subsets with equal average.\"<\/a><\/h4> Elkind, Edith and James B. Orlin. <i>Information Processing Letters<\/i> Vol. 113, No. 13 (2013): 477-480.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.21467\">\"Simplifications and Speedups of the Pseudoflow Algorithm.\"<\/a><\/h4> Hochbaum, Dorit S. and James B. Orlin. <i>Networks<\/i> Vol. 61, No. 1 (2013): 40-57.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1120.1113\">\"A Simple Approximation Algorithm for Computing Arrow-Debreu Prices.\"<\/a><\/h4> Ghiyasvand, Mehdi and James B. Orlin. <i>Operations Research<\/i> Vol. 60, No. 5 (2012): 1245-1248.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1110.1031\">\"Approximating the Nonlinear Newsvendor and Single-Item Stochastic Lot-sizing Problems When Data Is Given By an Oracle.\"<\/a><\/h4> Halman, Nir, James B. Orlin and David Simchi-Levi. <i>Operations Research<\/i> Vol. 60, No. 2 (2012): 429-446.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1100.0906\">\"Adaptive Data-Driven Inventory Control Policies Based on Kaplan-Meir Estimator.\"<\/a><\/h4> Huh, Woonghee Tim, Retsef Levi, Paat Rusmevichientong and James B. Orlin. <i>Operations Research<\/i> Vol. 59, No. 4 (2011): 929\u2013941.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s10479-010-0720-3\">\"Complexity Results for Equistable Graphs and Related Classes.\"<\/a><\/h4> Milani\u010d, Martin, James B. Orlin and G\u00e1bor Rudolf. <i>Annals of Operations Research<\/i> Vol. 188, No. 1 (2011): 359-370.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1109\/TNET.2011.2121918\">\"End-to-End Restorable Oblivious Routing of Hose Model Traffic.\"<\/a><\/h4> Kodialam, Muralidharan S., T. V. Lakshman, James B. Orlin and Sudipta Sengupta. <i>IEEE\/ACM Transactions on Networking<\/i> Vol. 19, No. 4 (2011): 1223-1236.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.jda.2009.03.001\">\"A Faster Algorithm for the Single Source Shortest Path Problem with Few Distinct Positive Lengths.\"<\/a><\/h4> Orlin, James B., Kamesh Madduri, K. Subramani and M. Williamson. <i>Journal of Discrete Algorithms<\/i> Vol. 8, No. 2 (2010): 189-198.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1142\/S1793830910000565\">\"Packing Shelves with Items that Divide the Shelves&#39; Length: A Case of a Universal Number Partition Problem.\"<\/a><\/h4> Dror, Moshe, James B. Orlin and Michael Zhu. <i>Discrete Mathematics, Algorithms and Applications<\/i> Vol. 2, No. 2 (2010): 189-198.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1090.0714\">\"Provably Near-Optimal LP-Based Policies for Revenue Management of Reusable Resources.\"<\/a><\/h4> Levi, Retsef, and Ana Radovanovic. <i>Operations Research<\/i> Vol. 58, No. 2 (2010): 503-507. <a target=\"_blank\" href=\"https:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?PublicationDocumentID=2290\">Appendix<\/a>.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/moor.1090.0391\">\"A Fully Polynomial Time Approximation Scheme for Single-Item Stochastic Lot-Sizing Problems with Discrete Demand.\"<\/a><\/h4> Halman, Nir, Diego Klabjan, Mohamed Mostagir, James B. Orlin and David Simchi-Levi. <i>Mathematics of Operations Research<\/i> Vol. 34, No. 3 (2009): 674-685.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1080.0607\">\"Incremental Network Optimization: Theory &amp; Algorithms.\"<\/a><\/h4> \u015eeref, Onur, Ravindra K. Ahuja and James B. Orlin. <i>Operations Research<\/i> Vol. 57, No. 3 (2009): 586-594.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1109\/TNET.2008.927257\">\"Oblivious Routing of Highly Variable Traffic in Service Overlays and IP Backbones.\"<\/a><\/h4> Kodialam, Murali T.V. Lakshman, James B. Orlin and Sudipta Sengupta. <i>IEEE\/ACM Transactions on Networking<\/i> Vol. 17, No. 2 (2009): 459-472.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s11002-008-9046-1\">\"Beyond Conjoint Analysis: Advances in Preference Measurement.\"<\/a><\/h4> Netzer, Oded, Olivier Toubia, Eric T. Bradlow, Ely Dahan, Theodoros Evgeniou, Fred M. Feinberg, Eleanor M. Feit, Sam K. Hui, Joseph Johnson, John C. Liechty, James B. Orlin and Vithala R. Rao. <i>Marketing Letters<\/i> Vol. 19, No. 3-4 (2008): 337-354.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/trsc.1080.0244\">\"The Locomotive Routing Problem.\"<\/a><\/h4> Vaidyanathan, Balachandran, Ravindra K. Ahuja and James B. Orlin. <i>Transportation Science<\/i> Vol. 42, No. 4 (2008): 492-507.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.disopt.2007.08.004\">\"On &epsilon;-optimization schemes and L-bit precision: alternative perspectives in combinatorial optimization.\"<\/a><\/h4> Orlin, James B., Andreas S. Schulz and Sudipta Sengupta. <i>Discrete Optimization<\/i> Vol. 5, No. 2 (2008): 550-561.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.cor.2006.07.001\">\"Scale-invariant Clustering with Minimum Volume Ellipsoids.\"<\/a><\/h4> Kumar, Mahesh and James B. Orlin. <i>Computers and Operations Research<\/i> Vol. 35, No. 4 (2008): 1017-1029.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.dam.2007.08.008\">\"Scheduling Malleable Tasks with Interdependent Processing Rates: Comments and Observations.\"<\/a><\/h4> Burke, Edmund K., Moshe Dror and James B. Orlin. <i>Discrete Applied Mathematics<\/i> Vol. 156, No. 5 (2008): 620-626.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.20196\">\"A Simple Method for Improving the Primal Simplex Method for the Multicommodity Flow Problem.\"<\/a><\/h4> Bompadre, Agust\u00edn and James B. Orlin. <i>Networks<\/i> Vol. 51, No. 1 (2008): 63-77.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/050636589\">\"Combinatorial Optimization with Explicit Delineation of the Ground Set by a Collection of Subsets.\"<\/a><\/h4> Dror, Moshe, and James B. Orlin. <i>SIAM Journal on Discrete Mathematics<\/i> Vol. 21, No. 4 (2007): 1019-1034.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1239\/jap\/1175267177\">\"Probabilistic Analysis of Unit Demand Vehicle Routing Problems.\"<\/a><\/h4> \u200bBompadre, Agust\u00edn, Moshe Dror and James B. Orlin. <i>Journal of Applied Probability<\/i> Vol. 44, No. 1 (2007): 259-278.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1070.0440\">\"Exact and Heuristic Methods for the Weapon Target Assignment Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Arvind Kumar, Krishna C. Jha and James B. Orlin. <i>Operations Research<\/i> Vol. 55, No. 6 (2007): 1136-1146.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/ijoc.1060.0201\">\"Very Large-Scale Neighborhood Search for the Quadratic Assignment Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Krishna C. Jha, James B. Orlin and Dushyant Sharma. <i>INFORMS Journal of Computing<\/i> Vol. 19, No. 4 (2007): 646-657.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/ijoc.1060.0193\">\"A Very Large-Scale Neighborhood Search Algorithm for the Combined Through-Fleet-Assignment Model.\"<\/a><\/h4> \u200bAhuja, R.K., Jon Goodstein, Amit Mukherjee, James B. Orlin and Dushyant Sharma. <i>INFORMS Journal of Computing<\/i> Vol. 19, No. 3 (2007): 416-428.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/mksc.1060.0213\">\"Greedoid-Based Noncompensatory Inference.\"<\/a><\/h4> Yee, Michael, Ely Dahan, John R. Hauser and James B. Orlin. <i>Marketing Science<\/i> Vol. 26, No. 4 (2007): 532-549.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1109\/JSAC.2007.070607\">\"Pre-Configuring IP-over-Optical Networks to Handle Router Failures and Unpredictable Traffic.\"<\/a><\/h4> Kodialam, Murali, T.V. Lakshman, James B. Orlin and Sudipta Sengupta. <i>IEEE Journal on Selected Areas in Communication<\/i> Vol. 25, No. 5 (2007): 934-948.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.1060.0341\">\"Lexicographically Minimum and Maximum Load Linear Programming Problems.\"<\/a><\/h4> Nace, Dritan and James B. Orlin. <i>Operations Research<\/i> Vol. 55, No. 1 (2007): 182-187.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.disopt.2006.04.002\">\"Improved Bounds for Vehicle Routing Solutions.\"<\/a><\/h4> Bompadre, Agust\u00edn, Moshe Dror and James B. Orlin. <i>Discrete Optimization<\/i> Vol. 3, No. 4 (2006): 299-316.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1142\/S0218195906002063\">\"The TSP and the Sum of its Marginal Values.\"<\/a><\/h4> \u200bDror, Moshe, Yusin Lee, James B. Orlin and Valentin Polishchuk. <i>International Journal of Computational Geometry and Applications<\/i> Vol. 16, No. 4 (2006): 333-343.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.disopt.2005.10.002\">\"A Dynamic Programming Methodology in Very Large Scale Neighborhood Search Applied to the Traveling Salesman Problem.\"<\/a><\/h4> Ergun, \u00d6zlem and James B. Orlin. <i>Discrete Optimization<\/i> Vol. 3, No. 1 (2006): 78-85.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s10732-006-5561-5\">\"Creating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: A Study on the Vehicle Routing Problem.\"<\/a><\/h4> Ergun, \u00d6zlem, James B. Orlin and Abran Steele-Feldman. <i>Journal of Heuristics<\/i> Vol. 12, No. 1-2 (2006): 1381-1231.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/j.orl.2005.01.010\">\"Fast Neighborhood Search for the Single Machine Total Weighted Tardiness Problem.\"<\/a><\/h4> Ergun, \u00d6zlem and James B. Orlin. <i>Operations Research Letters<\/i> Vol. 34, No. 1 (2006): 41-45.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/1120582.1120583\">\"On the Sum-of-Squares Algorithm for Bin Packing.\"<\/a><\/h4> \u200bCsirik, Janos, David S. Johnson, Claire Kenyon, James B. Orlin, Peter Shor and Richard R. Weber. <i>Journal of the Association of Computing Machinery<\/i> Vol. 53, No. 1 (2006): 1-65.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.jstor.org\/stable\/25769271\">\"Solving Real-Life Locomotive Scheduling Problems.\"<\/a><\/h4> Ahuja, Ravindra K., Jian Liu, James B. Orlin, Dushyant Sharma and Larry A. Shughart. <i>Transportation Science<\/i> Vol. 39, No. 4 (2005): 503-517.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s10107-004-0517-8\">\"Sensitivity Analysis for Shortest Path Problems and Maximum Capacity Path Problems in Undirected Graphs.\"<\/a><\/h4> Ramaswamy, Ramkumar, James B. Orlin and Nilopal Chakravarti. <i>Mathematical Programming<\/i> Vol. 102, No. 2 (2005): 355-369.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/S0097539703431007\">\"Approximate Local Search in Combinatorial Optimization.\"<\/a><\/h4> \u200bOrlin, James B., Abraham P. Punnen, and Andreas S. Schulz. <i>SIAM Journal on Computing<\/i> Vol. 33, No. 5 (2004): 1201-1214.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s10107-003-0497-0\">\"The Extended Neighborhood: Definition and Characterization.\"<\/a><\/h4> \u200bOrlin, James B. and Dushyant Sharma. <i>Mathematical Programming<\/i> Vol. 101, No. 3 (2004): 537-559.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.20026\">\"A Neighborhood Search Algorithm for the Combined Through and Fleet Assignment Model with Time Windows.\"<\/a><\/h4> Ahuja, Ravindra K., Jian Liu, James B. Orlin, Jon Goodstein and Amit Mukherjee. <i>Network<\/i> Vol. 44, No. 2 (2004): 160-171.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s00453-004-1085-2\">\"A Cut-Based Algorithm for the Nonlinear Dual of the Minimum Cost Network Flow Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Dorit S. Hochbaum and James B. Orlin. <i>Algorithmica<\/i> Vol. 39, No. 3 (2004): 189-208.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/mnsc.1030.0193\">\"A Multi-exchange Heuristic for the Single Source Capacitated Facility Location Problem.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, Steffano Pallottino, Maria Paola Scaparra and Maria Grazia Scutell\u00e1. <i>Management Science<\/i> Vol. 50, No. 6 (2004): 749-760.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.10072\">\"Dynamic Shortest Paths Minimizing Travel Times and Costs.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, Stefano Pallottino and Maria Grazia Scutell\u00e0. <i>Networks<\/i> Vol. 41, No. 4 (2003): 197-205.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.jstor.org\/stable\/4133968\">\"Solving the Convex Cost Integer Dual Network Flow Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Dorit S. Hochbaum and James B. Orlin. <i>Management Science<\/i> Vol. 49, No. 7 (2003): 950-964.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0167-6377(02)00236-5\">\"A Composite Neighborhood Search Algorithm for the Capacitated Minimum Spanning Tree Problem.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, and Dushyant Sharma. <i>Operations Research Letters<\/i> Vol. 31, No. 3 (2003): 185-194.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.10048\">\"Combinatorial Algorithms for Inverse Network Flow Problems.\"<\/a><\/h4> Ahuja, Ravindra K., and James B. Orlin. <i>Networks<\/i> Vol. 40, No. 4 (2002): 181-187.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0166-218X(01)00338-9\">\"A Survey of Very Large Scale Neighborhood Search Techniques.\"<\/a><\/h4> Ahuja, Ravindra K., \u00d6zlem Ergun, James B. Orlin and Abraham P. Punnen. <i>Discrete Applied Mathematics<\/i> Vol. 23, No. 1-3 (2002): 75-102.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/trsc.36.3.326.7827\">\"Minimum Time and Minimum Cost Path Problems in Street Networks with Periodic Traffic Lights.\"<\/a><\/h4> \u200bAhuja, Ravindra K., James B. Orlin, Steffano Pallotino, and Maria Grazia Scutella. <i>Transportation Science<\/i> Vol. 36, No. 3 (2002): 326-336.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0167-6377(02)00114-1\">\"A Network Simplex Algorithm with O(n) Consecutive Degenerate Pivots.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, Prabha Sharma and P.T. Sokkalingam. <i>Operations Research Letters<\/i> Vol. 30, No. 3 (2002): 141-148.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.10008\">\"On Multi-Route Maximum Flows in Networks.\"<\/a><\/h4> Aggarwal, Charu C. and James B. Orlin. <i>Networks<\/i> Vol. 39, No. 1 (2002): 43-52.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/s101070100234\">\"Multi-exchange Neighborhood Search Algorithms for the Capacitated Minimum Spanning Tree Problem.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma. <i>Mathematical Programming<\/i> Vol. 91, No. 1 (2001): 71-97.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.jstor.org\/stable\/3088575\">\"A Fast Scaling Algorithm for Minimizing Separable Convex Functions Subject to Chain Constraints.\"<\/a><\/h4> Ahuja, Ravindra and James B. Orlin. <i>Operations Research<\/i> Vol. 49, No. 5 (2001): 784-789.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.49.5.771.10607\">\"Inverse Optimization.\"<\/a><\/h4> Ahuja, Ravindra K. and James B. Orlin. <i>Operations Research<\/i> Vol. 49, No. 5 (2001): 771-783.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"New Polynomial-Time Cycle-Canceling Algorithms for Minimum Cost Flows.\"<\/h4> Sokkalingam, P.T., Ravindra K. Ahuja and James B. Orlin. <i>Networks<\/i> Vol. 36, (2000): 53-63.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/S0895480198344138\">\"Optimal Rounding of Fractional, Stationary, Dynamic Flows When Flows are Instantaneous.\"<\/a><\/h4> Fleischer, Lisa, and James B. Orlin. <i>SIAM Journal of Discrete Mathematics<\/i> Vol. 13, No. 2 (2000): 145-153.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0305-0548(99)00067-2\">\"A Greedy Genetic Algorithm for the Quadratic Assignment Problem.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin and Ashish Tiwari. <i>Computers and Operations Research<\/i> Vol. 27, No. 10 (2000): 917-934.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0969-6016(00)00009-5\">\"Very large scale neighborhood search.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin and Dushyant Sharma. <i>International Transactions in Operations Research<\/i> Vol. 7, No. 4-5 (2000): 301-317.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1006\/jagm.1999.1052\">\"A Faster Algorithm for the Inverse Spanning Tree Problem.\"<\/a><\/h4> Ahuja, Ravindra K. and James B. Orlin. <i>Journal of Algorithms<\/i> Vol. 34, No. 1 (2000): 177-193.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/mnsc.45.10.1440\">\"Algorithms for the Simple Equal Flow Problem.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, Giovanni Sechi and Paola Zuddas. <i>Management Science<\/i> Vol. 45, No. 10 (1999): 1440-1455.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/opre.47.2.291?journalCode=opre\">\"Solving Inverse Spanning Tree Problems Through Network Flow Techniques.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, and P.T. Sokkalingam. <i>Operations Research<\/i> Vol. 47, No. 2 (1999): 291-300.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01580084\">\"Diagnosing Infeasibilities in Network Flow Problems.\"<\/a><\/h4> \u200bAggarwal, Charu C., Ravindra K. Ahuja, Jianxu Hao and James B. Orlin. <i>Mathematical Programming<\/i> Vol. 81, No. 3 (1998): 263-280.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/pubsonline.informs.org\/doi\/abs\/10.1287\/opre.46.2.231?journalCode=opre\">\"A Scaling Algorithm for Multicommodity Flow Problems.\"<\/a><\/h4> Schneur, Rina R. and James B. Orlin. <i>Operations Research<\/i> Vol. 46, No. 2 (1998): 231-246.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Arc Weighting in Hidden Bicircular Networks.\"<\/h4> Shull, Randy, Alan Shuchat, James B. Orlin and Marianne L. Gardner. <i>Congressus Numerantium<\/i> Vol. 125, (1997): 161-171.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/moor.22.4.793\">\"Polynomial-Time Highest-Gain Augmenting Path Algorithms for the Generalized Circulation Problem.\"<\/a><\/h4> Golfarb, Donald, Zhiying Jin and James B. Orlin. <i>Mathematics of Operations Research<\/i> Vol. 22, No. 4 (1997): 793-802.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF02614365\">\"A Polynomial Time Primal Network Simplex Algorithm for Minimum Cost Flows.\"<\/a><\/h4> Orlin, James B. <i>Mathematical Programming<\/i> Vol. 78, No. 2 (1997): 109-129.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.45.2.226\">\"Optimized Crossover for the Independent Set Problem.\"<\/a><\/h4> Aggarwal, Charu C., James B. Orlin and Ray P. Tai. <i>Operations Research<\/i> Vol. 45, No. 2 (1997): 226-234.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0377-2217(96)00269-X\">\"Computational Investigations of Maximum Flow Algorithms.\"<\/a><\/h4> Ahuja, Ravindra K., Murali Kodialam, Ajay K. Mishra and James B. Orlin. <i>European Journal of Operations Research<\/i> Vol. 97, No. 3 (1997): 509-542.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0167-6377(96)00052-1\">\"Equivalence of Primal and Dual Simplex Algorithms for the Maximum Flow Problem.\"<\/a><\/h4> Ahuja, Ravindra K. and James B. Orlin. <i>Operations Research Letters<\/i> Vol. 20, No. 3 (1997): 101-108.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.45.1.116\">\"A Parametric Worst Case Analysis for a Machine Scheduling Problem.\"<\/a><\/h4> \u200bMireault, Paul, James B. Orlin, and Rakesh V. Vohra. <i>Operations Research<\/i> Vol. 45, No. 1 (1997): 116-125.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/ijoc.8.3.318\">\"Use of Representative Operation Counts in Computational Testings of Algorithms.\"<\/a><\/h4> Ahuja, Ravindra, K. and James B. Orlin. <i>Informs Journal of Computing<\/i> Vol. 8, No. 3 (1996): 318-330.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.ncbi.nlm.nih.gov\/pubmed\/8533086\">\"An STS-based Map of the Human Genome.\"<\/a><\/h4> Hudson, T. J., L. D. Stein, S. S. Gerety, A. B. Castle and James B. Orlin. <i>Science<\/i> Vol. 270, No. 5244 (1995): 1945-1954.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.3230250207\">\"A Capacity Scaling Algorithm for the Constrained Maximum Flow Problem.\"<\/a><\/h4> Ahuja, \u200bRavindra K. and James B. Orlin. <i>Networks<\/i> Vol. 25, No. 2 (1995): 89-98.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/S0097539791199334\">\"Improved Algorithms for Bipartite Network Flow.\"<\/a><\/h4> Ahuja, Ravindra K., James B. Orlin, Clifford Stein and Robert E. Tarjan. <i>SIAM Journal of Computing<\/i> Vol. 23, (1994): 906-933.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1006\/jagm.1994.1043\">\"A Faster Algorithm for Finding a Minimum Cut in a Graph.\"<\/a><\/h4> Hao, Jianxu and James B. Orlin. <i>Journal of Algorithms<\/i> Vol. 17, No. 3 (1994): 424-446.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01582057\">\"A Technique for Speeding up the Solution of the Lagrangean Dual.\"<\/a><\/h4> Bertsimas, Dimitris and James B. Orlin. <i>Mathematical Programming<\/i> Vol. 63, No. 1 (1994): 23-46.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0167-6377(93)90068-R\">\"Parallel Algorithms for the Assignment and Minimum Cost Flow Problems.\"<\/a><\/h4> \u200bOrlin, James B. and Clifford Stein. <i>Operations Research Letters<\/i> Vol. 14, No. 4 (1993): 181-186.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.3230230607\">\"Finding Minimum Cost to Time Ratio Cycles with Small Integral Transit Times.\"<\/a><\/h4> Hartmann, Mark and James B. Orlin. <i>Networks<\/i> Vol. 23, No. 6 (1993): 567-574.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01580615\">\"Polynomial Dual Network Simplex Algorithms.\"<\/a><\/h4> Orlin, James B., Serge A. Plotkin and \u00c9va Tardos. <i>Mathematical Programming<\/i> Vol. 60, No. 1-3 (1993): 255-276.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.jstor.org\/stable\/171782\">\"A Faster Strongly Polynomial Algorithm for the Minimum Cost Flow Problem.\"<\/a><\/h4> Orlin, James B. <i>Operations Research<\/i> Vol. 41, No. 2 (1993): 338-350.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01581235\">\"Determination of Optimal Vertices from Feasible Solutions in Unimodular Linear Programming.\"<\/a><\/h4> Mizuno, Shinji, Romesh Saigal and James B. Orlin. <i>Mathematical Programming<\/i> Vol. 59, No. 1-3 (1993): 23-32.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0166-218X(93)90243-H\">\"Recognizing Hidden Bicircular Networks.\"<\/a><\/h4> Shull, Randy, Alan H. Shuchat, James B. Orlin and Marianne L. Gardner. <i>Discrete Applied Mathematics<\/i> Vol. 41, No. 1 (1993): 13-53.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01586040\">\"New Scaling Algorithms for the Assignment and Minimum Cycle Mean Problems.\"<\/a><\/h4> Orlin, James B. and Robert K. Ahuja. <i>Mathematical<\/i> Vol. 54, No. 1-3 (1992): 41-56.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01585705\">\"Finding Minimum-Cost Flows by Double Scaling.\"<\/a><\/h4> Ahuja, Ravindra K., Andrew V. Goldberg, James B. Orlin and Robert E. Tarjan. <i>Mathematical Programming<\/i> Vol. 53, No. 1-3 (1992): 243-266.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF00183045\">\"Single Transferable Vote Resists Strategic Voting.\"<\/a><\/h4> Bartholdi III, John J. and James B. Orlin. <i>Social Choice and Welfare<\/i> Vol. 8, No. 4 (1991): 341-354.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/1520-6750(199106)38:3<413::AID-NAV3220380310>3.0.CO;2-J\">\"Distance-Directed Algorithms for Maximum Flow and Parametric Maximum Flow Problems.\"<\/a><\/h4> Ahuja, Ravindra K. and James B. Orlin. <i>Naval Research Logistics<\/i> Vol. 38, No. 3 (1991): 413-430.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/1033048\">\"Recent Advances in Network Flows.\"<\/a><\/h4> Ahuja, Ravindra K., Thomas L. Magnanti and James B. Orlin. <i>Siam Review<\/i> Vol. 33, No. 2 (1991): 175-219.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.3230210206\">\"Faster Parametric Shortest Path and Minimum Balance Algorithms.\"<\/a><\/h4> Young, Neal E., Robert E. Tarjan and James B. Orlin. <i>Networks<\/i> Vol. 21, No. 2 (1991): 205-221.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01580854\">\"Solving the Linear Matroid Parity Problem as a Sequence of Matroid Intersection Problems.\"<\/a><\/h4> Orlin, James B. and John H. Vande Vate. <i>Mathematical Programming<\/i> Vol. 47, No. 1-3 (1990): 81-106.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/77600.77615\">\"Faster Algorithms for the Shortest Path Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Kurt Mehlhorn, James B. Orlin and Robert E. Tarjan. <i>Journal of the Association of Computing Machinery<\/i> Vol. 37, No. 2 (1990): 213-223.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.37.5.748\">\"A Fast and Simple Algorithm for the Maximum Flow Problem.\"<\/a><\/h4> Ahuja, Ravindra K. and James B. Orlin. <i>Operations Research<\/i> Vol. 37, No. 5 (1989): 748-759.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Improved Time Bounds for the Maximum Flow Problem.\"<\/h4> Ahuja, Ravindra K., James B. Orlin and Robert E. Tarjan. <i>SIAM Journal of Computing<\/i> Vol. 18, No. 5 (1989): 939-954.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0166-218X(89)90017-6\">\"The Structure of Bases in Bicircular Matroids.\"<\/a><\/h4> \u200bShull, Randy, James B. Orlin, Alan H. Shuchat and Marianne L. Gardner. <i>Discrete Applied Mathematics<\/i> Vol. 23, No. 3 (1989): 267-283.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01580770\">\"Parametric Linear Programming and Anti-Cycling Pivoting Rules.\"<\/a><\/h4> Magnanti, Thomas L. and James B. Orlin. <i>Mathematical Programming<\/i> Vol. 41, No. 1-3 (1988): 317-325.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0167-6377(86)90011-8\">\"A Dual Version of Tardos&#39;s Algorithm for Linear Programming.\"<\/a><\/h4> Orlin, James B. <i>Operations Research Letters<\/i> Vol. 5, No. 5 (1986): 221-226.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BFb0121050\">\"On the Simplex Algorithm for Networks and Generalized Networks.\"<\/a><\/h4> Orlin, James B. <i>Mathematical Programming Study<\/i> Vol. 24, (1985): 166-178.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01582241\">\"On the Complexity of Four Polyhedral Set containment Problems.\"<\/a><\/h4> Freund, Robert M., and James B. Orlin. <i>Mathematical Programming<\/i> Vol. 33, No. 2 (1985): 133-135.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.33.5.1154\">\"Some Very Easy Knapsack\/Partition Problems.\"<\/a><\/h4> Orlin, James B. <i>Operations Research<\/i> Vol. 33, No. 5 (1985): 1154-1160.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.33.4.820\">\"Consecutive Optimizers for a Partitioning Problem with Applications to Optimal Inventory Grouping for Joint Replenishment.\"<\/a><\/h4> \u200bChakravarty, A. K., James B. Orlin and Uriel G. Rothblum. <i>Operations Research<\/i> Vol. 33, No. 4 (1985): 820-832.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0167-6377(85)90041-0\">\"A Finitely Converging Cutting Plane Technique.\"<\/a><\/h4> Orlin, James B. <i>Operations Research Letters<\/i> Vol. 4, No. 1 (1985): 1-4.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01585655\">\"Computing Optimal Scalings by Parametric Network Algorithms.\"<\/a><\/h4> Orlin, James B, and Uriel G. Rothblum. <i>Mathematical Programming<\/i> Vol. 32, No. 1 (1985): 1-10.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1002\/net.3230150107\">\"A Minimum Concave-Cost Dynamic Network Flow Problem with an Application to Lot-Sizing.\"<\/a><\/h4> Graves, Stephen C. and James B. Orlin. <i>Networks<\/i> Vol. 15, No. 1 (1985): 59-71.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0196-6774(85)90016-1\">\"NP-completeness for Minimizing Maximum Edge Length in Grid Embeddings.\"<\/a><\/h4> Miller, Zevi and James B. Orlin. <i>Journal of Algorithms<\/i> Vol. 6, No. 1 (1985): 10-16.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/moor.9.2.190\">\"Minimum Convex Cost Dynamic Network Flows.\"<\/a><\/h4> Orlin, James B. <i>Mathematics of Operations Research<\/i> Vol. 9, No. 2 (1984): 190-207.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Dynamic Matchings and Quasidynamic Fractional Matchings I.\"<\/h4> Orlin, James B. <i>Networks<\/i> Vol. 13, No. 4 (1983): 551-562.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/net.3230130408\/abstract\">\"Dynamic Matchings and Quasidynamic Fractional Matchings II.\"<\/a><\/h4> Orlin, James B. <i>Networks<\/i> Vol. 13, No. 4 (1983): 563-580.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF02591946\">\"Maximum Throughput Dynamic Network Flows.\"<\/a><\/h4> Orlin, James B. <i>Mathematical Programming<\/i> Vol. 27, No. 2 (1983): 214-223.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/BF01581039\">\"A Polynomial Algorithm for Integer Programming Covering Problems Satisfying the Integer Round-up Property.\"<\/a><\/h4> Orlin, James B. <i>Mathematical Programming<\/i> Vol. 22, No. 1 (1982): 231-235.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.30.5.1018\">\"A Partitioning Problem with Additive Objective with an Application to Optimal Inventory Grouping for Joint Replenishment.\"<\/a><\/h4> Chakravarty, A. K., James B. Orlin and Uriel G. Rothblum. <i>Operations Research<\/i> Vol. 30, No. 5 (1982): 1018-1022.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.30.4.760\">\"Minimizing the Number of Vehicles to Meet a Fixed Periodic Schedule: An Application of Periodic Posets.\"<\/a><\/h4> Orlin, James B. <i>Operations Research<\/i> Vol. 30, No. 4 (1982): 760-776.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0166-218X(89)90011-5\">\"An O(n2) Algorithm for Coloring Proper Circular Arc Graphs.\"<\/a><\/h4> Orlin, James B., Maurizio A. Bonuccelli and Daniel P. Bovet. <i>SIAM Journal on Algebraic and Discrete Methods<\/i> Vol. 2, No. 2 (1981): 88-93.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0166-218X(81)90026-3\">\"Parametric Shortest Path Algorithms with an Application to Cyclic Staffing.\"<\/a><\/h4> Karp, Richard M. and James B. Orlin. <i>Discrete Applied Mathematics<\/i> Vol. 3, No. 1 (1981): 37-45.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1287\/opre.28.5.1074\">\"Cyclic Scheduling via Integer Programs with Circular Ones.\"<\/a><\/h4> Bartholdi III, John J., James B. Orlin and H. Donald Ratliff. <i>Operations Research<\/i> Vol. 28, No. 5 (1980): 1074-1085.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/0095-8956(78)90038-2\">\"Line-digraphs, Arborescences, and theorems of Tutte and Knuth.\"<\/a><\/h4> Orlin, James B. <i>Journal of Combinatorial Theory, Series B<\/i> Vol. 25, No. 2 (1978): 187-198.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/1385-7258(77)90055-5\">\"Contentment in Graph Theory: Covering Graphs with Cliques.\"<\/a><\/h4> Orlin, James B. <i>Indigationes Mathematicae<\/i> Vol. 80, No. 5 (1977): 406-424.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1016\/S0167-5060(08)70749-0\">\"The Minimal Integral Separator of a Threshold Graph.\"<\/a><\/h4> Orlin, James B. <i>Annals of Discrete Mathematics<\/i> Vol. 1, (1977): 415-419.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t<\/ul><!-- @end .tab-pane -->\n\t\t\t\t\t\t\t\t\t<ul class=\"tab-pane \" id=\"working-papers\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/arxiv.org\/abs\/1312.4075\">\"Robust Optimization with Incremental Recourse.\"<\/a><\/h4> Nasrabadi, Ebrahim, and James B. Orlin, Working Paper. December 2014.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t<\/ul><!-- @end .tab-pane -->\n\t\t\t\t\t\t\t\t\t<ul class=\"tab-pane \" id=\"books\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/a.co\/3nF6m9F\"><i>Network Flows: Theory, Algorithms, and Applications.<\/i><\/a><\/h4> Ahuja, Ravindra K., Thomas Magnanti, and James B. Orlin. Englewood Cliffs, NJ: Prentice Hall, 1993.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t<\/ul><!-- @end .tab-pane -->\n\t\t\t\t\t\t\t\t\t<ul class=\"tab-pane \" id=\"other-types-of-publications\">\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-030-86838-3_19\">\"Linearizable Special Cases of the Quadratic Shortest Path Problem.\"<\/a><\/h4> Eranda \u00c7ela, Bettina Klinz, Stefan Lendl, James B. Orlin, Gerhard J. Woeginger, and Lasse Wulf. In <i>Proceedings of the 2021 International Workshop on Graph-Theoretic Concepts in Computer Science<\/i>, Switzerland: September 2021.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/1.9781611976014.12\">\"Distributionally Robust Max Flows.\"<\/a><\/h4> \u200b\u200bLouis L. Chen, Will Ma, James B. Orlin, and David Simchi-Levi. In <i>SIAM Symposium on Simplicity in Algorithms<\/i>, edited by Inge Li G\u00f8rtz and Martin Farach-Colton. 2020.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Maximum Flows.\"<\/h4> Orlin, James B., and Ravindra K. Ahuja. In <i>Handbook of Discrete and Combinatorial Mathematics<\/i>, edited by Kenneth H. Rosen, 759-768. Boca Raton, FL: CRC Press, 2018.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Minimum Cost Flows.\"<\/h4> Orlin, James B., and Ravindra K. Ahuja. In <i>Handbook of Discrete and Combinatorial Mathematics<\/i>, edited by Kenneth H. Rosen, 769-778. Boca Raton, FL: CRC Press, 2018.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"https:\/\/scholar.google.com\/scholar?oi=bibs&cluster=11662335068303864654&btnI=1&hl=en\">\"Minimum Spanning Trees.\"<\/a><\/h4> Orlin, James B, and Ravindra K. Ahuja. In <i>Handbook of Discrete and Combinatorial Mathematics<\/i>, edited by Kenneth H. Rosen, 726-732. Boca Raton, FL: CRC Press, 2018.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"Shortest Paths.\"<\/h4> Orlin, James B., and Ravindra K. Ahuja. In <i>Handbook of Discrete and Combinatorial Mathematics<\/i>, edited by Kenneth H. Rosen, 748-758. Boca Raton, FL: CRC Press, 2018.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/1.9781611974782.122\">\"An O(nm) Time Algorithm for Finding the Min Length Directed Cycle in a Graph.\"<\/a><\/h4> James B. Orlin and Antonio Sede\u00f1o-Noda. In <i>Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms<\/i>, edited by Philip N. Klein. Barcelona, Spain: January 2017.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-319-33461-5_26\">\"Robust Monotone Submodular Function Maximization.\"<\/a><\/h4> Rajan Udwani, Andreas Schulz, and James B. Orlin. In <i>Proceedings of the The 18th Conference on Integer Programming and Combinatorial Optimization (IPCO XVIII)<\/i>, Li\u00e8ge, Belgium: June 2016.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/2488608.2488705\">\"Max Flows in O(nm) Time or Better.\"<\/a><\/h4> James B. Orlin. In <i>STOC '13 Proceedings of the Forty-fifth Annual ACM Symposium on Theory of Computing<\/i>, New York, NY: June 2013.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.amazon.com\/Profiles-Operations-Research-Innovators-International\/dp\/1441962808\">\"D. Ray Fulkerson.\"<\/a><\/h4> \u200bBland, Robert G. and James B. Orlin. In <i>Profiles in Operations Research<\/i>, 509-527. New York, NY: Springer Science, 2011.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/1806689.1806731\">\"Improved Algorithms for Computing Fisher&#39;s Market Clearing Prices.\"<\/a><\/h4> James B. Orlin. In <i> Proceedings of the 2010 Symposium on the Theory of Computing.<\/i>, New York, NY: June 2010.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1137\/1.9781611973068.133\">\"A Simple Combinatorial Algorithm for Submodular Function Minimization.\"<\/a><\/h4> Satoru Iwata and James B. Orlin. In <i>Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms<\/i>, edited by Claire Mathieu. Philadelphia, PA: December 2009.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-642-03367-4_45\">\"Integer Programming: Optimization and Evaluation Are Equivalent.\"<\/a><\/h4> James B. Orlin, Abraham P. Punnen and Andreas S. Schulz. In <i>Proceedings of the 11th International Symposium on Algorithms and Data Structures<\/i>, edited by C.D. T\u00f3th, F. Dehne, J.-R. Sack, and M. Gavrilova. Berlin, Germany: August 2009.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.amazon.com\/Handbook-Military-Industrial-Engineering-Innovation\/dp\/1420066285\">\"Exact and Heuristic Methods for the Weapon Target Assignment Problem.\"<\/a><\/h4> Ahuja, Ravindra K., Jon Goodstein, Jian Liu, Amit Mukherjee, James B. Orlin and Dushyant Sharma. In <i>Handbook of Military Industrial Engineering<\/i>, 7-8. Boca Raton, Florida: CRC Press, 2009.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-540-68891-4_17\">\"A Fast, Simpler Algorithm for the Matroid Parity Problem.\"<\/a><\/h4> James B. Orlin. In <i>Integer Programming and Combinatorial Optimization: 13th International Conference, IPCO 2008<\/i>, edited by Alessandro Panconesi, Andrea Lodi, and Giovanni Rinaldi. Berlin, Germany: May 2008.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-540-77345-0_2\">\"Very Large Scale Neighborhood Search Techniques in Timetabling Problems.\"<\/a><\/h4> Carol Myers and James B. Orlin. In <i>Proceedings of Practice and Theory of Automated Timetabling VI<\/i>, edited by Edmund K. Burke and Hana Rudov\u00e1. Berlin, Germany: September 2007.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-3-540-72792-7_19\">\"A Faster Strongly Polynomial Time Algorithm for Submodular Function Minimization.\"<\/a><\/h4> James B. Orlin. In <i> Integer Programming and Combinatorial Optimization: Proceedings of the 12th International IPCO Conference. Lecture Notes in Computer Science<\/i>, edited by David P. Williamson and Matteo Fischetti. Berlin, Germany: June 2007.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.amazon.com\/Handbook-Approximation-Algorithms-Metaheuristics-Information\/dp\/1584885505\">\"Very Large-Scale Neighborhood Search: Theory, Algorithms and Applications.\"<\/a><\/h4> \u200bAhuja, Ravindra K., \u00d6zlem Ergun, James B. Orlin and Abraham P. Punnen. In <i>Handbook of Approximation Algorithms and Metaheuristics<\/i>, edited by Teofilo F. Gonzalez , 20-21. Boca Raton, Florida: Chapman & Hall, 2007.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1109\/INFOCOM.2006.181\">\"A Versatile Scheme for Routing Highly Variable Traffic in Service Overlays and IP Backbones.\"<\/a><\/h4> M. Kodialam, T.V. Lakshman, James B. Orlin and Sudipta Sengupta. In <i>INFOCOM 2006 25th IEEE International Conference on Computer Communications<\/i>, New York, NY: April 2006.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/11496915_32\">\"Using Grammars to Generate Very Large Scale Neighborhoods for the Traveling Salesman Problem and Other Sequencing Problems.\"<\/a><\/h4> Agustin \u200bBompadre and James B. Orlin. In <i>Proceedings of the 11th International IPCO Conference<\/i>, edited by Michael J\u00fcnger and Volker Kaibel. Berlin, Germany: June 2005.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-1-4757-3752-3\">\"Solving Multi-Criteria Combined Through Fleet Assignment Models.\"<\/a><\/h4> Ahuja, Ravindra K., Jian Liu, Jon Goodstein, Amit Mukherjee, James B. Orlin and Dushyant Sharma. In <i>Operations Research in Space and Air<\/i>, 233-256. New York, NY: Springer US, 2003.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/3-540-45749-6_23\">\"Branch and Bound Algorithms for the Test Cover Problem.\"<\/a><\/h4> Koen M. J. De Bontridder, B. J. Lageweg, Jan K. Lenstra, James B. Orlin and Leen Stougie. In <i>Proceedings of the 10th Annual European Symposium on Algorithms (ESA)<\/i>, edited by Rajeev Raman and Rolf M\u00f6hring. Berlin, Germany: September 2002.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.amazon.com\/Network-Handbooks-Operations-Research-Management\/dp\/0444892923\">\"Applications of Network Optimization.\"<\/a><\/h4> \u200bAhuja, Ravindra K., Thomas L. Magnanti, James B. Orlin, and M.R. Reddy. In <i>Handbooks in Operations Research and Management Science, Volume 7: Network Models<\/i>, 1-84. Amsterdam, The Netherlands: Elsevier, North Holland, 1995.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1007\/978-1-4613-3632-7\">\"On Very Large Scale Assignment Problems.\"<\/a><\/h4> Hager, William W., D. W. Hearn and Panos M. Pardalos. In <i>Large Scale Optimization: State of the Art<\/i>, 206-244. Dordrecht, The Netherlands: Kluwer Academic Publishers, 1994.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4>\"A Technique for Speeding up the Solution of the Lagrangean Dual.\"<\/h4> Dimitris Bertsimas, and James B. Orlin. In <i>Proceedings of the Second Conference on Integer Programming and Combinatorial Optimization<\/i>, edited by Egon Balas, Gerard Cornujelos, and Rajgopal Kannan. Pittsburgh, PA: May 1992.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.amazon.com\/Optimization-Handbooks-Operations-Research-Management\/dp\/0444872841\">\"Network Flows.\"<\/a><\/h4> \u200bAhuja, Ravindra K., Thomas L. Magnanti and James B. Orlin. In <i>Handbooks in Operations Research and Management Science, Volume 1: Optimization<\/i>, 211-369. Amsterdam, The Netherlands: North Holland, 1989.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/www.sciencedirect.com\/science\/book\/9780125667807\">\"Algorithms for Problems on Dynamic\/Periodic Graphs.\"<\/a><\/h4> Orlin, James B. In <i>Progress in Combinatorial Optimization<\/i>, edited by William Pulleyblank , 273-294. Toronto, Canada: Academic Press, 1984.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/mitsloan.mit.edu\/shared\/ods\/documents\/?DocumentID=4027\">\"Dynamic Network Flows.\"<\/a><\/h4> Orlin, Jim B. PhD diss., Stanford University, 1981.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t\t\t<li class=\"wpb_text_column wpb_content_element\">\n\t\t\t\t\t\t\t\t<div class=\"wpb_wrapper\">\n\t\t\t\t\t\t\t\t\t<h4><a target=\"_blank\" href=\"http:\/\/doi.org\/10.1145\/800076.802475\">\"The Complexity of Dynamic Languages and Dynamic Optimization Problems.\"<\/a><\/h4> James B. Orlin. In <i>STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing<\/i>, New York, NY: May 1981.\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t\t\t\t<\/li>\n\t\t\t\t\t\t\t\t\t\t\t<\/ul><!-- @end .tab-pane -->\n\t\t\t\t\t\t\t<\/div><!-- @end .tab-content -->\n\n\t\t<\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"<p>Research InterestsHis research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization as well as the development of efficient data structures for network optimization problems. \u00a0He is also interested in algorithms and heuristics in network optimization as applied to a wide range of different problems. See his work [&hellip;]<\/p>\n","protected":false},"author":1,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"template-two-column.php","meta":{"_exactmetrics_skip_tracking":false,"_exactmetrics_sitenote_active":false,"_exactmetrics_sitenote_note":"","_exactmetrics_sitenote_category":0,"footnotes":""},"class_list":["post-16","page","type-page","status-publish","hentry"],"yoast_head":"<!-- This site is optimized with the Yoast SEO Premium plugin v24.0 (Yoast SEO v25.8) - https:\/\/yoast.com\/wordpress\/plugins\/seo\/ -->\n<title>MIT Sloan Faculty: Jim B. Orlin | Publications<\/title>\n<meta name=\"description\" content=\"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.\" \/>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Publications\" \/>\n<meta property=\"og:description\" content=\"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/\" \/>\n<meta property=\"og:site_name\" content=\"James B. Orlin\" \/>\n<meta property=\"article:modified_time\" content=\"2023-02-16T19:18:36+00:00\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<script type=\"application\/ld+json\" class=\"yoast-schema-graph\">{\"@context\":\"https:\/\/schema.org\",\"@graph\":[{\"@type\":\"WebPage\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/\",\"url\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/\",\"name\":\"MIT Sloan Faculty: Jim B. Orlin | Publications\",\"isPartOf\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website\"},\"datePublished\":\"2017-08-09T02:59:18+00:00\",\"dateModified\":\"2023-02-16T19:18:36+00:00\",\"description\":\"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.\",\"breadcrumb\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Publications\"}]},{\"@type\":\"WebSite\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website\",\"url\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/\",\"name\":\"James B. Orlin\",\"description\":\"MIT Personal Faculty\",\"potentialAction\":[{\"@type\":\"SearchAction\",\"target\":{\"@type\":\"EntryPoint\",\"urlTemplate\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/?s={search_term_string}\"},\"query-input\":{\"@type\":\"PropertyValueSpecification\",\"valueRequired\":true,\"valueName\":\"search_term_string\"}}],\"inLanguage\":\"en-US\"}]}<\/script>\n<!-- \/ Yoast SEO Premium plugin. -->","yoast_head_json":{"title":"MIT Sloan Faculty: Jim B. Orlin | Publications","description":"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.","robots":{"index":"index","follow":"follow","max-snippet":"max-snippet:-1","max-image-preview":"max-image-preview:large","max-video-preview":"max-video-preview:-1"},"canonical":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/","og_locale":"en_US","og_type":"article","og_title":"Publications","og_description":"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.","og_url":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/","og_site_name":"James B. Orlin","article_modified_time":"2023-02-16T19:18:36+00:00","twitter_card":"summary_large_image","schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/","url":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/","name":"MIT Sloan Faculty: Jim B. Orlin | Publications","isPartOf":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website"},"datePublished":"2017-08-09T02:59:18+00:00","dateModified":"2023-02-16T19:18:36+00:00","description":"His research has focused on the design and analysis of efficient algorithms for network optimization and combinatorial optimization.","breadcrumb":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/publications\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/"},{"@type":"ListItem","position":2,"name":"Publications"}]},{"@type":"WebSite","@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website","url":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/","name":"James B. Orlin","description":"MIT Personal Faculty","potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"en-US"}]}},"_links":{"self":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages\/16","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/comments?post=16"}],"version-history":[{"count":16,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages\/16\/revisions"}],"predecessor-version":[{"id":266,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages\/16\/revisions\/266"}],"wp:attachment":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/media?parent=16"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}