ScholarGate
アシスタント

手法を比較

選択した手法を並べて確認できます。異なる行はハイライト表示されます。

制約プログラミング×動的計画法×ゴールプログラミング×
分野最適化最適化意思決定
系統Process / pipelineProcess / pipelineMCDM
提唱年200619571955
提唱者Rossi, van Beek & WalshRichard BellmanCharnes, A., Cooper, W. W.
種類Declarative combinatorial optimizationExact combinatorial optimization via recursive decompositionMulti-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-4Bellman, R. (1957). Dynamic Programming. Princeton University Press. ISBN: 978-0-691-07951-6Charnes, 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 OptimizationDP, Bellman's Principle of Optimality, Recursive Optimization, Dinamik Programlama
関連338
概要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.Dynamic Programming (DP) is an exact optimization technique introduced by Richard Bellman in 1957 for solving multi-stage decision problems. It decomposes a complex problem into simpler, overlapping subproblems, solves each subproblem once, and stores the results to avoid redundant computation. Grounded in the Principle of Optimality, DP guarantees globally optimal solutions whenever the problem exhibits overlapping subproblems and optimal substructure.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
  1. v1
  2. 1 出典
  3. PUBLISHED

検索へ スライドをダウンロード

ScholarGate手法を比較: Constraint Programming · Dynamic Programming · GOAL-PROGRAMMING. 2026-06-15に以下より取得 https://scholargate.app/ja/compare