Skip to content

Commit 47f1a1e

Browse files
committed
Update README.md
1 parent 2ca1ac7 commit 47f1a1e

1 file changed

Lines changed: 14 additions & 1 deletion

File tree

README.md

Lines changed: 14 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -1,7 +1,20 @@
11
# Overview
22
This is a simple GAMS implementation that solves
33
nonograms/paint-by-number/crucipixel/picross puzzles as integer linear
4-
programs (ILP). An [efficient new ILP formulation](https://doi.org/10.1109/TG.2020.3036687) is employed, and does not proceed by coloring the cells one by one.
4+
programs (ILP). An [efficient new ILP
5+
formulation](https://doi.org/10.1109/TG.2020.3036687) is employed, and
6+
does not proceed by coloring the cells one by one.
7+
8+
We also have an analogous [Julia
9+
implementation](https://github.com/kamilkhanlab/NonogramSolver.jl)
10+
that uses JuMP.
11+
12+
If you make use of this implementation in your own work, please cite
13+
the accompanying article:
14+
15+
> Kamil A. Khan, Solving nonograms using integer programming without
16+
> coloring, *IEEE Transactions on Games*, 14(1): 56-63, 2022.
17+
> doi:[10.1109/TG.2020.3036687](https://doi.org/10.1109/TG.2020.3036687)
518
619
# Usage
720

0 commit comments

Comments
 (0)