{"id":2433,"date":"2023-05-14T13:16:21","date_gmt":"2023-05-14T11:16:21","guid":{"rendered":"https:\/\/www.hsu-hh.de\/logistik\/?page_id=2433"},"modified":"2023-05-15T10:42:26","modified_gmt":"2023-05-15T08:42:26","slug":"how-to-code-it","status":"publish","type":"page","link":"https:\/\/www.hsu-hh.de\/logistik\/how-to-code-it","title":{"rendered":"How to code it"},"content":{"rendered":"\n<p class=\"has-medium-font-size\"><strong>The Quadratic Assignment Problem<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/www.hsu-hh.de\/logistik\/wp-content\/uploads\/sites\/655\/2023\/05\/HTCI-QAP-1.pdf\">Technical report 2023<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/www.hsu-hh.de\/logistik\/wp-content\/uploads\/sites\/655\/2023\/05\/QAP-SimpleDescent.zip\">Source code<\/a><\/li>\n<\/ul>\n\n\n\n<p><strong>Capacitated Vehicle Routing Problem<\/strong><\/p>\n\n\n\n<p>Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the Capacitated Vehicle Routing Problem: <a href=\"https:\/\/data.mendeley.com\/datasets\/s4h89j4tgp\/2\" rel='nofollow'>https:\/\/data.mendeley.com\/datasets\/s4h89j4tgp\/2<\/a><\/p>\n\n\n\n<p><strong>Steiner Tree Problem<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/data.mendeley.com\/datasets\/yf9vpkgwdr\/1\/files\/7e64f32d-13f8-46f1-993d-11c54e2e3b3b\" rel='nofollow'>Technical description<\/a><\/li>\n\n\n\n<li><a href=\"https:\/\/data.mendeley.com\/datasets\/yf9vpkgwdr\/1\" rel='nofollow'>Source code<\/a><\/li>\n<\/ul>\n\n\n\n<p><strong>VeRoLog Solver Challenge 2015<\/strong><\/p>\n\n\n\n<ul class=\"wp-block-list\">\n<li><a href=\"https:\/\/data.mendeley.com\/datasets\/662mtv6sd8\/1\" rel='nofollow'>Source code<\/a><\/li>\n<\/ul>\n\n\n\n<p><strong>MISTA 2013 Challenge<\/strong><\/p>\n\n\n\n<p><a href=\"https:\/\/data.mendeley.com\/datasets\/cw95t56hjv\/1\" rel='nofollow'>Source code<\/a><\/p>\n\n\n\n<p><strong>ROADEF\/EURO Challenge 2014<\/strong><\/p>\n\n\n\n<p>Winning <a href=\"https:\/\/data.mendeley.com\/datasets\/nc642wfw2k\/1\" rel='nofollow'>source code <\/a>of the qualification phase<\/p>\n","protected":false},"excerpt":{"rendered":"<p>The Quadratic Assignment Problem Capacitated Vehicle Routing Problem Three different implementations of a Metaheuristic (Variable Neighborhood Search Algorithm) for the Capacitated Vehicle Routing Problem: https:\/\/data.mendeley.com\/datasets\/s4h89j4tgp\/2 Steiner Tree Problem VeRoLog Solver [&hellip;]<\/p>\n","protected":false},"author":74,"featured_media":0,"parent":0,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"footnotes":""},"categories":[4],"tags":[],"class_list":["post-2433","page","type-page","status-publish","hentry","category-beitrag"],"_links":{"self":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/2433","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/users\/74"}],"replies":[{"embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/comments?post=2433"}],"version-history":[{"count":10,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/2433\/revisions"}],"predecessor-version":[{"id":2458,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/pages\/2433\/revisions\/2458"}],"wp:attachment":[{"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/media?parent=2433"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/categories?post=2433"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/www.hsu-hh.de\/logistik\/wp-json\/wp\/v2\/tags?post=2433"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}