ScholarGate
Pembantu

Bandingkan kaedah

Semak kaedah pilihan anda secara bersebelahan; baris yang berbeza akan diserlahkan.

Pengaturcaraan Batasan×Pengaturcaraan Matlamat×
BidangPengoptimumanPembuatan Keputusan
KeluargaProcess / pipelineMCDM
Tahun asal20061955
PengasasRossi, van Beek & WalshCharnes, A., Cooper, W. W.
JenisDeclarative combinatorial optimizationMulti-objective optimisation — weighted/lexicographic goal deviation minimisation
Sumber perintisRossi, 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
Berkaitan38
RingkasanConstraint 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.
ScholarGateSet data
  1. v1
  2. 1 Sumber
  3. PUBLISHED
  1. v1
  2. 1 Sumber
  3. PUBLISHED

Pergi ke carian Muat turun slaid

ScholarGateBandingkan kaedah: Constraint Programming · GOAL-PROGRAMMING. Dicapai 2026-06-15 daripada https://scholargate.app/ms/compare