Package org.ddolib.examples.lcs
Class LCSAstarMain
java.lang.Object
org.ddolib.examples.lcs.LCSAstarMain
Longest Common Subsequence (LCS) with AsTar.
Main class to solve an instance of the Longest Common Subsequence problem using the A* search algorithm.
This class demonstrates how to:
- Load an LCS problem instance from a file.
- Instantiate a
Modelwith a fast lower bound heuristic. - Use the
Solversto minimize the objective function via A* search. - Track and print new incumbent solutions and search statistics.
The A* algorithm systematically explores the state space, expanding nodes in an order guided by the lower bound heuristic to efficiently find optimal solutions.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
LCSAstarMain
public LCSAstarMain()
-
-
Method Details
-
main
- Throws:
IOException
-