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/zh/compare