Name | Description | Type | Package | Framework |
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 |