metaheuristic_designer.benchmarks.classic_problems

Classes

BinKnapsack(cost, value, max_weight)	This is the 0-1 Knapsack problem that consist in choosing from set of elements which have a certain cost and value to maximize the value without reaching a weight threshold.
MaxClique(adjacency_matrix)	This is the Maximum clique problem which consists on finding the size of the largest subgraph that has all its nodes interconnected (a clique).
TSP(adjacency_matrix[, name, mode])
ThreeSAT(clauses)	This is the 3-SAT problem that consist in finding if a logical expression given in 3CNF (conjunctive normal form with 3 variables per clause) is satisfiable, in other words, if there is a combination of boolean variables that makes it true.