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

검색으로 이동 Download slides

ScholarGate방법 비교: Constraint Programming · GOAL-PROGRAMMING. 2026-06-15에 다음에서 검색함: https://scholargate.app/ko/compare