MiniZinc2QUBO
API
Define Your Problem
MiniZinc Program:
NEW
Factorization example
int: n; array [1..n] of var 1..n: q; include "alldifferent.mzn"; constraint alldifferent(q); constraint alldifferent([ q[i] + i | i in 1..n]); constraint alldifferent([ q[i] - i | i in 1..n]); solve satisfy; output [ if fix(q[j]) == i then "Q " else ". " endif ++ if j == n then "\n" else "" endif | i,j in 1..n]
Parameter Data:
n=4
Compile Method:
Linear
Standard
Variable Encoding:
autobound
binary
atmost
progressive
sum
onehot
wall
smart
Solution (optional):
Move to Clipboard
0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 1, 0, 0, 0, 1, 0, 0
Submit