Package org.ddolib.examples.lcs
Class LCSAcsMain
java.lang.Object
org.ddolib.examples.lcs.LCSAcsMain
Longest Common Subsequence (LCS) with Acs.
Main class to solve an instance of the Longest Common Subsequence problem using the Anytime Column Search (ACS) algorithm.
This class demonstrates how to:
- Load an LCS problem instance from a file.
- Instantiate an
AcsModelwith a fast lower bound heuristic. - Use the
Solversto minimize the objective function via ACS. - Track and print new incumbent solutions and search statistics.
The ACS algorithm iteratively explores the state space, updating the best solution found while optionally applying a stopping criterion.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
LCSAcsMain
public LCSAcsMain()
-
-
Method Details
-
main
- Throws:
IOException
-