Search Java Classes and Packages
#Com.numericalmethod.suanshu.optimization.multivariate.constrained.integer.linear.cuttingplane Classes and Interfaces - 7 results found.
| Name | Description | Type | Package | Framework |
| 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 |
| 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 |