Comparer des méthodes
Examinez les méthodes sélectionnées côte à côte ; les lignes qui diffèrent sont mises en évidence.
| Programmation par Contraintes× | Programmation linéaire× | |
|---|---|---|
| Domaine | Optimisation | Optimisation |
| Famille | Process / pipeline | Process / pipeline |
| Année d'origine≠ | 2006 | 1947 |
| Auteur d'origine≠ | Rossi, van Beek & Walsh | George B. Dantzig |
| Type≠ | Declarative combinatorial optimization | Mathematical programming / continuous optimization |
| Source fondatrice≠ | Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4 | Dantzig, G.B. (1963). Linear Programming and Extensions. Princeton University Press. ISBN: 9780691059136 |
| Alias≠ | Constraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization | LP, linear optimization, Doğrusal Programlama (LP) |
| Apparentées≠ | 3 | 4 |
| Résumé≠ | 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. | Linear programming (LP), pioneered by George B. Dantzig in 1947, is a mathematical method for finding the best value of a linear objective function — such as minimum cost or maximum profit — subject to a set of linear inequality and equality constraints. It is the foundational technique in operations research and underlies production planning, resource allocation, logistics, diet problems, and countless other decision-making scenarios across engineering, economics, and the natural sciences. |
| ScholarGateJeu de données ↗ |
|
|