ScholarGate
Assistant

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 par objectifs×
DomaineOptimisationPrise de décision
FamilleProcess / pipelineMCDM
Année d'origine20061955
Auteur d'origineRossi, van Beek & WalshCharnes, A., Cooper, W. W.
TypeDeclarative combinatorial optimizationMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Source fondatriceRossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4Charnes, A., Cooper, W. W. (1955). Optimal estimation of executive compensation by linear programming. Management Science DOI ↗
AliasConstraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization
Apparentées38
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.GOAL-PROGRAMMING (Goal Programming — Minimise deviations from multiple aspiration levels) is a ranking multi-criteria decision-making (MCDM) method introduced by Charnes, A., Cooper, W. W. in 1955. It turns a decision matrix of alternatives scored on multiple criteria into a structured, reproducible result.
ScholarGateJeu de données
  1. v1
  2. 1 Sources
  3. PUBLISHED
  1. v1
  2. 1 Sources
  3. PUBLISHED

Aller à la recherche Télécharger les diapositives

ScholarGateComparer des méthodes: Constraint Programming · GOAL-PROGRAMMING. Consulté le 2026-06-15 sur https://scholargate.app/fr/compare