Uses of Class
org.tweetyproject.math.opt.problem.CombinatoricsProblem
-
Uses of CombinatoricsProblem in org.tweetyproject.math.examples
Modifier and TypeClassDescriptionclass
This class implements a KnapSack problemclass
implements the traveling salesman problem. -
Uses of CombinatoricsProblem in org.tweetyproject.math.opt.solver
Modifier and TypeMethodDescriptionstatic double[][]
AntColonyOptimization.getRepresentation(CombinatoricsProblem prob)
AntColonyOptimization.solve(CombinatoricsProblem prob)
solves the problem and connects the config and initializes the restIteratedLocalSearch.solve(CombinatoricsProblem prob)
SimpleGeneticOptimizationSolverCombinatorics.solve(CombinatoricsProblem prob)
Returns the solution according the problem; problem has to be minimizing (which only contains variables with defined upper and lower bounds).SimulatedAnnealing.solve(CombinatoricsProblem prob)
StochasticLocalSearch.solve(CombinatoricsProblem prob)
TabuSearch.solve(CombinatoricsProblem prob)