Compara mètodes
Revisa els mètodes seleccionats l'un al costat de l'altre; les files que difereixen es ressalten.
| Branch and Bound× | Programació amb restriccions× | |
|---|---|---|
| Camp | Optimització | Optimització |
| Família | Process / pipeline | Process / pipeline |
| Any d'origen≠ | 1960 | 2006 |
| Autor original≠ | Ailsa Land & Alison Doig | Rossi, van Beek & Walsh |
| Tipus≠ | Exact combinatorial optimization algorithm | Declarative combinatorial optimization |
| Font seminal≠ | Land, A. H., & Doig, A. G. (1960). An automatic method of solving discrete programming problems. Econometrica, 28(3), 497–520. DOI ↗ | Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4 |
| Àlies | B&B, Land-Doig Algorithm, Implicit Enumeration, Dal ve Sınır | Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization |
| Relacionats | 3 | 3 |
| Resum≠ | Branch and Bound is a systematic exact algorithm for combinatorial and integer optimization problems, introduced by Ailsa Land and Alison Doig in 1960. It organizes the search space as a tree of subproblems, uses relaxation-derived upper bounds to prune branches that cannot improve the best known solution, and guarantees finding a globally optimal integer solution. It is the backbone of modern mixed-integer programming solvers used in operations research, logistics, scheduling, and engineering design. | Constraint Programming (CP) is a declarative optimization paradigm in which a problem is formulated as a set of variables, finite domains, and constraints, and a solver systematically searches for assignments that satisfy all constraints. Formalized comprehensively by Rossi, van Beek, and Walsh in their 2006 Handbook of Constraint Programming, CP unifies propagation-based pruning with intelligent backtracking search to tackle combinatorial problems across scheduling, planning, and configuration domains. |
| ScholarGateConjunt de dades ↗ |
|
|