Package org.ddolib.examples.lcs
Class LCSDdoMain
java.lang.Object
org.ddolib.examples.lcs.LCSDdoMain
Longest Common Subsequence (LCS) with Ddo.
Main class to solve an instance of the Longest Common Subsequence problem using the Decision Diagram Optimization (DDO) algorithm.
This class demonstrates how to:
- Load an LCS problem instance from a file.
- Instantiate a
DdoModelwith:- a relaxation (
LCSRelax), - a state ranking (
LCSRanking), - a fast lower bound heuristic (
LCSFastLowerBound).
- a relaxation (
- Use the
Solversto minimize the objective function via DDO. - Track and print new incumbent solutions and search statistics.
The DDO algorithm builds and manipulates a relaxed decision diagram to efficiently explore the state space and find optimal or near-optimal solutions.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
LCSDdoMain
public LCSDdoMain()
-
-
Method Details
-
main
- Throws:
IOException
-