Uses of Class
org.ddolib.ddo.core.mdd.NodeSubProblem

Packages that use NodeSubProblem

Package	Description
org.ddolib.ddo.core.heuristics.cluster	This package contains the classes and interfaces defining the heuristics which can be used to discard or merge node during the restriction or relaxation of the MDD.
org.ddolib.ddo.core.mdd	This package contains the classes that are used to implement a restricted/relaxed MDD.
org.ddolib.examples.maximumcoverage

Uses of NodeSubProblem in org.ddolib.ddo.core.heuristics.cluster

Methods in org.ddolib.ddo.core.heuristics.cluster that return types with arguments of type NodeSubProblem

Modifier and Type	Method	Description
List<NodeSubProblem<T>>[]	CostBased.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Select the layer.size() - maxWidth - 1 nodes with the worst cost on the layer.
List<NodeSubProblem<T>>[]	GHP.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Partitions the given layer into clusters using Generalized Hyperplane Partitioning.
List<NodeSubProblem<T>>[]	Hybrid.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Defines clusters from a layer of nodes using a hybrid strategy.
List<NodeSubProblem<T>>[]	RandomBased.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Defines clusters by randomly selecting up to maxWidth nodes from the layer.
List<NodeSubProblem<T>>[]	ReductionStrategy.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Generates clusters of nodes for restriction and relaxation from the given layer.

Methods in org.ddolib.ddo.core.heuristics.cluster with parameters of type NodeSubProblem

Modifier and Type	Method	Description
default double	StateDistance.distance(NodeSubProblem<T> a, NodeSubProblem<T> b)	Computes the distance between two nodes of a subproblem.

Method parameters in org.ddolib.ddo.core.heuristics.cluster with type arguments of type NodeSubProblem

Modifier and Type	Method	Description
List<NodeSubProblem<T>>[]	CostBased.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Select the layer.size() - maxWidth - 1 nodes with the worst cost on the layer.
List<NodeSubProblem<T>>[]	GHP.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Partitions the given layer into clusters using Generalized Hyperplane Partitioning.
List<NodeSubProblem<T>>[]	Hybrid.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Defines clusters from a layer of nodes using a hybrid strategy.
List<NodeSubProblem<T>>[]	RandomBased.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Defines clusters by randomly selecting up to maxWidth nodes from the layer.
List<NodeSubProblem<T>>[]	ReductionStrategy.defineClusters(List<NodeSubProblem<T>> layer, int maxWidth)	Generates clusters of nodes for restriction and relaxation from the given layer.

Uses of NodeSubProblem in org.ddolib.ddo.core.mdd

Methods in org.ddolib.ddo.core.mdd with parameters of type NodeSubProblem

Modifier and Type	Method	Description
int	NodeSubProblemComparator.compare(NodeSubProblem<T> o1, NodeSubProblem<T> o2)	Compares two NodeSubProblem instances.

Uses of NodeSubProblem in org.ddolib.examples.maximumcoverage

Methods in org.ddolib.examples.maximumcoverage with parameters of type NodeSubProblem

Modifier and Type	Method	Description
double	MaxCoverDistance.distance(NodeSubProblem<MaxCoverState> a, NodeSubProblem<MaxCoverState> b)	Computes the distance between two search nodes.