Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class HittingSetOptimizer
Note: This documentation is automatically generated.
Generalization of the max-HS algorithm (HS stands for Hitting Set). This is
similar to MinimizeWithCoreAndLazyEncoding() but it uses a hybrid approach
with a MIP solver to handle the discovered infeasibility cores.
[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["HittingSetOptimizer is a generalization of the max-HS algorithm, similar to MinimizeWithCoreAndLazyEncoding but uses a hybrid approach with a MIP solver."],["It's based on the research paper \"Solving MAXSAT by Solving a Sequence of Simpler SAT Instances\" by Jessica Davies and Fahiem Bacchus."],["This approach was successful in the 2016 max-SAT competition, specifically in the industrial category."],["Currently, it requires linking with the SCIP MIP solver, which is large and potentially needs optimization."]]],["The `HittingSetOptimizer` class implements a hybrid approach, generalizing the max-HS algorithm, using a MIP solver to manage infeasibility cores. It is similar to `MinimizeWithCoreAndLazyEncoding`. This approach won the 2016 max-SAT competition in the industrial category. Key methods include `HittingSetOptimizer`, which initializes with model data and an observer, and `Optimize`, which performs the optimization and returns the solver status. The implementation is noted to require linking with the SCIP MIP solver.\n"]]
