Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: integer_search
Note: This documentation is automatically generated.
This file contains all the top-level logic responsible for driving the search of a satisfiability integer problem. What decision we take next, which new Literal associated to an IntegerLiteral we create and when we restart.
For an optimization problem, our algorithm solves a sequence of decision problem using this file as an entry point. Note that some heuristics here still use the objective if there is one in order to orient the search towards good feasible solution though.
[[["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."],[[["This documentation details the core logic of solving satisfiability integer problems in C++, including decision-making, literal creation, and restart strategies."],["The algorithm addresses optimization problems by tackling a series of decision problems, sometimes utilizing objective functions to guide the search towards optimal solutions."],["Two key classes, `ContinuousProber` and `IntegerSearchHelper`, are involved in the integer search process."]]],["The core content describes the C++ logic for driving the search in satisfiability integer problems, including decision-making, creating new IntegerLiteral-associated Literals, and determining when to restart. It also handles optimization problems by solving a sequence of decision problems. Heuristics, where present, are leveraged to guide the search toward feasible solutions, and the document references the `ContinuousProber` and `IntegerSearchHelper` classes.\n"]]
