{"id":6679,"date":"2021-04-19T14:04:21","date_gmt":"2021-04-19T12:04:21","guid":{"rendered":"https:\/\/gts-systems.com\/?p=6679"},"modified":"2024-01-09T14:23:04","modified_gmt":"2024-01-09T13:23:04","slug":"was-bedeutet-branch-and-bound","status":"publish","type":"post","link":"https:\/\/gts-systems.com\/it\/glossar\/was-bedeutet-branch-and-bound\/","title":{"rendered":"Was bedeutet Branch and Bound"},"content":{"rendered":"<div data-elementor-type=\"wp-post\" data-elementor-id=\"6679\" class=\"elementor elementor-6679\" data-elementor-post-type=\"post\">\n\t\t\t\t\t\t<section class=\"elementor-section elementor-top-section elementor-element elementor-element-0630f37 elementor-section-boxed elementor-section-height-default elementor-section-height-default\" data-id=\"0630f37\" data-element_type=\"section\" data-e-type=\"section\">\n\t\t\t\t\t\t<div class=\"elementor-container elementor-column-gap-default\">\n\t\t\t\t\t<div class=\"elementor-column elementor-col-100 elementor-top-column elementor-element elementor-element-0f3024f\" data-id=\"0f3024f\" data-element_type=\"column\" data-e-type=\"column\">\n\t\t\t<div class=\"elementor-widget-wrap elementor-element-populated\">\n\t\t\t\t\t\t<div class=\"elementor-element elementor-element-6f0a6ac elementor-widget elementor-widget-text-editor\" data-id=\"6f0a6ac\" data-element_type=\"widget\" data-e-type=\"widget\" data-widget_type=\"text-editor.default\">\n\t\t\t\t<div class=\"elementor-widget-container\">\n\t\t\t\t\t\t\t\t\t<p>I metodi Branch-and-bound sono algoritmi che risolvono un problema di ottimizzazione limitando o ramificando successivamente le variabili decisionali. Nel processo viene costruito un cosiddetto albero decisionale. Prima di ogni nuova ramificazione in un nodo, si verifica se il sottoalbero sotto questo nodo pu\u00f2 essere presente in una soluzione ottimale. A tal fine, viene risolto un problema di ottimizzazione pi\u00f9 semplice (rilassamento), che specifica un limite per la migliore soluzione possibile in questo sottoalbero.<\/p><p>Un metodo branch-and-bound consiste quindi in un processo alternato di ramificazione e calcolo dei limiti. Un buon metodo branch-and-bound \u00e8 caratterizzato dal fatto che il rilassamento pu\u00f2 essere risolto rapidamente, il rilassamento fornisce un valore vicino alla soluzione ottimale del problema originale e, in media, \u00e8 necessario generare il minor numero possibile di nodi nell'albero decisionale.<\/p><p>I metodi branch-and-bound sono i cosiddetti \u201calgoritmi esatti\u201d. Ci\u00f2 significa che forniscono sempre una soluzione ottimale se il tempo di calcolo \u00e8 sufficientemente lungo. Sfortunatamente, il tempo di calcolo necessario per ottenere la soluzione esatta aumenta esponenzialmente con il tempo di esecuzione, per cui in pratica solo alcune classi di problemi di ottimizzazione possono essere risolte con questi metodi.<\/p><p>Nella pianificazione degli itinerari, in singoli casi si utilizzano i cosiddetti metodi \u201cbranch-and-price\u201d o \u201cbranch-and-cut\u201d o una loro combinazione (\u201cbranch-and-price-and-cut\u201d). Questi metodi possono risolvere bene alcuni tipi di problemi (di grandi dimensioni) (ad esempio, i problemi dei venditori ambulanti).<\/p>\t\t\t\t\t\t\t\t<\/div>\n\t\t\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/div>\n\t\t\t\t\t<\/div>\n\t\t<\/section>\n\t\t\t\t<\/div>","protected":false},"excerpt":{"rendered":"<p>Branch-and-Bound-Verfahren sind Algorithmen, die ein Optimierungsproblem durch sukzessive Einschr\u00e4nkung bzw. Verzweigung (branching) von Entscheidungsvariablen l\u00f6sen. Dabei wird ein sogenannter Entscheidungsbaum (decision tree) aufgebaut. Vor jeder neuen Verzweigung in einem Knoten wird gepr\u00fcft, ob der Teilbaum, der unter diesem Knoten liegt, \u00fcberhaupt in einer optimalen L\u00f6sung vorkommen kann. Dazu wird ein einfacher zu l\u00f6sendes Optimierungsproblem gel\u00f6st [&hellip;]<\/p>\n","protected":false},"author":5,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[23],"tags":[],"class_list":["post-6679","post","type-post","status-publish","format-standard","hentry","category-glossar"],"yoast_head":"<!-- This site is optimized with the Yoast SEO plugin v27.3 - https:\/\/yoast.com\/product\/yoast-seo-wordpress\/ -->\n<title>Was bedeutet Branch and Bound - gts systems<\/title>\n<meta name=\"robots\" content=\"index, follow, max-snippet:-1, max-image-preview:large, max-video-preview:-1\" \/>\n<link rel=\"canonical\" href=\"https:\/\/gts-systems.com\/it\/glossario\/was-bedeutet-branch-and-bound\/\" \/>\n<meta property=\"og:locale\" content=\"it_IT\" \/>\n<meta property=\"og:type\" content=\"article\" \/>\n<meta property=\"og:title\" content=\"Was bedeutet Branch and Bound - gts systems\" \/>\n<meta property=\"og:description\" content=\"Branch-and-Bound-Verfahren sind Algorithmen, die ein Optimierungsproblem durch sukzessive Einschr\u00e4nkung bzw. Verzweigung (branching) von Entscheidungsvariablen l\u00f6sen. Dabei wird ein sogenannter Entscheidungsbaum (decision tree) aufgebaut. Vor jeder neuen Verzweigung in einem Knoten wird gepr\u00fcft, ob der Teilbaum, der unter diesem Knoten liegt, \u00fcberhaupt in einer optimalen L\u00f6sung vorkommen kann. Dazu wird ein einfacher zu l\u00f6sendes Optimierungsproblem gel\u00f6st [&hellip;]\" \/>\n<meta property=\"og:url\" content=\"https:\/\/gts-systems.com\/it\/glossario\/was-bedeutet-branch-and-bound\/\" \/>\n<meta property=\"og:site_name\" content=\"gts systems\" \/>\n<meta property=\"article:published_time\" content=\"2021-04-19T12:04:21+00:00\" \/>\n<meta property=\"article:modified_time\" content=\"2024-01-09T13:23:04+00:00\" \/>\n<meta name=\"author\" content=\"Bastian Grein\" \/>\n<meta name=\"twitter:card\" content=\"summary_large_image\" \/>\n<meta name=\"twitter:label1\" content=\"Scritto da\" \/>\n\t<meta name=\"twitter:data1\" content=\"Bastian Grein\" \/>\n\t<meta name=\"twitter:label2\" content=\"Tempo di lettura stimato\" \/>\n\t<meta name=\"twitter:data2\" content=\"1 minuto\" \/>\n<!-- \/ Yoast SEO plugin. -->","yoast_head_json":{"title":"Was bedeutet Branch and Bound - gts systems","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:\/\/gts-systems.com\/it\/glossario\/was-bedeutet-branch-and-bound\/","og_locale":"it_IT","og_type":"article","og_title":"Was bedeutet Branch and Bound - gts systems","og_description":"Branch-and-Bound-Verfahren sind Algorithmen, die ein Optimierungsproblem durch sukzessive Einschr\u00e4nkung bzw. Verzweigung (branching) von Entscheidungsvariablen l\u00f6sen. Dabei wird ein sogenannter Entscheidungsbaum (decision tree) aufgebaut. Vor jeder neuen Verzweigung in einem Knoten wird gepr\u00fcft, ob der Teilbaum, der unter diesem Knoten liegt, \u00fcberhaupt in einer optimalen L\u00f6sung vorkommen kann. Dazu wird ein einfacher zu l\u00f6sendes Optimierungsproblem gel\u00f6st [&hellip;]","og_url":"https:\/\/gts-systems.com\/it\/glossario\/was-bedeutet-branch-and-bound\/","og_site_name":"gts systems","article_published_time":"2021-04-19T12:04:21+00:00","article_modified_time":"2024-01-09T13:23:04+00:00","author":"Bastian Grein","twitter_card":"summary_large_image","twitter_misc":{"Scritto da":"Bastian Grein","Tempo di lettura stimato":"1 minuto"},"schema":{"@context":"https:\/\/schema.org","@graph":[{"@type":"Article","@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/#article","isPartOf":{"@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/"},"author":{"name":"Bastian Grein","@id":"https:\/\/gts-systems.com\/#\/schema\/person\/9ed8a105a05dc3ce47aa43796173bbd1"},"headline":"Was bedeutet Branch and Bound","datePublished":"2021-04-19T12:04:21+00:00","dateModified":"2024-01-09T13:23:04+00:00","mainEntityOfPage":{"@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/"},"wordCount":224,"publisher":{"@id":"https:\/\/gts-systems.com\/#organization"},"articleSection":["Glossar"],"inLanguage":"it-IT"},{"@type":"WebPage","@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/","url":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/","name":"Was bedeutet Branch and Bound - gts systems","isPartOf":{"@id":"https:\/\/gts-systems.com\/#website"},"datePublished":"2021-04-19T12:04:21+00:00","dateModified":"2024-01-09T13:23:04+00:00","breadcrumb":{"@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/#breadcrumb"},"inLanguage":"it-IT","potentialAction":[{"@type":"ReadAction","target":["https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/"]}]},{"@type":"BreadcrumbList","@id":"https:\/\/gts-systems.com\/glossar\/was-bedeutet-branch-and-bound\/#breadcrumb","itemListElement":[{"@type":"ListItem","position":1,"name":"Startseite","item":"https:\/\/gts-systems.com\/"},{"@type":"ListItem","position":2,"name":"Was bedeutet Branch and Bound"}]},{"@type":"WebSite","@id":"https:\/\/gts-systems.com\/#website","url":"https:\/\/gts-systems.com\/","name":"gts systems","description":"Ottimizzare ora","publisher":{"@id":"https:\/\/gts-systems.com\/#organization"},"potentialAction":[{"@type":"SearchAction","target":{"@type":"EntryPoint","urlTemplate":"https:\/\/gts-systems.com\/?s={search_term_string}"},"query-input":{"@type":"PropertyValueSpecification","valueRequired":true,"valueName":"search_term_string"}}],"inLanguage":"it-IT"},{"@type":"Organization","@id":"https:\/\/gts-systems.com\/#organization","name":"gts-systems","url":"https:\/\/gts-systems.com\/","logo":{"@type":"ImageObject","inLanguage":"it-IT","@id":"https:\/\/gts-systems.com\/#\/schema\/logo\/image\/","url":"https:\/\/gts-systems.com\/wp-content\/uploads\/2021\/03\/logogtssystems_1.svg","contentUrl":"https:\/\/gts-systems.com\/wp-content\/uploads\/2021\/03\/logogtssystems_1.svg","width":1,"height":1,"caption":"gts-systems"},"image":{"@id":"https:\/\/gts-systems.com\/#\/schema\/logo\/image\/"},"sameAs":["https:\/\/www.linkedin.com\/company\/gts-systems-and-consulting-gmbh"]},{"@type":"Person","@id":"https:\/\/gts-systems.com\/#\/schema\/person\/9ed8a105a05dc3ce47aa43796173bbd1","name":"Bastian Grein","image":{"@type":"ImageObject","inLanguage":"it-IT","@id":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","url":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","contentUrl":"https:\/\/secure.gravatar.com\/avatar\/63a51f72e38efaeedcea218995ed9a9d7cc599114900902bd6dceba42b9fd583?s=96&d=mm&r=g","caption":"Bastian Grein"}}]}},"_links":{"self":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts\/6679","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/users\/5"}],"replies":[{"embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/comments?post=6679"}],"version-history":[{"count":0,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/posts\/6679\/revisions"}],"wp:attachment":[{"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/media?parent=6679"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/categories?post=6679"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/gts-systems.com\/it\/wp-json\/wp\/v2\/tags?post=6679"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}