Package org.ddolib.examples.misp
Class MispDdoMain
java.lang.Object
org.ddolib.examples.misp.MispDdoMain
The Maximum Independent Set Problem (MISP) with Ddo.
Entry point for solving the Maximum Independent Set Problem (MISP) using a Decision Diagram Optimization (DDO) solver.
This class demonstrates how to configure and run a DDO search algorithm for a MISP instance. The model used for the search includes:
- The problem instance
MispProblemread from a file. - A relaxation
MispRelaxto merge multiple states during the DDO search. - A ranking
MispRankingto order states within the DDO search. - A dominance checker
SimpleDominanceCheckerwithMispDominanceto prune dominated states. - A fast lower bound
MispFastLowerBoundto guide the search.
The best solutions and search statistics are printed to the standard output.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
MispDdoMain
public MispDdoMain()
-
-
Method Details
-
main
Main method to execute the DDO solver on a MISP instance.If no command-line argument is provided, the default instance
data/MISP/tadpole_4_2.dotis used.- Parameters:
args- optional command-line arguments; args[0] can specify the path to the MISP instance file- Throws:
IOException- if there is an error reading the problem instance from the file
-