Uses of Class
org.ojalgo.optimisation.integer.NodeKey
-
Packages that use NodeKey Package Description org.ojalgo.optimisation.integer -
-
Uses of NodeKey in org.ojalgo.optimisation.integer
Fields in org.ojalgo.optimisation.integer with type parameters of type NodeKey Modifier and Type Field Description static java.util.Comparator<NodeKey>
NodeKey. EARLIEST_SEQUENCE
static java.util.Comparator<NodeKey>
NodeKey. LARGEST_DISPLACEMENT
static java.util.Comparator<NodeKey>
NodeKey. LATEST_SEQUENCE
static java.util.Comparator<NodeKey>
NodeKey. MAX_OBJECTIVE
static java.util.Comparator<NodeKey>
NodeKey. MIN_OBJECTIVE
private MultiviewSet<NodeKey>
IntegerSolver. myDeferredNodes
private java.util.List<java.util.Comparator<NodeKey>>
ModelStrategy. myWorkerPriorities
static java.util.Comparator<NodeKey>
NodeKey. SMALLEST_DISPLACEMENT
Methods in org.ojalgo.optimisation.integer that return NodeKey Modifier and Type Method Description (package private) NodeKey
NodeKey. createLowerBranch(int branchIntegerIndex, double value, double objVal)
(package private) NodeKey
NodeKey. createUpperBranch(int branchIntegerIndex, double value, double objVal)
Methods in org.ojalgo.optimisation.integer that return types with arguments of type NodeKey Modifier and Type Method Description java.util.List<java.util.Comparator<NodeKey>>
IntegerStrategy.ConfigurableStrategy. getWorkerPriorities()
java.util.List<java.util.Comparator<NodeKey>>
IntegerStrategy. getWorkerPriorities()
There will be 1 worker thread per item in the returnedList
.java.util.List<java.util.Comparator<NodeKey>>
ModelStrategy. getWorkerPriorities()
Methods in org.ojalgo.optimisation.integer with parameters of type NodeKey Modifier and Type Method Description int
NodeKey. compareTo(NodeKey ref)
(package private) boolean
IntegerSolver. compute(NodeKey nodeKey, NodeSolver nodeSolver, CharacterRing.RingLogger nodePrinter, ModelStrategy strategy)
private boolean
NodeSolver. doGenerateCuts(ModelStrategy strategy, NodeKey nodeKey, ExpressionsBasedModel target)
(package private) boolean
NodeSolver. generateCuts(ModelStrategy strategy, NodeKey nodeKey)
(package private) int
IntegerSolver. identifyNonIntegerVariable(Optimisation.Result nodeResult, NodeKey nodeKey, ModelStrategy strategy)
Should return the index of the (best) integer variable to branch on.protected boolean
ModelStrategy.DefaultStrategy. isDirect(NodeKey node, boolean found)
protected abstract boolean
ModelStrategy. isDirect(NodeKey node, boolean found)
This method will be called twice when branching – once for each of the new nodes created by branching.protected void
ModelStrategy.DefaultStrategy. markInfeasible(NodeKey key, boolean found)
protected abstract void
ModelStrategy. markInfeasible(NodeKey key, boolean found)
Called everytime a node/subproblem is found to be infeasibleprotected void
IntegerSolver. markInteger(NodeKey key, Optimisation.Result result, ModelStrategy strategy)
protected void
ModelStrategy.DefaultStrategy. markInteger(NodeKey key, Optimisation.Result result)
Update the integer significances, based on new integer solution found.protected abstract void
ModelStrategy. markInteger(NodeKey key, Optimisation.Result result)
Called everytime a new integer solution is found
-