ScholarGate
المساعد

قارن الطرق

راجع الطرق التي اخترتها جنبًا إلى جنب؛ الصفوف المختلفة مميَّزة.

البرمجة بالقيد×البرمجة بالهدف×
المجالالتحسيناتخاذ القرار
العائلةProcess / pipelineMCDM
سنة النشأة20061955
صاحب الطريقةRossi, van Beek & WalshCharnes, A., Cooper, W. W.
النوعDeclarative combinatorial optimizationMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
المصدر التأسيسيRossi, 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 ↗
الأسماء البديلةConstraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization
ذات صلة38
الملخص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.
ScholarGateمجموعة البيانات
  1. v1
  2. 1 المصادر
  3. PUBLISHED
  1. v1
  2. 1 المصادر
  3. PUBLISHED

انتقل إلى البحث تنزيل الشرائح

ScholarGateقارن الطرق: Constraint Programming · GOAL-PROGRAMMING. استُرجع بتاريخ 2026-06-15 من https://scholargate.app/ar/compare