Uses of Class
org.tweetyproject.math.opt.problem.CombinatoricsProblem

Packages that use CombinatoricsProblem

Package	Description
org.tweetyproject.math.examples
org.tweetyproject.math.opt.solver

Uses of CombinatoricsProblem in org.tweetyproject.math.examples

Subclasses of CombinatoricsProblem in org.tweetyproject.math.examples

Modifier and Type	Class	Description
class	KnapSack	This class implements a KnapSack problem
class	TravelingSalesman	implements the traveling salesman problem.

Uses of CombinatoricsProblem in org.tweetyproject.math.opt.solver

Methods in org.tweetyproject.math.opt.solver with parameters of type CombinatoricsProblem

Modifier and Type	Method	Description
static double[][]	AntColonyOptimization.getRepresentation(CombinatoricsProblem prob)	Return represntation
ArrayList<ElementOfCombinatoricsProb>	AntColonyOptimization.solve(CombinatoricsProblem prob)	solves the problem and connects the config and initializes the rest
ArrayList<ElementOfCombinatoricsProb>	IteratedLocalSearch.solve(CombinatoricsProblem prob)	Solves the given combinatorics problem using the Iterated Local Search (ILS) algorithm.
ArrayList<ElementOfCombinatoricsProb>	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).
ArrayList<ElementOfCombinatoricsProb>	SimulatedAnnealing.solve(CombinatoricsProblem prob)
ArrayList<ElementOfCombinatoricsProb>	StochasticLocalSearch.solve(CombinatoricsProblem prob)	Solves the given combinatorics problem using an iterative neighborhood search algorithm.
ArrayList<ElementOfCombinatoricsProb>	TabuSearch.solve(CombinatoricsProblem prob)	Return the best solution encountered

Constructors in org.tweetyproject.math.opt.solver with parameters of type CombinatoricsProblem

Modifier	Constructor	Description
	FitnessComparator(CombinatoricsProblem prob)	Constructor