Process / pipelineMathematical programming
约束规划
约束规划（CP）是一种声明式优化范式，其中问题被表述为一组变量、有限域和约束，求解器系统地搜索满足所有约束的赋值。Rossi、van Beek 和 Walsh 在其 2006 年的《约束规划手册》中对其进行了全面形式化，CP 将传播式剪枝与智能回溯搜索相结合，以解决调度、规划和配置领域的组合问题。
阅读完整方法
仅限会员
登录使用免费账户登录即可阅读本节。
Method map
The neighbourhood of related methods — select a node to explore.
来源
- Rossi, F., van Beek, P., & Walsh, T. (Eds.). (2006). Handbook of Constraint Programming. Elsevier. ISBN: 978-0-444-52726-4
如何引用本页
ScholarGate. (2026, June 2). Constraint Programming. ScholarGate. https://scholargate.app/zh/optimization/constraint-programming
Which method?
Set this method beside its closest kin and read them side by side — the library lays the books on the table; the choice is yours.
Compare side by side →