DDOLib-Scala
API
Generated with
DDOLib-Scala/org.ddolibscala/org.ddolibscala.tools/org.ddolibscala.tools.dominance/DefaultDominanceChecker

DefaultDominanceChecker

org.ddolibscala.tools.dominance.DefaultDominanceChecker
class DefaultDominanceChecker[T] extends DominanceChecker[T]

Default implementation of a DominanceChecker that performs no dominance checking.

This class can be used as a placeholder when dominance pruning is not required or when a problem does not define any dominance relation between states.

In decision diagram or search-based algorithms, a dominance checker is used to compare two states and discard those that are dominated (i.e., guaranteed to lead to no better solution). This default implementation disables that feature: it never reports any dominance and never removes any state.

Type parameters

T

the type of states

Attributes

Graph
Supertypes
class DominanceChecker[T]
class DominanceChecker[T]
class Object
trait Matchable
class Any

Members list

Value members

Concrete methods

override def updateDominance(state: T, depth: Int, objectiveValue: Double): Boolean

Checks whether the input state is dominated and updates the front of non-dominated nodes.

Checks whether the input state is dominated and updates the front of non-dominated nodes.

Value parameters

depth

the depth of the state in the MDD

objectiveValue

the length of the longest path from the root to the input state.

state

the state on which test dominance

Attributes

Returns

whether the input state is dominated

Definition Classes
DominanceChecker -> DominanceChecker
Generated with