Name | Description | Type | Package | Framework |
BruteForceIPMinimizer | This implementation solves an integral constrained minimization problem by brute force search for all possible integer combinations. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.bruteforce | SuanShu |
BruteForceIPProblem | This implementation is an integral constrained minimization problem that has enumerable integral domains. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.bruteforce | SuanShu |
BruteForceIPProblem .IntegerDomain | This specifies the integral domain for an integral variable, i. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.bruteforce | SuanShu |
GomoryMixedCutMinimizer | This cutting-plane implementation uses Gomory's mixed cut method. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
GomoryMixedCutMinimizer .MyCutter | This is Gomory's mixed cut. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
GomoryPureCutMinimizer | This cutting-plane implementation uses Gomory's pure cut method for pure integer programming, in which all variables are integral. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
GomoryPureCutMinimizer .MyCutter | This is Gomory's pure cut. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
ILPBranchAndBoundMinimizer | This is a Branch-and-Bound algorithm that solves Integer Linear Programming problems. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.bb | SuanShu |
ILPBranchAndBoundMinimizer .ActiveListFactory | This factory constructs a new instance of ActiveList for each Integer Linear Programming problem. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.bb | SuanShu |
ILPNode | This is the branch-and-bound node used in conjunction with ILPBranchAndBoundMinimizer to solve an Integer Linear Programming problem. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.bb | SuanShu |
ILPProblem | A linear program in real variables is said to be integral if it has at least one optimal solution which is integral. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.problem | SuanShu |
ILPProblemImpl1 | This implementation is an ILP problem, in which the variables can be real or integral. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.problem | SuanShu |
IPMinimizer | An Integer Programming minimizer minimizes an objective function subject to equality/inequality constraints as well as integral constraints. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer | SuanShu |
IPProblem | An Integer Programming problem is a mathematical optimization or feasibility program in which some or all of the variables are restricted to be integers. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer | SuanShu |
IPProblemImpl1 | This is an implementation of a general Integer Programming problem in which some variables take only integers. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer | SuanShu |
PureILPProblem | This is a pure integer linear programming problem, in which all variables are integral. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.problem | SuanShu |
SimplexCuttingPlaneMinimizer | The use of cutting planes to solve Mixed Integer Linear Programming (MILP) problems was introduced by Ralph E Gomory. | Class | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
SimplexCuttingPlaneMinimizer .CutterFactory | This factory constructs a new Cutter for each MILP problem. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |
SimplexCuttingPlaneMinimizer .CutterFactory .Cutter | A Cutter defines how to cut a simplex table, i. | Interface | com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane | SuanShu |