|
void | operations_research::sat::ConfigureSearchHeuristics (Model *model) |
|
SatSolver::Status | operations_research::sat::ResetAndSolveIntegerProblem (const std::vector< Literal > &assumptions, Model *model) |
|
SatSolver::Status | operations_research::sat::SolveIntegerProblemWithLazyEncoding (Model *model) |
|
IntegerLiteral | operations_research::sat::AtMinValue (IntegerVariable var, IntegerTrail *integer_trail) |
|
IntegerLiteral | operations_research::sat::ChooseBestObjectiveValue (IntegerVariable var, Model *model) |
| If a variable appear in the objective, branch on its best objective value.
|
|
IntegerLiteral | operations_research::sat::GreaterOrEqualToMiddleValue (IntegerVariable var, IntegerTrail *integer_trail) |
|
IntegerLiteral | operations_research::sat::SplitAroundGivenValue (IntegerVariable var, IntegerValue value, Model *model) |
|
IntegerLiteral | operations_research::sat::SplitAroundLpValue (IntegerVariable var, Model *model) |
|
IntegerLiteral | operations_research::sat::SplitDomainUsingBestSolutionValue (IntegerVariable var, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::FirstUnassignedVarAtItsMinHeuristic (const std::vector< IntegerVariable > &vars, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::MostFractionalHeuristic (Model *model) |
| Choose the variable with most fractional LP value.
|
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::BoolPseudoCostHeuristic (Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::LpPseudoCostHeuristic (Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::UnassignedVarWithLowestMinAtItsMinHeuristic (const std::vector< IntegerVariable > &vars, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::FollowHint (const std::vector< BooleanOrIntegerVariable > &vars, const std::vector< IntegerValue > &values, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::SequentialSearch (std::vector< std::function< BooleanOrIntegerLiteral()> > heuristics) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::SequentialValueSelection (std::vector< std::function< IntegerLiteral(IntegerVariable)> > value_selection_heuristics, std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::IntegerValueSelectionHeuristic (std::function< BooleanOrIntegerLiteral()> var_selection_heuristic, Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::SatSolverHeuristic (Model *model) |
| Returns the BooleanOrIntegerLiteral advised by the underlying SAT solver.
|
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::PseudoCost (Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::SchedulingSearchHeuristic (Model *model) |
| A simple heuristic for scheduling models.
|
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::DisjunctivePrecedenceSearchHeuristic (Model *model) |
|
std::function< BooleanOrIntegerLiteral()> | operations_research::sat::CumulativePrecedenceSearchHeuristic (Model *model) |
|
bool | operations_research::sat::LinearizedPartIsLarge (Model *model) |
|
std::function< bool()> | operations_research::sat::RestartEveryKFailures (int k, SatSolver *solver) |
| A restart policy that restarts every k failures.
|
|
std::function< bool()> | operations_research::sat::SatSolverRestartPolicy (Model *model) |
| A restart policy that uses the underlying sat solver's policy.
|
|
std::vector< std::function< BooleanOrIntegerLiteral()> > | operations_research::sat::CompleteHeuristics (absl::Span< const std::function< BooleanOrIntegerLiteral()> > incomplete_heuristics, const std::function< BooleanOrIntegerLiteral()> &completion_heuristic) |
|