Uses of Interface
org.ddolib.modeling.StateRanking
Packages that use StateRanking
Package
Description
This package contains defining the compilation type and the compilation input
This package contains the classes implementing solver frontiers.
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.
This package contains the classes that are used to implement a
restricted/relaxed MDD.
This package implements the acs, astar and ddo models for the Aircraft Landing Problem (ALP).
This package implements the acs, astar and ddo models for the Bounded Knapsack Problem (BKS).
This package implements the acs, astar and ddo models for the Golomb Rule Problem (GRP).
This package implements the acs, astar and ddo models for the Knapsack Problem (KS).
This package implements the acs, astar and ddo models for the Longest Common Subsequence (LCS) Problem.
This package implements the acs, astar and ddo models for the Maximum 2-Satisfiability Problem (MAX2SAT) Problem.
This package implements the acs, astar and ddo models for the Maximum Cut Problem (MCP).
This package implements the acs, astar and ddo models for the Maximum Independent Set Problem (MISP).
The Multidimensional Knapsack Problem (MKP) is a generalization of the KP
to multiple capacity constraints: $n$ items and $m$ dimensions of the knapsack
are given, each dimension with capacity bound $(C_1,\ldots ,C_m)$.
This package implements the acs, astar and ddo models for the Minimum Sum Completion Time (MSCT).
This package implements the acs, astar and ddo models for the Single Vehicle Pick-up and Delivery Problem (PDP).
This package implements the acs, astar and ddo models for the Pigment Sequencing Problem (PSP).
This package implements the acs, astar and ddo models for the Single Machine with Inventory Constraint (SMIC).
This package implements the acs, astar and ddo models for the Single Row Facility Layout Problem (SRFLP).
This package implements the acs, astar and ddo models for the Talent Scheduling problem (talentSched).
This package implements the acs, astar and ddo models for the Traveling Salesman Problem (TSP).
This package implements the acs, astar and ddo models for the Traveling Salesman Problem with Time Window (TSPTW).
This package contains the interfaces and abstract classes that must be implemented as problem
specific classes to model a problem.It also contains default implementation.
-
Uses of StateRanking in org.ddolib.ddo.core.compilation
Fields in org.ddolib.ddo.core.compilation declared as StateRankingModifier and TypeFieldDescriptionCompilationConfig.stateRankingRanking heuristic used to prioritize states when pruning nodes in width-limited MDD layers. -
Uses of StateRanking in org.ddolib.ddo.core.frontier
Constructors in org.ddolib.ddo.core.frontier with parameters of type StateRankingModifierConstructorDescriptionSimpleFrontier(StateRanking<T> ranking, CutSetType cutSetType) Constructs a newSimpleFrontier. -
Uses of StateRanking in org.ddolib.ddo.core.heuristics.cluster
Constructors in org.ddolib.ddo.core.heuristics.cluster with parameters of type StateRankingModifierConstructorDescriptionCostBased(StateRanking<T> ranking) Hybrid(StateRanking<T> ranking, StateDistance<T> distance) Constructs a Hybrid reduction strategy with default alpha (0.5) and seed.Hybrid(StateRanking<T> ranking, StateDistance<T> distance, double alpha, long seed) Constructs a Hybrid reduction strategy with specified ranking, distance, alpha, and seed. -
Uses of StateRanking in org.ddolib.ddo.core.mdd
Constructors in org.ddolib.ddo.core.mdd with parameters of type StateRankingModifierConstructorDescriptionNodeSubProblemComparator(StateRanking<T> delegate) Constructs a new comparator that uses the given ranking as a tie-breaker. -
Uses of StateRanking in org.ddolib.examples.alp
Classes in org.ddolib.examples.alp that implement StateRankingModifier and TypeClassDescriptionclassRanking heuristic forALPStateobjects in the Aircraft Landing Problem (ALP). -
Uses of StateRanking in org.ddolib.examples.boundedknapsack
Classes in org.ddolib.examples.boundedknapsack that implement StateRankingModifier and TypeClassDescriptionclassA default state ranking implementation for the Bounded Knapsack Problem (BKP). -
Uses of StateRanking in org.ddolib.examples.gruler
Classes in org.ddolib.examples.gruler that implement StateRankingModifier and TypeClassDescriptionclassDefines a ranking strategy for states in the Golomb Ruler (GR) problem. -
Uses of StateRanking in org.ddolib.examples.knapsack
Classes in org.ddolib.examples.knapsack that implement StateRanking -
Uses of StateRanking in org.ddolib.examples.lcs
Classes in org.ddolib.examples.lcs that implement StateRankingModifier and TypeClassDescriptionclassRanking strategy forLCSStatein the Longest Common Subsequence (LCS) problem. -
Uses of StateRanking in org.ddolib.examples.max2sat
Classes in org.ddolib.examples.max2sat that implement StateRankingModifier and TypeClassDescriptionclassClass used to compare two states for the Max2Sat problem. -
Uses of StateRanking in org.ddolib.examples.maximumcoverage
Classes in org.ddolib.examples.maximumcoverage that implement StateRankingModifier and TypeClassDescriptionclassRanking function forMaxCoverStateused in the Maximum Coverage problem. -
Uses of StateRanking in org.ddolib.examples.mcp
Classes in org.ddolib.examples.mcp that implement StateRankingModifier and TypeClassDescriptionclassClass used to compare two states for the MCP problem. -
Uses of StateRanking in org.ddolib.examples.misp
Classes in org.ddolib.examples.misp that implement StateRankingModifier and TypeClassDescriptionclassImplements a ranking strategy for states in the Maximum Independent Set Problem (MISP). -
Uses of StateRanking in org.ddolib.examples.mks
Classes in org.ddolib.examples.mks that implement StateRankingModifier and TypeClassDescriptionclassRanking strategy for multi-dimensional Knapsack (MKS) states. -
Uses of StateRanking in org.ddolib.examples.msct
Classes in org.ddolib.examples.msct that implement StateRankingModifier and TypeClassDescriptionclassProvides a ranking strategy forMSCTStateobjects used in the search process for solving the Maximum Sum of Completion Times (MSCT) problem. -
Uses of StateRanking in org.ddolib.examples.pdp
Classes in org.ddolib.examples.pdp that implement StateRankingModifier and TypeClassDescriptionclassImplements a state ranking strategy for the Pickup and Delivery Problem (PDP). -
Uses of StateRanking in org.ddolib.examples.pigmentscheduling
Classes in org.ddolib.examples.pigmentscheduling that implement StateRanking -
Uses of StateRanking in org.ddolib.examples.smic
Classes in org.ddolib.examples.smic that implement StateRankingModifier and TypeClassDescriptionclassTheSMICRankingclass defines a heuristic ranking criterion for comparing twoSMICStateinstances during search or optimization. -
Uses of StateRanking in org.ddolib.examples.srflp
Classes in org.ddolib.examples.srflp that implement StateRankingModifier and TypeClassDescriptionclassImplements a ranking between twoSRFLPStateinstances for use in decision diagram or search-based algorithms. -
Uses of StateRanking in org.ddolib.examples.talentscheduling
Classes in org.ddolib.examples.talentscheduling that implement StateRanking -
Uses of StateRanking in org.ddolib.examples.tsp
Classes in org.ddolib.examples.tsp that implement StateRankingModifier and TypeClassDescriptionclassClass that defines a ranking between twoTSPStateinstances. -
Uses of StateRanking in org.ddolib.examples.tsptw
Classes in org.ddolib.examples.tsptw that implement StateRankingModifier and TypeClassDescriptionclassRanking class for states in the Traveling Salesman Problem with Time Windows (TSPTW). -
Uses of StateRanking in org.ddolib.modeling
Methods in org.ddolib.modeling that return StateRankingModifier and TypeMethodDescriptiondefault StateRanking<T> DdoModel.ranking()Returns the ranking function used to order states within a layer.final StateRanking<T> ExactModel.ranking()default StateRanking<T> LnsModel.ranking()Returns the state ranking heuristic used to guide the search.