Branch and Bound
Branch and Bound ni algorithmu kamili ya kimfumo kwa matatizo ya hisabati na ya namba kamili, iliyoanzishwa na Ailsa Land na Alison Doig mwaka 1960. Inapanga nafasi ya utafutaji kama mti wa shida ndogo ndogo, hutumia mipaka ya juu inayotokana na kulegeza ili kupunguza matawi ambayo hayawezi kuboresha suluhisho bora linalojulikana, na inahakikisha kupata suluhisho kamili la kimataifa. Ni uti wa mgongo wa visuluhishi vya kisasa vya programu mchanganyiko wa namba kamili vinavyotumiwa katika utafiti wa shughuli, upangaji wa vifaa, ratiba, na usanifu wa uhandisi.
Soma mbinu kamili
Ingia kwa akaunti ya bure ili kusoma sehemu hii.
Method map
The neighbourhood of related methods — select a node to explore.
Vyanzo
- Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497–520. DOI: 10.2307/1910129 ↗
Jinsi ya kunukuu ukurasa huu
ScholarGate. (2026, June 2). Branch and Bound. ScholarGate. https://scholargate.app/sw/optimization/branch-and-bound
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
- Upangaji wa VizuiziUboreshaji↔ compare
- Programu SanifuUboreshaji↔ compare
- Utekelezaji wa Namba KamiliUboreshaji↔ compare
Imerejelewa na
Umeona tatizo kwenye ukurasa huu? Ripoti au pendekeza marekebisho →