ddo
gecode
| ddo | gecode | |
|---|---|---|
| 2 | 3 | |
| 53 | 262 | |
| - | 1.1% | |
| 7.0 | 0.0 | |
| 2 months ago | about 1 month ago | |
| Rust | C++ | |
| MIT License | GNU General Public License v3.0 or later |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
ddo
-
Best student paper at CPAIOR conference
Ps: for anyone willing to skim through the code, here it is (https://github.com/xgillard/ddo). And for those interested, a preprint of the full paper is available here (https://arxiv.org/abs/2104.11951)
-
backtrack-rs: combinatorial search library, help me improve it!
On a side note, and slightly off topic (but you might like it though), you might also be interested in the DDO crate I maintain (https://github.com/xgillard/ddo). The point of ddo slightly differs from backtrack-rs as it targets constraint optimization rather than constraint satisfaction problems. DDO is written in Rust, it is fully generic and highly efficient. (In the last paper I submitted -- but has not been accepted yet -- I show an example where it fares better than Gurobi).
gecode
-
Send+more=money and how to use forward-checking in search
Sure, there are lots but I think it should be doable. Will probably try sometime. Easiest is to make a model that fixes the lengths of the words, and just run it for different word lengths.
As a comparison, see this model solving crosswords using constraint programming. https://github.com/Gecode/gecode/blob/develop/examples/cross...
-
Testing non-trivial software (C++)
The main idea is that one defines tests that post the propagator on an initial domain, and then adding a checker for ground instances if it is a solution. The testing infrastructure runs the propagator in simulated setting, making sure that non-solutions are pruned and that solutions are found. Here is an example for the sorted constraint: sorted.cpp
What are some alternatives?
Choco - An open-source Java library for Constraint Programming
OptaPlanner - Java Constraint Solver to solve vehicle routing, employee rostering, task assignment, maintenance scheduling, conference scheduling and other planning problems.
Decider - An Open Source .Net Constraint Programming Solver
decider - A web application that assists network defenders, analysts, and researchers in the process of mapping adversary behaviors to the MITRE ATT&CK® framework.
Google Test - GoogleTest - Google Testing and Mocking Framework
biteopt - Derivative-Free Global Optimization Method (C++, Python binding)