Class MaxCoverDdoMainWithCluster
java.lang.Object
org.ddolib.examples.maximumcoverage.MaxCoverDdoMainWithCluster
Maximum Coverage (MaxCover) problem with Ddo
This class demonstrates how to solve an instance of the Maximum Coverage (MaxCover) problem (BKP) using a Decision Diagram Optimization (DDO) algorithm.
- Builds an instance of the MaxCover problem (randomly generated or loaded from a file)
- Defines a
DdoModelby specifying the problem, relaxation, ranking strategy, width heuristic, and lower bound - Runs the DDO solver to compute a solution
- Prints the resulting solution
The problem parameters (size, cardinality, random seed, etc.) can be easily modified to experiment with different instances.
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
MaxCoverDdoMainWithCluster
public MaxCoverDdoMainWithCluster()
-
-
Method Details
-
main
- Throws:
IOException
-