# np complete solver

### Traveling Salesman

The travelling salesman problem (TSP) asks the following question: Given a list of cities, what is the shortest possible route that visits each city exactly once and returns to the...

graph### Integer Programming

This is an algorithm for integer programming (also known as integer linear programming) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop

JaCoP### Binary Integer Programming

This is an algorithm for binary integer programming (also known as 0-1 integer programming) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop

JaCoP### Graph Coloring

This is an algorithm for graph coloring ( http://en.wikipedia.org/wiki/Graph_coloring ) built on the JaCoP Constraint Programming Solver ( https://github.com/radsz/jacop

JaCoP