ScholarGate
Assistente

Comparar métodos

Examine os métodos selecionados lado a lado; as linhas que diferem ficam destacadas.

Programação por Restrições×Goal Programming×
ÁreaOtimizaçãoTomada de decisão
FamíliaProcess / pipelineMCDM
Ano de origem20061955
Autor originalRossi, van Beek & WalshCharnes, A., Cooper, W. W.
TipoDeclarative combinatorial optimizationMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Fonte seminalRossi, 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 ↗
Outros nomesConstraint Satisfaction Programming, Constraint-Based Optimization, Kısıt Programlama, CSP Optimization
Relacionados38
ResumoConstraint 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.
ScholarGateConjunto de dados
  1. v1
  2. 1 Fontes
  3. PUBLISHED
  1. v1
  2. 1 Fontes
  3. PUBLISHED

Ir para a pesquisa Baixar slides

ScholarGateComparar métodos: Constraint Programming · GOAL-PROGRAMMING. Recuperado em 2026-06-15 de https://scholargate.app/pt/compare