Uses of Record Class
org.ddolib.ddo.core.Decision
Packages that use Decision
Package
Description
This package implement Acs solver.
This package implement As Star solver.
This contains the implementation of a Anytime Weighted A* solver for decision diagram-based optimization problems.
This package contains interfaces that must be extended to implements solvers.
This package contains the core classes and interfaces that are central to the
implementation of an optimization solver based on branch and bound with decision
diagrams.
This package contains the classes that are used to implement a
restricted/relaxed MDD.
This package contains solvers using DDO algorithm.
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 implement LNS solver.
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.
This package contains the classes implementing utils user in the solver
This package contains util stuff related to the debug mode.
-
Uses of Decision in org.ddolib.acs.core.solver
Methods in org.ddolib.acs.core.solver that return types with arguments of type DecisionModifier and TypeMethodDescriptionACSSolver.bestSolution()Returns the set of decisions corresponding to the best solution found, if any. -
Uses of Decision in org.ddolib.astar.core.solver
Methods in org.ddolib.astar.core.solver that return types with arguments of type Decision -
Uses of Decision in org.ddolib.awastar.core.solver
Methods in org.ddolib.awastar.core.solver that return types with arguments of type Decision -
Uses of Decision in org.ddolib.common.solver
Methods in org.ddolib.common.solver that return types with arguments of type DecisionModifier and TypeMethodDescriptionSolver.bestSolution()Returns the set of decisions that lead to the best solution found by this solver, if any.Method parameters in org.ddolib.common.solver with type arguments of type DecisionModifier and TypeMethodDescriptiondefault int[]Solver.constructSolution(Set<Decision> decisions) Constructs an array representing the values assigned to each variable from a set of decisions.Constructor parameters in org.ddolib.common.solver with type arguments of type DecisionModifierConstructorDescriptionSolution(Optional<Set<Decision>> decisions, SearchStatistics statistics) Constructs a solution given a set of decision andSearchStatisticson this set. -
Uses of Decision in org.ddolib.ddo.core
Methods in org.ddolib.ddo.core that return types with arguments of type DecisionModifier and TypeMethodDescriptionSubProblem.getPath()Returns the path (partial assignment) of decisions that led to this subproblem.Constructor parameters in org.ddolib.ddo.core with type arguments of type DecisionModifierConstructorDescriptionSubProblem(T state, double value, double lb, Set<Decision> path) Constructs a newSubProbleminstance with its associated state, accumulated value, lower bound, and decision path. -
Uses of Decision in org.ddolib.ddo.core.mdd
Fields in org.ddolib.ddo.core.mdd declared as DecisionModifier and TypeFieldDescriptionfinal DecisionEdge.decisionThe decision associated with this edge.Methods in org.ddolib.ddo.core.mdd that return types with arguments of type DecisionModifier and TypeMethodDescriptionDecisionDiagram.bestSolution()Returns the sequence of decisions leading to the best solution represented in this DD.LinkedDecisionDiagram.bestSolution()Returns the set of decisions representing the best solution found in this MDD.Method parameters in org.ddolib.ddo.core.mdd with type arguments of type DecisionModifier and TypeMethodDescriptionNodeSubProblem.toSubProblem(Set<Decision> pathToRoot) Converts this node-state association into an actualSubProblem.Constructors in org.ddolib.ddo.core.mdd with parameters of type Decision -
Uses of Decision in org.ddolib.ddo.core.solver
Methods in org.ddolib.ddo.core.solver that return types with arguments of type DecisionModifier and TypeMethodDescriptionExactSolver.bestSolution()Returns the best solution found so far as a set of decisions.RelaxationSolver.bestSolution()RestrictionSolver.bestSolution()SequentialSolver.bestSolution() -
Uses of Decision in org.ddolib.examples.alp
Methods in org.ddolib.examples.alp with parameters of type DecisionModifier and TypeMethodDescriptiondoubleReturns the relaxed cost of a transition (edge) between states.ALPProblem.transition(ALPState state, Decision decision) doubleALPProblem.transitionCost(ALPState state, Decision decision) -
Uses of Decision in org.ddolib.examples.boundedknapsack
Methods in org.ddolib.examples.boundedknapsack with parameters of type DecisionModifier and TypeMethodDescriptiondoubleOptionally relaxes the edge cost when transitioning from a state to a merged state.BKSProblem.transition(Integer state, Decision decision) Computes the next state after making a decision on an item.doubleBKSProblem.transitionCost(Integer state, Decision decision) Computes the transition cost associated with a decision. -
Uses of Decision in org.ddolib.examples.gruler
Methods in org.ddolib.examples.gruler with parameters of type DecisionModifier and TypeMethodDescriptiondoubleComputes the relaxed cost of transitioning between two states in the relaxed problem.GRProblem.transition(GRState state, Decision decision) Computes the next state resulting from applying a decision (adding a new mark).doubleGRProblem.transitionCost(GRState state, Decision decision) Computes the cost associated with a transition between states. -
Uses of Decision in org.ddolib.examples.knapsack
Methods in org.ddolib.examples.knapsack with parameters of type DecisionModifier and TypeMethodDescriptiondoubleRelaxes the cost of an edge between states in the decision diagram.KSProblem.transition(Integer state, Decision decision) doubleKSProblem.transitionCost(Integer state, Decision decision) -
Uses of Decision in org.ddolib.examples.lcs
Methods in org.ddolib.examples.lcs with parameters of type DecisionModifier and TypeMethodDescriptiondoubleRelaxes the cost of a transition between two LCS states.LCSProblem.transition(LCSState state, Decision decision) Computes the next state resulting from applying a decision at the current state.doubleLCSProblem.transitionCost(LCSState state, Decision decision) Computes the transition cost of a decision from the current state. -
Uses of Decision in org.ddolib.examples.max2sat
Methods in org.ddolib.examples.max2sat with parameters of type DecisionModifier and TypeMethodDescriptiondoubleMax2SatRelax.relaxEdge(Max2SatState from, Max2SatState to, Max2SatState merged, Decision d, double cost) Adjusts the cost of transitioning from one state to another in the relaxed model.Max2SatProblem.transition(Max2SatState state, Decision decision) doubleMax2SatProblem.transitionCost(Max2SatState state, Decision decision) -
Uses of Decision in org.ddolib.examples.maximumcoverage
Methods in org.ddolib.examples.maximumcoverage with parameters of type DecisionModifier and TypeMethodDescriptiondoubleMaxCoverRelax.relaxEdge(MaxCoverState from, MaxCoverState to, MaxCoverState merged, Decision d, double cost) Computes the relaxed cost of a transition between states.MaxCoverProblem.transition(MaxCoverState state, Decision decision) Applies a decision to a state to produce a new state.doubleMaxCoverProblem.transitionCost(MaxCoverState state, Decision decision) Returns the cost of applying a decision to a state. -
Uses of Decision in org.ddolib.examples.mcp
Methods in org.ddolib.examples.mcp with parameters of type DecisionModifier and TypeMethodDescriptiondoubleComputes the relaxed transition cost from one state to another given a merged state.MCPProblem.transition(MCPState state, Decision decision) doubleMCPProblem.transitionCost(MCPState state, Decision decision) -
Uses of Decision in org.ddolib.examples.misp
Methods in org.ddolib.examples.misp with parameters of type DecisionModifier and TypeMethodDescriptiondoubleAdjusts the transition cost when moving from one state to another in the relaxed space.MispProblem.transition(BitSet state, Decision decision) doubleMispProblem.transitionCost(BitSet state, Decision decision) -
Uses of Decision in org.ddolib.examples.mks
Methods in org.ddolib.examples.mks with parameters of type DecisionModifier and TypeMethodDescriptiondoubleReturns the cost of an edge in the relaxed decision diagram.MKSProblem.transition(MKSState state, Decision decision) Computes the state resulting from taking a decision in the current state.doubleMKSProblem.transitionCost(MKSState state, Decision decision) Computes the cost of taking a decision in a given state. -
Uses of Decision in org.ddolib.examples.msct
Methods in org.ddolib.examples.msct with parameters of type DecisionModifier and TypeMethodDescriptiondoubleComputes the relaxed cost associated with transitioning from one state to another.MSCTProblem.transition(MSCTState state, Decision decision) Computes the next state resulting from scheduling a given job.doubleMSCTProblem.transitionCost(MSCTState state, Decision decision) Returns the cost of scheduling a given job from the current state. -
Uses of Decision in org.ddolib.examples.pdp
Methods in org.ddolib.examples.pdp with parameters of type DecisionModifier and TypeMethodDescriptionPDPProblem.transition(PDPState state, Decision decision) Computes the next state given a current state and a decision.doublePDPProblem.transitionCost(PDPState state, Decision decision) Computes the cost of transitioning from a state via a decision. -
Uses of Decision in org.ddolib.examples.pigmentscheduling
Methods in org.ddolib.examples.pigmentscheduling with parameters of type DecisionModifier and TypeMethodDescriptiondoubleReturns the relaxed transition cost between two PSP states.PSProblem.transition(PSState state, Decision decision) Applies a production decision to the current state and returns the resulting new state.doublePSProblem.transitionCost(PSState state, Decision decision) Computes the cost incurred by executing a given decision from the current state. -
Uses of Decision in org.ddolib.examples.smic
Methods in org.ddolib.examples.smic with parameters of type DecisionModifier and TypeMethodDescriptiondoubleRelaxes the cost of an edge between two states.SMICProblem.transition(SMICState state, Decision decision) Applies a decision to transition from the current state to the next.doubleSMICProblem.transitionCost(SMICState state, Decision decision) Computes the cost associated with scheduling a job from the current state. -
Uses of Decision in org.ddolib.examples.srflp
Methods in org.ddolib.examples.srflp with parameters of type DecisionModifier and TypeMethodDescriptiondoubleSRFLPRelax.relaxEdge(SRFLPState from, SRFLPState to, SRFLPState merged, Decision d, double cost) Relaxation of an edge cost between two states.SRFLPProblem.transition(SRFLPState state, Decision decision) doubleSRFLPProblem.transitionCost(SRFLPState state, Decision decision) -
Uses of Decision in org.ddolib.examples.talentscheduling
Methods in org.ddolib.examples.talentscheduling with parameters of type DecisionModifier and TypeMethodDescriptiondoubleReturns the relaxed edge cost between two states.TSProblem.transition(TSState state, Decision decision) doubleTSProblem.transitionCost(TSState state, Decision decision) -
Uses of Decision in org.ddolib.examples.tsp
Methods in org.ddolib.examples.tsp with parameters of type DecisionModifier and TypeMethodDescriptiondoubleRelaxes the cost of a transition between states.TSPProblem.transition(TSPState state, Decision decision) Computes the next state after making a decision from the current state.doubleTSPProblem.transitionCost(TSPState state, Decision decision) Computes the transition cost of moving from the current state to the next state by visiting a given node. -
Uses of Decision in org.ddolib.examples.tsptw
Methods in org.ddolib.examples.tsptw with parameters of type DecisionModifier and TypeMethodDescriptiondoubleTSPTWRelax.relaxEdge(TSPTWState from, TSPTWState to, TSPTWState merged, Decision d, double cost) Relaxes the cost of an edge (transition) between two states.TSPTWProblem.transition(TSPTWState state, Decision decision) doubleTSPTWProblem.transitionCost(TSPTWState state, Decision decision) -
Uses of Decision in org.ddolib.lns.core.solver
Methods in org.ddolib.lns.core.solver that return types with arguments of type Decision -
Uses of Decision in org.ddolib.modeling
Methods in org.ddolib.modeling with parameters of type DecisionModifier and TypeMethodDescriptiondoubleRelaxes the edge that used to go from `from` to `to` and computes the cost of the new edge going from `from` to `merged`.Problem.transition(T state, Decision decision) Applies a decision to a state, computing the next state according to the problem's transition function.doubleProblem.transitionCost(T state, Decision decision) Computes the change in objective value resulting from applying a decision to a given state. -
Uses of Decision in org.ddolib.util
Method parameters in org.ddolib.util with type arguments of type DecisionModifier and TypeMethodDescriptionSolverUtil.unassignedVars(int nbVars, Set<Decision> path) Returns the set of variables not covered by the given set of decisions. -
Uses of Decision in org.ddolib.util.debug
Methods in org.ddolib.util.debug with parameters of type DecisionModifier and TypeMethodDescriptionstatic <T> voidDebugUtil.checkHashCodeAndEquality(T state, Decision decision, BiFunction<T, Decision, T> transition) Checks the consistency of a transition function by generating two states from the same origin state and decision, then verifying that they are equal and have the same hash code.Method parameters in org.ddolib.util.debug with type arguments of type DecisionModifier and TypeMethodDescriptionstatic <T> voidDebugUtil.checkHashCodeAndEquality(T state, Decision decision, BiFunction<T, Decision, T> transition) Checks the consistency of a transition function by generating two states from the same origin state and decision, then verifying that they are equal and have the same hash code.