Uses of Package
org.ddolib.modeling

Packages that use org.ddolib.modeling

Package	Description
org.ddolib.acs.core.solver	This package implement Acs solver.
org.ddolib.astar.core.solver	This package implement As Star solver.
org.ddolib.awastar.core.solver	This contains the implementation of a Anytime Weighted A* solver for decision diagram-based optimization problems.
org.ddolib.common.dominance	This package contains the classes implementing dominance checkers.
org.ddolib.ddo.core.cache	This package contains the implementations of cache mechanism.
org.ddolib.ddo.core.compilation	This package contains defining the compilation type and the compilation input
org.ddolib.ddo.core.frontier	This package contains the classes implementing solver frontiers.
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.ddo.core.solver	This package contains solvers using DDO algorithm.
org.ddolib.examples.alp	This package implements the acs, astar and ddo models for the Aircraft Landing Problem (ALP).
org.ddolib.examples.boundedknapsack	This package implements the acs, astar and ddo models for the Bounded Knapsack Problem (BKS).
org.ddolib.examples.gruler	This package implements the acs, astar and ddo models for the Golomb Rule Problem (GRP).
org.ddolib.examples.knapsack	This package implements the acs, astar and ddo models for the Knapsack Problem (KS).
org.ddolib.examples.lcs	This package implements the acs, astar and ddo models for the Longest Common Subsequence (LCS) Problem.
org.ddolib.examples.max2sat	This package implements the acs, astar and ddo models for the Maximum 2-Satisfiability Problem (MAX2SAT) Problem.
org.ddolib.examples.maximumcoverage
org.ddolib.examples.mcp	This package implements the acs, astar and ddo models for the Maximum Cut Problem (MCP).
org.ddolib.examples.misp	This package implements the acs, astar and ddo models for the Maximum Independent Set Problem (MISP).
org.ddolib.examples.mks	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)$.
org.ddolib.examples.msct	This package implements the acs, astar and ddo models for the Minimum Sum Completion Time (MSCT).
org.ddolib.examples.pdp	This package implements the acs, astar and ddo models for the Single Vehicle Pick-up and Delivery Problem (PDP).
org.ddolib.examples.pigmentscheduling	This package implements the acs, astar and ddo models for the Pigment Sequencing Problem (PSP).
org.ddolib.examples.smic	This package implements the acs, astar and ddo models for the Single Machine with Inventory Constraint (SMIC).
org.ddolib.examples.srflp	This package implements the acs, astar and ddo models for the Single Row Facility Layout Problem (SRFLP).
org.ddolib.examples.talentscheduling	This package implements the acs, astar and ddo models for the Talent Scheduling problem (talentSched).
org.ddolib.examples.tsp	This package implements the acs, astar and ddo models for the Traveling Salesman Problem (TSP).
org.ddolib.examples.tsptw	This package implements the acs, astar and ddo models for the Traveling Salesman Problem with Time Window (TSPTW).
org.ddolib.lns.core.solver	This package implement LNS solver.
org.ddolib.modeling	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.
org.ddolib.util.debug	This package contains util stuff related to the debug mode.

Classes in org.ddolib.modeling used by org.ddolib.acs.core.solver

Class	Description
AcsModel	Defines the structure of an optimization model solved using the Anytime Column Search (ACS) algorithm within the Decision Diagram Optimization (DDO) framework.

Classes in org.ddolib.modeling used by org.ddolib.astar.core.solver

Class	Description
Model	Defines the core model interface for describing an optimization problem to be solved within the Decision Diagram Optimization (DDO) framework.

Classes in org.ddolib.modeling used by org.ddolib.awastar.core.solver

Class	Description
AwAstarModel	Defines the structure of an optimization model solved using the Anytime Weighted A* (AWA*) algorithm within the Decision Diagram Optimization (DDO) framework.

Classes in org.ddolib.modeling used by org.ddolib.common.dominance

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.cache

Class	Description
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.compilation

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
Model	Defines the core model interface for describing an optimization problem to be solved within the Decision Diagram Optimization (DDO) framework.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.frontier

Class	Description
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.heuristics.cluster

Class	Description
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.mdd

Class	Description
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.ddo.core.solver

Class	Description
DdoModel	Defines the interface for a Dynamic Decision Diagram Optimization (DDO) model.
ExactModel	Defines the interface for a Dynamic Decision Diagram Optimization (DDO) model, used by the ExactSolver

Classes in org.ddolib.modeling used by org.ddolib.examples.alp

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.boundedknapsack

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.gruler

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.knapsack

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.lcs

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.max2sat

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.maximumcoverage

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.mcp

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.misp

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.mks

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.msct

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.pdp

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.pigmentscheduling

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.smic

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.srflp

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.talentscheduling

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.tsp

Class	Description
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.examples.tsptw

Class	Description
Dominance	Defines a dominance relation used to compare and prune states during the exploration of decision diagrams or search spaces.
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.lns.core.solver

Class	Description
LnsModel	Interface representing a model for Large Neighborhood Search (LNS) problems.

Classes in org.ddolib.modeling used by org.ddolib.modeling

Class	Description
AcsModel	Defines the structure of an optimization model solved using the Anytime Column Search (ACS) algorithm within the Decision Diagram Optimization (DDO) framework.
AwAstarModel	Defines the structure of an optimization model solved using the Anytime Weighted A* (AWA*) algorithm within the Decision Diagram Optimization (DDO) framework.
DdoModel	Defines the interface for a Dynamic Decision Diagram Optimization (DDO) model.
ExactModel	Defines the interface for a Dynamic Decision Diagram Optimization (DDO) model, used by the ExactSolver
FastLowerBound	Interface for the fast lower bound method Heuristic defining a fast lower bound for states
InvalidSolutionException	Exception thrown by Problem.evaluate(int[]) method if its input solution does not respect the problem's constraints.
LnsModel	Interface representing a model for Large Neighborhood Search (LNS) problems.
Model	Defines the core model interface for describing an optimization problem to be solved within the Decision Diagram Optimization (DDO) framework.
Problem	Represents an optimization problem formulated as a labeled transition system, following the semantics of dynamic programming.
Relaxation	This is the second most important abstraction that a client should provide when using this library.
StateRanking	A state ranking is used to order the states and decides the ones that are kept and the ones that are merged/deleted when a relaxation/restriction occurs.

Classes in org.ddolib.modeling used by org.ddolib.util.debug

Class	Description
Model	Defines the core model interface for describing an optimization problem to be solved within the Decision Diagram Optimization (DDO) framework.