ScholarGate
Asisten

Bandingkan metode

Tinjau metode pilihan Anda berdampingan; baris yang berbeda akan disorot.

Pemrograman Kendala×Pemrograman Tujuan×
BidangOptimasiPengambilan Keputusan
KeluargaProcess / pipelineMCDM
Tahun asal20061955
PencetusRossi, van Beek & WalshCharnes, A., Cooper, W. W.
TipeDeclarative 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
Terkait38
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

Ke halaman pencarian Unduh salindia

ScholarGateBandingkan metode: Constraint Programming · GOAL-PROGRAMMING. Diakses 2026-06-15 dari https://scholargate.app/id/compare