Package org.ddolib.ddo.core.heuristics.cluster

package 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. The classic cost based strategy and the clustering approaches are implemented with a hybridization of both strategies.
  • Class
    Description
    CostBased<T>
    This strategy select the nodes based on the objective value of the best path leading to them.
    GHP<T>
    Generalized Hyperplane Partitioning (GHP) reduction strategy for decision diagram layers.
    Hybrid<T>
    Hybrid reduction strategy that combines cost-based and distance-based clustering for decision diagram layers.
    RandomBased<T>
    A simple random-based reduction strategy for decision diagram layers.
    ReductionStrategy<T>
    Interface defining a strategy to reduce the number of nodes in a layer of a decision diagram by clustering nodes for restriction and relaxation.
    StateDistance<T>
    Interface defining a distance function between states, used to form clusters when deciding which nodes on a layer of a decision diagram should be merged.