diff options
author | William PC <w_calandrini[at]hotmail[dot]com> | 2022-11-12 10:49:57 +0700 |
---|---|---|
committer | Willy Sudiarto Raharjo <willysr@slackbuilds.org> | 2022-11-12 10:49:57 +0700 |
commit | 6888a39bbc641cf96545a8fc39c07eb802ce08c9 (patch) | |
tree | a29aa94d019ff8bc9c3fa74d16bc8ff55a325d22 /academic/penaltymodel/README | |
parent | 3f50fb224559923f9336365a90dc640e7155eff6 (diff) | |
download | slackbuilds-6888a39bbc641cf96545a8fc39c07eb802ce08c9.tar.gz slackbuilds-6888a39bbc641cf96545a8fc39c07eb802ce08c9.tar.xz |
academic/penaltymodel: Added (penalty model solver).
Signed-off-by: Willy Sudiarto Raharjo <willysr@slackbuilds.org>
Diffstat (limited to 'academic/penaltymodel/README')
-rw-r--r-- | academic/penaltymodel/README | 14 |
1 files changed, 14 insertions, 0 deletions
diff --git a/academic/penaltymodel/README b/academic/penaltymodel/README new file mode 100644 index 0000000000..be84eea915 --- /dev/null +++ b/academic/penaltymodel/README @@ -0,0 +1,14 @@ + One approach to solve a constraint satisfaction problem (CSP) using +an Ising model or a QUBO, is to map each individual constraint in +the CSP to a "small" Ising model or QUBO. This mapping is called +a penalty model. + + Imagine that we want to map an AND clause to a QUBO. In other words, +we want the solutions to the QUBO (the solutions that minimize the +energy) to be exactly the valid configurations of an AND gate. Let z = +AND(x_1, x_2). + + + Optional building mode set with environment variables: + - TESTS=yes, performs tests. Requires: dimod, python3-numpy, + networkx, python3-scipy, homebase, lapack. |