Modifier and Type | Method and Description |
---|---|
MinimizationSolution<Vector> |
ILPBranchAndBoundMinimizer.solve(ILPProblem problem) |
Constructor and Description |
---|
ILPNode(ILPProblem problem)
Construct a BB node and associate it with an ILP problem.
|
Modifier and Type | Method and Description |
---|---|
SimplexCuttingPlaneMinimizer.CutterFactory.Cutter |
SimplexCuttingPlaneMinimizer.CutterFactory.getCutter(ILPProblem problem)
Construct a new
Cutter for a MILP problem. |
MinimizationSolution<Vector> |
SimplexCuttingPlaneMinimizer.solve(ILPProblem problem) |
Constructor and Description |
---|
MyCutter(ILPProblem problem)
Construct a Gomory mixed cutter.
|
Modifier and Type | Class and Description |
---|---|
class |
ILPProblemImpl1
This implementation is an ILP problem, in which the variables can be real or integral.
|
class |
PureILPProblem
This is a pure integer linear programming problem, in which all variables are integral.
|
Copyright © 2010-2020 NM FinTech Ltd.. All Rights Reserved.