AI LAYER

np complete solver

  1. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric

  2. 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

  3. 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

  4. 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

  5. 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
1-5 of 5

  1. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric

  2. 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

  3. 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

  4. 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

  5. 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
1-5 of 5

  1. 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

  2. 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

  3. 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

  4. sat

    Boolean Satisfiability (SAT) Finds a mapping from variable names to boolean values such that the expression evaluates to true, or proves that the expression is always false.

    cloncaric

  5. 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
1-5 of 5