Decision Management, in practice
Towards Better Operational Decisions
The Decision Management Community brings together practitioners who design, build, operate, and improve decision systems across multiple industries.
Explore ideas, methods, tools, and real-world practice across Business Rules, Decision Modeling, Decision Optimization, Machine Learning, and Agentic AI — maintained by practitioners for practitioners.
Fresh from the community
More news → Latest news
Start here
Use the community, not just the archive
01
Solve a real challenge
Browse the archive, filter for open problems, compare existing approaches, and submit your own solution.
Explore challenges → 02Learn from working examples
Find articles, decision models, case studies, standards, tools, books, and community software in one place.
Browse resources → 03Put your work in the record
Contribute an article, challenge solution, event, tool, case study, or correction and get proper attribution.
How to contribute → Community pulse
What to look at right now
A Brick Factory
2 published solutions so far.
Open challenge →3 challenges still need a solution
Use the open-only filter to jump straight to problems where a fresh contribution can add the most value.
Find an open challenge →DecisionCAMP 2026
Online
View events → Deep dives
All articles → Latest articles
Advanced Website Design: Build the Pareto Frontier Before You Pick the Weights
An exhaustive Pareto-frontier solution to the Advanced Website Design challenge showing that five nondominated cost-value tradeoffs are missed by a simple weighted-sum objective.
Balanced Assignment with Simulated Annealing: When a Heuristic Reaches the Proven Optimum
A pair-swap simulated annealing solution to the 210-person Balanced Assignment challenge that reaches a mathematically derived lower bound of 3,370, turning a heuristic result into a proven global optimum.
Case Assignments: Preserve Option Value Before You Go Greedy
A regret-aware assignment heuristic for the April 2025 Case Assignments challenge, validated against HiGHS and exhaustive enumeration. A locally attractive greedy move consumes the only future option and makes the sequence infeasible.