{"id":70,"date":"2020-10-02T12:30:00","date_gmt":"2020-10-02T10:30:00","guid":{"rendered":"http:\/\/aud.ibr.cs.tu-bs.de\/?page_id=70"},"modified":"2022-03-23T16:11:07","modified_gmt":"2022-03-23T15:11:07","slug":"kapitel-3","status":"publish","type":"page","link":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-3\/","title":{"rendered":"Kapitel 3 &#8211; Branch-And-Bound"},"content":{"rendered":"\n<h2 class=\"wp-block-heading\">Inhalt<\/h2>\n\n\n\n<p>In diesem Kapitel schauen wir uns mit Branch-And-Bound ein weiteres Verfahren zur effizienteren L\u00f6sung schwerer algorithmischer Optimierungsprobleme an. Auch f\u00fcr dieses Verfahren betrachten wir unter anderem wieder die Anwendung auf Subset Sum- und Knapsack-Probleme.<\/p>\n\n\n\n\n\n\n\n<p><\/p>\n\n\n\n<h2 class=\"wp-block-heading\">Veranstaltungen<\/h2>\n\n\n<ul class=\"wp-block-latest-posts__list has-dates wp-block-latest-posts\"><li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"169\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3-300x169.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3-300x169.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3-1024x576.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3-768x432.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3-1536x865.jpg 1536w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/U3.jpg 1567w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2022\/06\/01\/uebung-3\/\">\u00dcbung 3<\/a><time datetime=\"2022-06-01T14:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">1. Juni 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser \u00dcbung besch\u00e4ftigen wir uns mit verschiedenen Beispielen zum Branch-and-Bound Verfahren. Wir schauen uns dabei auch das euklidische Travelling Salesman Problem (TSP) an und machen einen kleinen Exkurs zum Thema Linear\/Integer Programming.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"103\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch2-300x103.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch2-300x103.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch2-1024x353.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch2-768x265.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch2.jpg 1193w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2022\/05\/31\/vorlesung-6-2\/\">Vorlesung 6<\/a><time datetime=\"2022-05-31T09:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">31. Mai 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung schauen wir uns die Branch-And-Bound Methode in der Anwendung an. Zudem geben wir einige Ausblicke zu weiteren Optimierungsproblemen.<\/div><\/li>\n<li><div class=\"wp-block-latest-posts__featured-image\"><img width=\"300\" height=\"103\" src=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch-300x103.jpg\" class=\"attachment-medium size-medium wp-post-image\" alt=\"\" decoding=\"async\" style=\"max-width:400px;\" srcset=\"https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch-300x103.jpg 300w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch-1024x353.jpg 1024w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch-768x265.jpg 768w, https:\/\/aud2.ibr.cs.tu-bs.de\/wp-content\/uploads\/2021\/05\/branch.jpg 1193w\" sizes=\"(max-width: 300px) 100vw, 300px\" \/><\/div><a class=\"wp-block-latest-posts__post-title\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/2022\/05\/24\/vorlesung-5\/\">Vorlesung 5<\/a><time datetime=\"2022-05-24T09:30:00+02:00\" class=\"wp-block-latest-posts__post-date\">24. Mai 2022<\/time><div class=\"wp-block-latest-posts__post-excerpt\">In dieser Vorlesung lernen wir ein alternatives exaktes Verfahren kennen: Branch-And-Bound. Wir schauen uns dabei das Verfahren in seinen Details an und wenden es dann erneut auf das Knapsack-Problem an.<\/div><\/li>\n<\/ul>","protected":false},"excerpt":{"rendered":"<p>Inhalt In diesem Kapitel schauen wir uns mit Branch-And-Bound ein weiteres Verfahren zur effizienteren L\u00f6sung schwerer algorithmischer Optimierungsprobleme an. Auch f\u00fcr dieses Verfahren betrachten wir unter anderem wieder die Anwendung &hellip;<\/p>\n<p class=\"read-more\"> <a class=\"\" href=\"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/kapitel\/kapitel-3\/\"> <span class=\"screen-reader-text\">Kapitel 3 &#8211; Branch-And-Bound<\/span> Weiterlesen &raquo;<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"parent":30,"menu_order":0,"comment_status":"closed","ping_status":"closed","template":"","meta":{"site-sidebar-layout":"default","site-content-layout":"default","ast-global-header-display":"","ast-main-header-display":"","ast-hfb-above-header-display":"","ast-hfb-below-header-display":"","ast-hfb-mobile-header-display":"","site-post-title":"","ast-breadcrumbs-content":"","ast-featured-img":"","footer-sml-layout":"","theme-transparent-header-meta":"","adv-header-id-meta":"","stick-header-meta":"","header-above-stick-meta":"","header-main-stick-meta":"","header-below-stick-meta":"","_expiration-date-status":"","_expiration-date":1648048256,"_expiration-date-type":"draft","_expiration-date-categories":[],"_expiration-date-options":[]},"_links":{"self":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/70"}],"collection":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages"}],"about":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/types\/page"}],"author":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/comments?post=70"}],"version-history":[{"count":10,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/70\/revisions"}],"predecessor-version":[{"id":988,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/70\/revisions\/988"}],"up":[{"embeddable":true,"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/pages\/30"}],"wp:attachment":[{"href":"https:\/\/aud2.ibr.cs.tu-bs.de\/index.php\/wp-json\/wp\/v2\/media?parent=70"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}