{"id":24,"date":"2017-08-09T02:59:19","date_gmt":"2017-08-09T02:59:19","guid":{"rendered":"http:\/\/mitmgmtfaculty.mit.edu\/jorlin\/contact\/"},"modified":"2023-02-16T19:19:45","modified_gmt":"2023-02-16T19:19:45","slug":"network-flows","status":"publish","type":"page","link":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/","title":{"rendered":"Network Flows: Theory, Algorithms, and Applications"},"content":{"rendered":"<div id=\"pl-24\"  class=\"panel-layout\" ><div id=\"pg-24-0\"  class=\"panel-grid panel-no-style\" ><div id=\"pgc-24-0-0\"  class=\"panel-grid-cell\" ><div id=\"panel-24-0-0-0\" class=\"so-panel widget widget_mit-pf-research widget_mit_pf_research panel-first-child panel-last-child\" data-index=\"0\" ><div class=\"textwidget\"><p><a href=\"https:\/\/s3.amazonaws.com\/mitsloan-php\/wp-faculty\/sites\/74\/2017\/08\/09035753\/Screen-Shot-2017-08-08-at-11.57.31-PM.png\"><img loading=\"lazy\" decoding=\"async\" class=\"alignleft wp-image-58 size-full\" src=\"https:\/\/s3.amazonaws.com\/mitsloan-php\/wp-faculty\/sites\/74\/2017\/08\/09035753\/Screen-Shot-2017-08-08-at-11.57.31-PM.png\" alt=\"\" width=\"259\" height=\"349\" srcset=\"https:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/74\/2017\/08\/09035753\/Screen-Shot-2017-08-08-at-11.57.31-PM.png 259w, https:\/\/mitsloan-php.s3.amazonaws.com\/wp-faculty\/sites\/74\/2017\/08\/09035753\/Screen-Shot-2017-08-08-at-11.57.31-PM-223x300.png 223w\" sizes=\"auto, (max-width: 259px) 100vw, 259px\" \/><\/a><\/p>\n<h3>Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin<\/h3>\n<p>This comprehensive text and reference book on network flows brings together the classic and contemporary aspects of the field\u2014providing an integrative view of theory, algorithms, and applications. This 850-page book provides an in-depth treatment of shortest path, maximum flow, minimum cost flow problems; describes over 150 applications of network flows to a variety of engineering, management, and scientific domains; contains over 800 exercises with varied difficulty levels; and provides extensive reference notes with historical contexts. This text was the winner of the 1993 Lanchester Prize for the best English language publication in Operations Research.<\/p>\n<ul>\n<li><a href=\"http:\/\/mitmgmtfaculty.mit.edu\/jorlin\/solution-manual\/\">Network Flows: Solutions of odd numbered exercises<\/a><\/li>\n<li><a href=\"https:\/\/www.dropbox.com\/s\/7q7unbllarghuxq\/Orlin-Network-Flows-errata.pdf?dl=1\">Network Flows: Errata<\/a><\/li>\n<li><a href=\"http:\/\/www.amazon.com\/Network-Flows-Theory-Algorithms-Applications\/dp\/013617549X\">Network Flows: Amazon webpage<\/a><\/li>\n<\/ul>\n<\/div><\/div><\/div><\/div><\/div>","protected":false},"excerpt":{"rendered":"<p>Ravindra K. Ahuja, Thomas L. Magnanti, and James B. Orlin This comprehensive text and reference book on network flows brings together the classic and contemporary aspects of the field\u2014providing an integrative view of theory, algorithms, and applications. This 850-page book provides an in-depth treatment of shortest path, maximum flow, minimum cost flow problems; describes over [&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-24","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 | Network Flows<\/title>\n<meta name=\"description\" content=\"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.\" \/>\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\/network-flows\/\" \/>\n<meta property=\"og:locale\" content=\"en_US\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Network Flows: Theory, Algorithms, and Applications\" \/>\n<meta property=\"og:description\" content=\"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.\" \/>\n<meta property=\"og:url\" content=\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/\" \/>\n<meta property=\"og:site_name\" content=\"James B. Orlin\" \/>\n<meta property=\"article:modified_time\" content=\"2023-02-16T19:19:45+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\/network-flows\/\",\"url\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/\",\"name\":\"MIT Sloan Faculty: Jim B. Orlin | Network Flows\",\"isPartOf\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website\"},\"datePublished\":\"2017-08-09T02:59:19+00:00\",\"dateModified\":\"2023-02-16T19:19:45+00:00\",\"description\":\"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.\",\"breadcrumb\":{\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/#breadcrumb\"},\"inLanguage\":\"en-US\",\"potentialAction\":[{\"@type\":\"ReadAction\",\"target\":[\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/\"]}]},{\"@type\":\"BreadcrumbList\",\"@id\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/#breadcrumb\",\"itemListElement\":[{\"@type\":\"ListItem\",\"position\":1,\"name\":\"Home\",\"item\":\"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/\"},{\"@type\":\"ListItem\",\"position\":2,\"name\":\"Network Flows: Theory, Algorithms, and Applications\"}]},{\"@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 | Network Flows","description":"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.","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\/network-flows\/","og_locale":"en_US","og_type":"article","og_title":"Network Flows: Theory, Algorithms, and Applications","og_description":"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.","og_url":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/","og_site_name":"James B. Orlin","article_modified_time":"2023-02-16T19:19:45+00:00","twitter_card":"summary_large_image","schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"WebPage","@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/","url":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/","name":"MIT Sloan Faculty: Jim B. Orlin | Network Flows","isPartOf":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/#website"},"datePublished":"2017-08-09T02:59:19+00:00","dateModified":"2023-02-16T19:19:45+00:00","description":"Together with MIT Sloan colleague Thomas L. Magnanti and Ravindra K. Ahuja, he has written Network Flows: Theory, Algorithms, and Applications.","breadcrumb":{"@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/#breadcrumb"},"inLanguage":"en-US","potentialAction":[{"@type":"ReadAction","target":["https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/network-flows\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Home","item":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/"},{"@type":"ListItem","position":2,"name":"Network Flows: Theory, Algorithms, and Applications"}]},{"@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\/24","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=24"}],"version-history":[{"count":17,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages\/24\/revisions"}],"predecessor-version":[{"id":268,"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/pages\/24\/revisions\/268"}],"wp:attachment":[{"href":"https:\/\/mitmgmtfaculty.mit.edu\/jorlin\/wp-json\/wp\/v2\/media?parent=24"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}