{"id":17836,"date":"2019-10-08T09:27:29","date_gmt":"2019-10-08T16:27:29","guid":{"rendered":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/?page_id=17836"},"modified":"2020-04-21T10:53:33","modified_gmt":"2020-04-21T17:53:33","slug":"network-optimization-codes","status":"publish","type":"page","link":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/network-optimization-codes\/","title":{"rendered":"Network optimization codes"},"content":{"rendered":"

[et_pb_section fb_built=”1″ _builder_version=”4.4.1″ background_image=”https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-content\/uploads\/sites\/129\/2019\/07\/shutterstock_160467593-mechanics-bkgd-16×9-hero.jpg” inner_width_tablet=”50px” inner_max_width_tablet=”50px” custom_padding=”0px|0px|0px|0px” z_index_tablet=”500″ box_shadow_horizontal_tablet=”0px” box_shadow_vertical_tablet=”0px” box_shadow_blur_tablet=”40px” box_shadow_spread_tablet=”0px”][et_pb_row column_structure=”2_3,1_3″ _builder_version=”4.4.1″ background_size=”initial” background_position=”top_left” background_repeat=”repeat” custom_padding=”100px||100px||false|false”][et_pb_column type=”2_3″ _builder_version=”3.0.47″ background_color=”rgba(0,0,0,0.5)” custom_padding=”|||” custom_padding__hover=”|||”][et_pb_text admin_label=”Page Title ” _builder_version=”4.4.1″ background_layout=”dark” custom_padding=”4px|10px|4px|10px” z_index_tablet=”500″ text_text_shadow_horizontal_length_tablet=”0px” text_text_shadow_vertical_length_tablet=”0px” text_text_shadow_blur_strength_tablet=”1px” link_text_shadow_horizontal_length_tablet=”0px” link_text_shadow_vertical_length_tablet=”0px” link_text_shadow_blur_strength_tablet=”1px” ul_text_shadow_horizontal_length_tablet=”0px” ul_text_shadow_vertical_length_tablet=”0px” ul_text_shadow_blur_strength_tablet=”1px” ol_text_shadow_horizontal_length_tablet=”0px” ol_text_shadow_vertical_length_tablet=”0px” ol_text_shadow_blur_strength_tablet=”1px” quote_text_shadow_horizontal_length_tablet=”0px” quote_text_shadow_vertical_length_tablet=”0px” quote_text_shadow_blur_strength_tablet=”1px” header_text_shadow_horizontal_length_tablet=”0px” header_text_shadow_vertical_length_tablet=”0px” header_text_shadow_blur_strength_tablet=”1px” header_2_text_shadow_horizontal_length_tablet=”0px” header_2_text_shadow_vertical_length_tablet=”0px” header_2_text_shadow_blur_strength_tablet=”1px” header_3_text_shadow_horizontal_length_tablet=”0px” header_3_text_shadow_vertical_length_tablet=”0px” header_3_text_shadow_blur_strength_tablet=”1px” header_4_text_shadow_horizontal_length_tablet=”0px” header_4_text_shadow_vertical_length_tablet=”0px” header_4_text_shadow_blur_strength_tablet=”1px” header_5_text_shadow_horizontal_length_tablet=”0px” header_5_text_shadow_vertical_length_tablet=”0px” header_5_text_shadow_blur_strength_tablet=”1px” header_6_text_shadow_horizontal_length_tablet=”0px” header_6_text_shadow_vertical_length_tablet=”0px” header_6_text_shadow_blur_strength_tablet=”1px” box_shadow_horizontal_tablet=”0px” box_shadow_vertical_tablet=”0px” box_shadow_blur_tablet=”40px” box_shadow_spread_tablet=”0px”]<\/p>\n

Network optimization codes<\/h1>\n

[\/et_pb_text][\/et_pb_column][et_pb_column type=”1_3″ _builder_version=”3.0.47″ custom_padding=”|||” custom_padding__hover=”|||”][\/et_pb_column][\/et_pb_row][\/et_pb_section][et_pb_section fb_built=”1″ _builder_version=”3.22″][et_pb_row _builder_version=”3.25″ background_size=”initial” background_position=”top_left” background_repeat=”repeat”][et_pb_column type=”4_4″ _builder_version=”3.0.47″ custom_padding=”|||” custom_padding__hover=”|||”][et_pb_text _builder_version=”4.4.1″ z_index_tablet=”500″ text_text_shadow_horizontal_length_tablet=”0px” text_text_shadow_vertical_length_tablet=”0px” text_text_shadow_blur_strength_tablet=”1px” link_text_shadow_horizontal_length_tablet=”0px” link_text_shadow_vertical_length_tablet=”0px” link_text_shadow_blur_strength_tablet=”1px” ul_text_shadow_horizontal_length_tablet=”0px” ul_text_shadow_vertical_length_tablet=”0px” ul_text_shadow_blur_strength_tablet=”1px” ol_text_shadow_horizontal_length_tablet=”0px” ol_text_shadow_vertical_length_tablet=”0px” ol_text_shadow_blur_strength_tablet=”1px” quote_text_shadow_horizontal_length_tablet=”0px” quote_text_shadow_vertical_length_tablet=”0px” quote_text_shadow_blur_strength_tablet=”1px” header_text_shadow_horizontal_length_tablet=”0px” header_text_shadow_vertical_length_tablet=”0px” header_text_shadow_blur_strength_tablet=”1px” header_2_text_shadow_horizontal_length_tablet=”0px” header_2_text_shadow_vertical_length_tablet=”0px” header_2_text_shadow_blur_strength_tablet=”1px” header_3_text_shadow_horizontal_length_tablet=”0px” header_3_text_shadow_vertical_length_tablet=”0px” header_3_text_shadow_blur_strength_tablet=”1px” header_4_text_shadow_horizontal_length_tablet=”0px” header_4_text_shadow_vertical_length_tablet=”0px” header_4_text_shadow_blur_strength_tablet=”1px” header_5_text_shadow_horizontal_length_tablet=”0px” header_5_text_shadow_vertical_length_tablet=”0px” header_5_text_shadow_blur_strength_tablet=”1px” header_6_text_shadow_horizontal_length_tablet=”0px” header_6_text_shadow_vertical_length_tablet=”0px” header_6_text_shadow_blur_strength_tablet=”1px” box_shadow_horizontal_tablet=”0px” box_shadow_vertical_tablet=”0px” box_shadow_blur_tablet=”40px” box_shadow_spread_tablet=”0px”]<\/p>\n

– Misc network optimization codes.<\/a>\u00a0<\/i>for shortest path, max-flow, assignment, and linear single commodity network flow optimization<\/p>\n

– RELAX4 code<\/a>\u00a0and\u00a0RELAX4 documentation<\/a>\u00a0<\/i>for linear single commodity network optimization.<\/p>\n

– C++ Implementation of RELAX4 code<\/a> from University\u00a0 of Pisa<\/p>\n

– AUCTION and other algorithms<\/a>\u00a0<\/i>for assignment problems.<\/p>\n

– Muliticommodity Flow<\/a>\u00a0<\/i>algorithm based on gradient projection method and a path flow formulation.<\/p>\n

– Epsilon-Relaxation method<\/a>\u00a0<\/i>(also known as the preflow push method) for solving linear and separable quadratic minimum cost network flow problems.<\/p>\n

[\/et_pb_text][\/et_pb_column][\/et_pb_row][\/et_pb_section]<\/p>\n","protected":false},"excerpt":{"rendered":"

Network optimization codes- Misc network optimization codes.\u00a0for shortest path, max-flow, assignment, and linear single commodity network flow optimization – RELAX4 code\u00a0and\u00a0RELAX4 documentation\u00a0for linear single commodity network optimization. – C++ Implementation of RELAX4 code from University\u00a0 of Pisa – AUCTION and other algorithms\u00a0for assignment problems. – Muliticommodity Flow\u00a0algorithm based on gradient projection method and a path<\/p>\n","protected":false},"author":3,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"_et_pb_use_builder":"on","_et_pb_old_content":"","_et_gb_content_width":"","footnotes":""},"class_list":["post-17836","page","type-page","status-publish","hentry"],"_links":{"self":[{"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/pages\/17836","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/users\/3"}],"replies":[{"embeddable":true,"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/comments?post=17836"}],"version-history":[{"count":0,"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/pages\/17836\/revisions"}],"wp:attachment":[{"href":"https:\/\/faculty.engineering.asu.edu\/bertsekas\/wp-json\/wp\/v2\/media?parent=17836"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}