 |
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
|
Google OR-Tools v9.14
a fast and portable software suite for combinatorial optimization
|
This is the complete list of members for operations_research::Solver, including all inherited members.
| Accept(ModelVisitor *visitor) const | operations_research::Solver | |
| accepted_neighbors() const | operations_research::Solver | inline |
| Action typedef | operations_research::Solver | |
| ActiveSearch() const | operations_research::Solver | |
| AddBacktrackAction(Action a, bool fast) | operations_research::Solver | |
| AddCastConstraint(CastConstraint *constraint, IntVar *target_var, IntExpr *expr) | operations_research::Solver | |
| AddConstraint(Constraint *c) | operations_research::Solver | |
| AddLocalSearchMonitor(LocalSearchMonitor *monitor) | operations_research::Solver | |
| AddPropagationMonitor(PropagationMonitor *monitor) | operations_research::Solver | |
| ASSIGN_CENTER_VALUE enum value | operations_research::Solver | |
| ASSIGN_MAX_VALUE enum value | operations_research::Solver | |
| ASSIGN_MIN_VALUE enum value | operations_research::Solver | |
| ASSIGN_RANDOM_VALUE enum value | operations_research::Solver | |
| AT_SOLUTION enum value | operations_research::Solver | |
| AVOID_DATE enum value | operations_research::Solver | |
| balancing_decision() const | operations_research::Solver | inline |
| BaseIntExpr class | operations_research::Solver | friend |
| BinaryIntervalRelation enum name | operations_research::Solver | |
| branches() const | operations_research::Solver | inline |
| BranchSelector typedef | operations_research::Solver | |
| Cache() const | operations_research::Solver | |
| CastExpression(const IntVar *var) const | operations_research::Solver | |
| CheckAssignment(Assignment *solution) | operations_research::Solver | |
| CheckConstraint(Constraint *ct) | operations_research::Solver | |
| CheckFail() | operations_research::Solver | inline |
| CHOICE_POINT enum value | operations_research::Solver | |
| CHOOSE_DYNAMIC_GLOBAL_BEST enum value | operations_research::Solver | |
| CHOOSE_FIRST_UNBOUND enum value | operations_research::Solver | |
| CHOOSE_HIGHEST_MAX enum value | operations_research::Solver | |
| CHOOSE_LOWEST_MIN enum value | operations_research::Solver | |
| CHOOSE_MAX_REGRET_ON_MIN enum value | operations_research::Solver | |
| CHOOSE_MAX_SIZE enum value | operations_research::Solver | |
| CHOOSE_MIN_SIZE enum value | operations_research::Solver | |
| CHOOSE_MIN_SIZE_HIGHEST_MAX enum value | operations_research::Solver | |
| CHOOSE_MIN_SIZE_HIGHEST_MIN enum value | operations_research::Solver | |
| CHOOSE_MIN_SIZE_LOWEST_MAX enum value | operations_research::Solver | |
| CHOOSE_MIN_SIZE_LOWEST_MIN enum value | operations_research::Solver | |
| CHOOSE_MIN_SLACK_RANK_FORWARD enum value | operations_research::Solver | |
| CHOOSE_PATH enum value | operations_research::Solver | |
| CHOOSE_RANDOM enum value | operations_research::Solver | |
| CHOOSE_RANDOM_RANK_FORWARD enum value | operations_research::Solver | |
| CHOOSE_STATIC_GLOBAL_BEST enum value | operations_research::Solver | |
| clear_fail_intercept() | operations_research::Solver | inline |
| ClearLocalSearchState() | operations_research::Solver | inline |
| ClearNeighbors() | operations_research::Solver | inline |
| Closure typedef | operations_research::Solver | |
| Compose(DecisionBuilder *db1, DecisionBuilder *db2) | operations_research::Solver | |
| Compose(DecisionBuilder *db1, DecisionBuilder *db2, DecisionBuilder *db3) | operations_research::Solver | |
| Compose(DecisionBuilder *db1, DecisionBuilder *db2, DecisionBuilder *db3, DecisionBuilder *db4) | operations_research::Solver | |
| Compose(const std::vector< DecisionBuilder * > &dbs) | operations_research::Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops) | operations_research::Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, bool restart) | operations_research::Solver | |
| ConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, std::function< int64_t(int, int)> evaluator) | operations_research::Solver | |
| const_parameters() const | operations_research::Solver | inline |
| Constraint class | operations_research::Solver | friend |
| constraints() const | operations_research::Solver | inline |
| context() const | operations_research::Solver | inline |
| CROSS enum value | operations_research::Solver | |
| CROSS_DATE enum value | operations_research::Solver | |
| CurrentlyInSolve() const | operations_research::Solver | |
| DebugString() const | operations_research::Solver | |
| DecisionModification enum name | operations_research::Solver | |
| DECREMENT enum value | operations_research::Solver | |
| DefaultSolverParameters() | operations_research::Solver | static |
| DELAYED_PRIORITY enum value | operations_research::Solver | |
| demon_profiler() const | operations_research::Solver | inline |
| demon_runs(DemonPriority p) const | operations_research::Solver | inline |
| DemonPriority enum name | operations_research::Solver | |
| DemonProfiler class | operations_research::Solver | friend |
| ENDS_AFTER enum value | operations_research::Solver | |
| ENDS_AFTER_END enum value | operations_research::Solver | |
| ENDS_AFTER_START enum value | operations_research::Solver | |
| ENDS_AT enum value | operations_research::Solver | |
| ENDS_AT_END enum value | operations_research::Solver | |
| ENDS_AT_START enum value | operations_research::Solver | |
| ENDS_BEFORE enum value | operations_research::Solver | |
| EndSearch() | operations_research::Solver | |
| EQ enum value | operations_research::Solver | |
| EvaluatorLocalSearchOperators enum name | operations_research::Solver | |
| EvaluatorStrategy enum name | operations_research::Solver | |
| EXCHANGE enum value | operations_research::Solver | |
| ExportProfilingOverview(const std::string &filename) | operations_research::Solver | |
| EXTENDEDSWAPACTIVE enum value | operations_research::Solver | |
| Fail() | operations_research::Solver | |
| fail_stamp() const | operations_research::Solver | |
| failures() const | operations_research::Solver | inline |
| filtered_neighbors() const | operations_research::Solver | inline |
| FindOneNeighbor class | operations_research::Solver | friend |
| FinishCurrentSearch() | operations_research::Solver | |
| FULLPATHLNS enum value | operations_research::Solver | |
| GE enum value | operations_research::Solver | |
| GetConstraintSolverStatistics() const | operations_research::Solver | |
| GetGuidedLocalSearchPenalty(int64_t i, int64_t j, int64_t k) const | operations_research::Solver | inline |
| GetLocalSearchMonitor() const | operations_research::Solver | |
| GetLocalSearchStatistics() const | operations_research::Solver | |
| GetOrCreateLocalSearchState() | operations_research::Solver | |
| GetPropagationMonitor() const | operations_research::Solver | |
| HasName(const PropagationBaseObject *object) const | operations_research::Solver | |
| IN_ROOT_NODE enum value | operations_research::Solver | |
| IN_SEARCH enum value | operations_research::Solver | |
| INCREMENT enum value | operations_research::Solver | |
| IncrementNeighbors() | operations_research::Solver | inline |
| IndexEvaluator1 typedef | operations_research::Solver | |
| IndexEvaluator2 typedef | operations_research::Solver | |
| IndexEvaluator3 typedef | operations_research::Solver | |
| IndexFilter1 typedef | operations_research::Solver | |
| InstrumentsDemons() const | operations_research::Solver | |
| InstrumentsVariables() const | operations_research::Solver | |
| Int64ToIntVar typedef | operations_research::Solver | |
| INT_VALUE_DEFAULT enum value | operations_research::Solver | |
| INT_VALUE_SIMPLE enum value | operations_research::Solver | |
| INT_VAR_DEFAULT enum value | operations_research::Solver | |
| INT_VAR_SIMPLE enum value | operations_research::Solver | |
| InternalSaveBooleanVarValue(Solver *solver, IntVar *var) | operations_research::Solver | friend |
| INTERVAL_DEFAULT enum value | operations_research::Solver | |
| INTERVAL_SET_TIMES_BACKWARD enum value | operations_research::Solver | |
| INTERVAL_SET_TIMES_FORWARD enum value | operations_research::Solver | |
| INTERVAL_SIMPLE enum value | operations_research::Solver | |
| IntervalStrategy enum name | operations_research::Solver | |
| IntValueStrategy enum name | operations_research::Solver | |
| IntVar class | operations_research::Solver | friend |
| IntVarStrategy enum name | operations_research::Solver | |
| IsBooleanVar(IntExpr *expr, IntVar **inner_var, bool *is_negated) const | operations_research::Solver | |
| IsLocalSearchProfilingEnabled() const | operations_research::Solver | |
| IsProduct(IntExpr *expr, IntExpr **inner_expr, int64_t *coefficient) | operations_research::Solver | |
| IsProfilingEnabled() const | operations_research::Solver | |
| KEEP_LEFT enum value | operations_research::Solver | |
| KEEP_RIGHT enum value | operations_research::Solver | |
| KILL_BOTH enum value | operations_research::Solver | |
| kNumPriorities | operations_research::Solver | static |
| LE enum value | operations_research::Solver | |
| LK enum value | operations_research::Solver | |
| LocalSearch class | operations_research::Solver | friend |
| LocalSearchFilterBound enum name | operations_research::Solver | |
| LocalSearchOperators enum name | operations_research::Solver | |
| LocalSearchProfile() const | operations_research::Solver | |
| LocalSearchProfiler class | operations_research::Solver | friend |
| MakeAbs(IntExpr *expr) | operations_research::Solver | |
| MakeAbsEquality(IntVar *var, IntVar *abs_var) | operations_research::Solver | |
| MakeAcceptFilter() | operations_research::Solver | |
| MakeActionDemon(Action action) | operations_research::Solver | |
| MAKEACTIVE enum value | operations_research::Solver | |
| MakeAllDifferent(const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeAllDifferent(const std::vector< IntVar * > &vars, bool stronger_propagation) | operations_research::Solver | |
| MakeAllDifferentExcept(const std::vector< IntVar * > &vars, int64_t escape_value) | operations_research::Solver | |
| MakeAllowedAssignments(const std::vector< IntVar * > &vars, const IntTupleSet &tuples) | operations_research::Solver | |
| MakeAllSolutionCollector(const Assignment *assignment) | operations_research::Solver | |
| MakeAllSolutionCollector() | operations_research::Solver | |
| MakeApplyBranchSelector(BranchSelector bs) | operations_research::Solver | |
| MakeAssignment() | operations_research::Solver | |
| MakeAssignment(const Assignment *a) | operations_research::Solver | |
| MakeAssignVariablesValues(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeAssignVariablesValuesOrDoNothing(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeAssignVariablesValuesOrFail(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeAssignVariableValue(IntVar *var, int64_t val) | operations_research::Solver | |
| MakeAssignVariableValueOrDoNothing(IntVar *var, int64_t value) | operations_research::Solver | |
| MakeAssignVariableValueOrFail(IntVar *var, int64_t value) | operations_research::Solver | |
| MakeAtMost(std::vector< IntVar * > vars, int64_t value, int64_t max_count) | operations_research::Solver | |
| MakeAtSolutionCallback(std::function< void()> callback) | operations_research::Solver | |
| MakeBestLexicographicValueSolutionCollector(const Assignment *assignment, std::vector< bool > maximize) | operations_research::Solver | |
| MakeBestLexicographicValueSolutionCollector(std::vector< bool > maximize) | operations_research::Solver | |
| MakeBestValueSolutionCollector(const Assignment *assignment, bool maximize) | operations_research::Solver | |
| MakeBestValueSolutionCollector(bool maximize) | operations_research::Solver | |
| MakeBetweenCt(IntExpr *expr, int64_t l, int64_t u) | operations_research::Solver | |
| MakeBoolVar(const std::string &name) | operations_research::Solver | |
| MakeBoolVar() | operations_research::Solver | |
| MakeBoolVarArray(int var_count, const std::string &name, std::vector< IntVar * > *vars) | operations_research::Solver | |
| MakeBoolVarArray(int var_count, std::vector< IntVar * > *vars) | operations_research::Solver | |
| MakeBoolVarArray(int var_count, const std::string &name) | operations_research::Solver | |
| MakeBranchesLimit(int64_t branches) | operations_research::Solver | |
| MAKECHAININACTIVE enum value | operations_research::Solver | |
| MakeCircuit(const std::vector< IntVar * > &nexts) | operations_research::Solver | |
| MakeClosureDemon(Closure closure) | operations_research::Solver | |
| MakeConditionalExpression(IntVar *condition, IntExpr *expr, int64_t unperformed_value) | operations_research::Solver | |
| MakeConstantRestart(int frequency) | operations_research::Solver | |
| MakeConstraintAdder(Constraint *ct) | operations_research::Solver | |
| MakeConstraintInitialPropagateCallback(Constraint *ct) | operations_research::Solver | |
| MakeConvexPiecewiseExpr(IntExpr *expr, int64_t early_cost, int64_t early_date, int64_t late_date, int64_t late_cost) | operations_research::Solver | |
| MakeCount(const std::vector< IntVar * > &vars, int64_t value, int64_t max_count) | operations_research::Solver | |
| MakeCount(const std::vector< IntVar * > &vars, int64_t value, IntVar *max_count) | operations_research::Solver | |
| MakeCover(const std::vector< IntervalVar * > &vars, IntervalVar *target_var) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int64_t > &demands, int64_t capacity, const std::string &name) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int > &demands, int64_t capacity, const std::string &name) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int64_t > &demands, IntVar *capacity, absl::string_view name) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< int > &demands, IntVar *capacity, const std::string &name) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< IntVar * > &demands, int64_t capacity, const std::string &name) | operations_research::Solver | |
| MakeCumulative(const std::vector< IntervalVar * > &intervals, const std::vector< IntVar * > &demands, IntVar *capacity, const std::string &name) | operations_research::Solver | |
| MakeCustomLimit(std::function< bool()> limiter) | operations_research::Solver | |
| MakeDecision(Action apply, Action refute) | operations_research::Solver | |
| MakeDecisionBuilderFromAssignment(Assignment *assignment, DecisionBuilder *db, const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeDefaultPhase(const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeDefaultPhase(const std::vector< IntVar * > &vars, const DefaultPhaseParameters ¶meters) | operations_research::Solver | |
| MakeDefaultRegularLimitParameters() const | operations_research::Solver | |
| MakeDefaultSolutionPool() | operations_research::Solver | |
| MakeDelayedConstraintInitialPropagateCallback(Constraint *ct) | operations_research::Solver | |
| MakeDelayedPathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &transits) | operations_research::Solver | |
| MakeDeviation(const std::vector< IntVar * > &vars, IntVar *deviation_var, int64_t total_sum) | operations_research::Solver | |
| MakeDifference(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeDifference(int64_t value, IntExpr *expr) | operations_research::Solver | |
| MakeDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values, const std::vector< IntVar * > &cards) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &values, const std::vector< IntVar * > &cards) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &cards) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, int64_t card_min, int64_t card_max, int64_t card_size) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64_t > &card_min, const std::vector< int64_t > &card_max) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &card_min, const std::vector< int > &card_max) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int64_t > &values, const std::vector< int64_t > &card_min, const std::vector< int64_t > &card_max) | operations_research::Solver | |
| MakeDistribute(const std::vector< IntVar * > &vars, const std::vector< int > &values, const std::vector< int > &card_min, const std::vector< int > &card_max) | operations_research::Solver | |
| MakeDiv(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeDiv(IntExpr *numerator, IntExpr *denominator) | operations_research::Solver | |
| MakeElement(const std::vector< int64_t > &values, IntVar *index) | operations_research::Solver | |
| MakeElement(const std::vector< int > &values, IntVar *index) | operations_research::Solver | |
| MakeElement(IndexEvaluator1 values, IntVar *index) | operations_research::Solver | |
| MakeElement(IndexEvaluator2 values, IntVar *index1, IntVar *index2) | operations_research::Solver | |
| MakeElement(const std::vector< IntVar * > &vars, IntVar *index) | operations_research::Solver | |
| MakeElement(Int64ToIntVar vars, int64_t range_start, int64_t range_end, IntVar *argument) | operations_research::Solver | |
| MakeElementEquality(const std::vector< int64_t > &vals, IntVar *index, IntVar *target) | operations_research::Solver | |
| MakeElementEquality(const std::vector< int > &vals, IntVar *index, IntVar *target) | operations_research::Solver | |
| MakeElementEquality(const std::vector< IntVar * > &vars, IntVar *index, IntVar *target) | operations_research::Solver | |
| MakeElementEquality(const std::vector< IntVar * > &vars, IntVar *index, int64_t target) | operations_research::Solver | |
| MakeEnterSearchCallback(std::function< void()> callback) | operations_research::Solver | |
| MakeEquality(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeEquality(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeEquality(IntExpr *expr, int value) | operations_research::Solver | |
| MakeEquality(IntervalVar *var1, IntervalVar *var2) | operations_research::Solver | |
| MakeExitSearchCallback(std::function< void()> callback) | operations_research::Solver | |
| MakeFailDecision() | operations_research::Solver | |
| MakeFailuresLimit(int64_t failures) | operations_research::Solver | |
| MakeFalseConstraint() | operations_research::Solver | |
| MakeFalseConstraint(const std::string &explanation) | operations_research::Solver | |
| MakeFirstSolutionCollector(const Assignment *assignment) | operations_research::Solver | |
| MakeFirstSolutionCollector() | operations_research::Solver | |
| MakeFixedDurationEndSyncedOnEndIntervalVar(IntervalVar *interval_var, int64_t duration, int64_t offset) | operations_research::Solver | |
| MakeFixedDurationEndSyncedOnStartIntervalVar(IntervalVar *interval_var, int64_t duration, int64_t offset) | operations_research::Solver | |
| MakeFixedDurationIntervalVar(int64_t start_min, int64_t start_max, int64_t duration, bool optional, const std::string &name) | operations_research::Solver | |
| MakeFixedDurationIntervalVar(IntVar *start_variable, int64_t duration, const std::string &name) | operations_research::Solver | |
| MakeFixedDurationIntervalVar(IntVar *start_variable, int64_t duration, IntVar *performed_variable, const std::string &name) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(int count, int64_t start_min, int64_t start_max, int64_t duration, bool optional, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, int64_t duration, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, absl::Span< const int64_t > durations, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, absl::Span< const int > durations, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, absl::Span< const int64_t > durations, const std::vector< IntVar * > &performed_variables, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationIntervalVarArray(const std::vector< IntVar * > &start_variables, absl::Span< const int > durations, const std::vector< IntVar * > &performed_variables, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeFixedDurationStartSyncedOnEndIntervalVar(IntervalVar *interval_var, int64_t duration, int64_t offset) | operations_research::Solver | |
| MakeFixedDurationStartSyncedOnStartIntervalVar(IntervalVar *interval_var, int64_t duration, int64_t offset) | operations_research::Solver | |
| MakeFixedInterval(int64_t start, int64_t duration, const std::string &name) | operations_research::Solver | |
| MakeGenericTabuSearch(bool maximize, IntVar *v, int64_t step, const std::vector< IntVar * > &tabu_vars, int64_t forbid_tenure) | operations_research::Solver | |
| MakeGreater(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeGreater(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeGreater(IntExpr *expr, int value) | operations_research::Solver | |
| MakeGreaterOrEqual(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeGreaterOrEqual(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeGreaterOrEqual(IntExpr *expr, int value) | operations_research::Solver | |
| MakeGuidedLocalSearch(bool maximize, IntVar *objective, IndexEvaluator2 objective_function, int64_t step, const std::vector< IntVar * > &vars, double penalty_factor, std::function< std::vector< std::pair< int64_t, int64_t > >(int64_t, int64_t)> get_equivalent_pairs=nullptr, bool reset_penalties_on_new_best_solution=false) | operations_research::Solver | |
| MakeGuidedLocalSearch(bool maximize, IntVar *objective, IndexEvaluator3 objective_function, int64_t step, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, double penalty_factor, std::function< std::vector< std::pair< int64_t, int64_t > >(int64_t, int64_t)> get_equivalent_pairs=nullptr, bool reset_penalties_on_new_best_solution=false) | operations_research::Solver | |
| MakeIfThenElseCt(IntVar *condition, IntExpr *then_expr, IntExpr *else_expr, IntVar *target_var) | operations_research::Solver | |
| MakeImprovementLimit(IntVar *objective_var, bool maximize, double objective_scaling_factor, double objective_offset, double improvement_rate_coefficient, int improvement_rate_solutions_distance) | operations_research::Solver | |
| MAKEINACTIVE enum value | operations_research::Solver | |
| MakeIndexExpression(const std::vector< IntVar * > &vars, int64_t value) | operations_research::Solver | |
| MakeIndexOfConstraint(const std::vector< IntVar * > &vars, IntVar *index, int64_t target) | operations_research::Solver | |
| MakeIndexOfFirstMaxValueConstraint(IntVar *index, const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeIndexOfFirstMinValueConstraint(IntVar *index, const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeIntConst(int64_t val, const std::string &name) | operations_research::Solver | |
| MakeIntConst(int64_t val) | operations_research::Solver | |
| MakeIntervalRelaxedMax(IntervalVar *interval_var) | operations_research::Solver | |
| MakeIntervalRelaxedMin(IntervalVar *interval_var) | operations_research::Solver | |
| MakeIntervalVar(int64_t start_min, int64_t start_max, int64_t duration_min, int64_t duration_max, int64_t end_min, int64_t end_max, bool optional, const std::string &name) | operations_research::Solver | |
| MakeIntervalVarArray(int count, int64_t start_min, int64_t start_max, int64_t duration_min, int64_t duration_max, int64_t end_min, int64_t end_max, bool optional, absl::string_view name, std::vector< IntervalVar * > *array) | operations_research::Solver | |
| MakeIntervalVarRelation(IntervalVar *t, UnaryIntervalRelation r, int64_t d) | operations_research::Solver | |
| MakeIntervalVarRelation(IntervalVar *t1, BinaryIntervalRelation r, IntervalVar *t2) | operations_research::Solver | |
| MakeIntervalVarRelationWithDelay(IntervalVar *t1, BinaryIntervalRelation r, IntervalVar *t2, int64_t delay) | operations_research::Solver | |
| MakeIntVar(int64_t min, int64_t max, const std::string &name) | operations_research::Solver | |
| MakeIntVar(const std::vector< int64_t > &values, const std::string &name) | operations_research::Solver | |
| MakeIntVar(const std::vector< int > &values, const std::string &name) | operations_research::Solver | |
| MakeIntVar(int64_t min, int64_t max) | operations_research::Solver | |
| MakeIntVar(const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeIntVar(const std::vector< int > &values) | operations_research::Solver | |
| MakeIntVarArray(int var_count, int64_t vmin, int64_t vmax, const std::string &name, std::vector< IntVar * > *vars) | operations_research::Solver | |
| MakeIntVarArray(int var_count, int64_t vmin, int64_t vmax, std::vector< IntVar * > *vars) | operations_research::Solver | |
| MakeIntVarArray(int var_count, int64_t vmin, int64_t vmax, const std::string &name) | operations_research::Solver | |
| MakeInversePermutationConstraint(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | operations_research::Solver | |
| MakeIsBetweenCt(IntExpr *expr, int64_t l, int64_t u, IntVar *b) | operations_research::Solver | |
| MakeIsBetweenVar(IntExpr *v, int64_t l, int64_t u) | operations_research::Solver | |
| MakeIsDifferentCstCt(IntExpr *var, int64_t value, IntVar *boolvar) | operations_research::Solver | |
| MakeIsDifferentCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsDifferentCt(IntExpr *v1, IntExpr *v2, IntVar *b) | operations_research::Solver | |
| MakeIsDifferentVar(IntExpr *v1, IntExpr *v2) | operations_research::Solver | |
| MakeIsEqualCstCt(IntExpr *var, int64_t value, IntVar *boolvar) | operations_research::Solver | |
| MakeIsEqualCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsEqualCt(IntExpr *v1, IntExpr *v2, IntVar *b) | operations_research::Solver | |
| MakeIsEqualVar(IntExpr *v1, IntExpr *v2) | operations_research::Solver | |
| MakeIsGreaterCstCt(IntExpr *v, int64_t c, IntVar *b) | operations_research::Solver | |
| MakeIsGreaterCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsGreaterCt(IntExpr *left, IntExpr *right, IntVar *b) | operations_research::Solver | |
| MakeIsGreaterOrEqualCstCt(IntExpr *var, int64_t value, IntVar *boolvar) | operations_research::Solver | |
| MakeIsGreaterOrEqualCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsGreaterOrEqualCt(IntExpr *left, IntExpr *right, IntVar *b) | operations_research::Solver | |
| MakeIsGreaterOrEqualVar(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeIsGreaterVar(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeIsLessCstCt(IntExpr *v, int64_t c, IntVar *b) | operations_research::Solver | |
| MakeIsLessCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsLessCt(IntExpr *left, IntExpr *right, IntVar *b) | operations_research::Solver | |
| MakeIsLessOrEqualCstCt(IntExpr *var, int64_t value, IntVar *boolvar) | operations_research::Solver | |
| MakeIsLessOrEqualCstVar(IntExpr *var, int64_t value) | operations_research::Solver | |
| MakeIsLessOrEqualCt(IntExpr *left, IntExpr *right, IntVar *b) | operations_research::Solver | |
| MakeIsLessOrEqualVar(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeIsLessVar(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeIsLexicalLessOrEqualWithOffsetsCt(std::vector< IntVar * > left, std::vector< IntVar * > right, std::vector< int64_t > offsets, IntVar *boolvar) | operations_research::Solver | |
| MakeIsMemberCt(IntExpr *expr, const std::vector< int64_t > &values, IntVar *boolvar) | operations_research::Solver | |
| MakeIsMemberCt(IntExpr *expr, const std::vector< int > &values, IntVar *boolvar) | operations_research::Solver | |
| MakeIsMemberVar(IntExpr *expr, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeIsMemberVar(IntExpr *expr, const std::vector< int > &values) | operations_research::Solver | |
| MakeLastSolutionCollector(const Assignment *assignment) | operations_research::Solver | |
| MakeLastSolutionCollector() | operations_research::Solver | |
| MakeLess(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeLess(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeLess(IntExpr *expr, int value) | operations_research::Solver | |
| MakeLessOrEqual(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeLessOrEqual(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeLessOrEqual(IntExpr *expr, int value) | operations_research::Solver | |
| MakeLexicalLess(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | operations_research::Solver | |
| MakeLexicalLessOrEqual(const std::vector< IntVar * > &left, const std::vector< IntVar * > &right) | operations_research::Solver | |
| MakeLexicalLessOrEqualWithOffsets(std::vector< IntVar * > left, std::vector< IntVar * > right, std::vector< int64_t > offsets) | operations_research::Solver | |
| MakeLexicographicImprovementLimit(std::vector< IntVar * > objective_vars, std::vector< bool > maximize, std::vector< double > objective_scaling_factors, std::vector< double > objective_offsets, double improvement_rate_coefficient, int improvement_rate_solutions_distance) | operations_research::Solver | |
| MakeLexicographicOptimize(std::vector< bool > maximize, std::vector< IntVar * > variables, std::vector< int64_t > steps) | operations_research::Solver | |
| MakeLexicographicSimulatedAnnealing(const std::vector< bool > &maximize, std::vector< IntVar * > vars, std::vector< int64_t > steps, std::vector< int64_t > initial_temperatures) | operations_research::Solver | |
| MakeLexicographicTabuSearch(const std::vector< bool > &maximize, std::vector< IntVar * > objectives, std::vector< int64_t > steps, const std::vector< IntVar * > &vars, int64_t keep_tenure, int64_t forbid_tenure, double tabu_factor) | operations_research::Solver | |
| MakeLightElement(F values, IntVar *const var, IntVar *const index, std::function< bool()> deep_serialize=nullptr) | operations_research::Solver | inline |
| MakeLightElement(F values, IntVar *const var, IntVar *const index1, IntVar *const index2, std::function< bool()> deep_serialize=nullptr) | operations_research::Solver | inline |
| MakeLightElement(F values, IntVar *const var, IntVar *const index1, IntVar *const index2, IntVar *const index3) | operations_research::Solver | inline |
| MakeLimit(absl::Duration time, int64_t branches, int64_t failures, int64_t solutions, bool smart_time_check=false, bool cumulative=false) | operations_research::Solver | |
| MakeLimit(const RegularLimitParameters &proto) | operations_research::Solver | |
| MakeLimit(int64_t time, int64_t branches, int64_t failures, int64_t solutions, bool smart_time_check=false, bool cumulative=false) | operations_research::Solver | |
| MakeLimit(SearchLimit *limit_1, SearchLimit *limit_2) | operations_research::Solver | |
| MakeLocalSearchPhase(Assignment *assignment, LocalSearchPhaseParameters *parameters) | operations_research::Solver | |
| MakeLocalSearchPhase(const std::vector< IntVar * > &vars, DecisionBuilder *first_solution, LocalSearchPhaseParameters *parameters) | operations_research::Solver | |
| MakeLocalSearchPhase(const std::vector< IntVar * > &vars, DecisionBuilder *first_solution, DecisionBuilder *first_solution_sub_decision_builder, LocalSearchPhaseParameters *parameters) | operations_research::Solver | |
| MakeLocalSearchPhase(const std::vector< SequenceVar * > &vars, DecisionBuilder *first_solution, LocalSearchPhaseParameters *parameters) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder, RegularLimit *limit) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder, RegularLimit *limit, LocalSearchFilterManager *filter_manager) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *pool, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *pool, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder, RegularLimit *limit) | operations_research::Solver | |
| MakeLocalSearchPhaseParameters(IntVar *objective, SolutionPool *pool, LocalSearchOperator *ls_operator, DecisionBuilder *sub_decision_builder, RegularLimit *limit, LocalSearchFilterManager *filter_manager) | operations_research::Solver | |
| MakeLubyRestart(int scale_factor) | operations_research::Solver | |
| MakeMapDomain(IntVar *var, const std::vector< IntVar * > &actives) | operations_research::Solver | |
| MakeMax(const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeMax(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeMax(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeMax(IntExpr *expr, int value) | operations_research::Solver | |
| MakeMaxEquality(const std::vector< IntVar * > &vars, IntVar *max_var) | operations_research::Solver | |
| MakeMaximize(IntVar *v, int64_t step) | operations_research::Solver | |
| MakeMemberCt(IntExpr *expr, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeMemberCt(IntExpr *expr, const std::vector< int > &values) | operations_research::Solver | |
| MakeMin(const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeMin(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeMin(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeMin(IntExpr *expr, int value) | operations_research::Solver | |
| MakeMinEquality(const std::vector< IntVar * > &vars, IntVar *min_var) | operations_research::Solver | |
| MakeMinimize(IntVar *v, int64_t step) | operations_research::Solver | |
| MakeMirrorInterval(IntervalVar *interval_var) | operations_research::Solver | |
| MakeModulo(IntExpr *x, int64_t mod) | operations_research::Solver | |
| MakeModulo(IntExpr *x, IntExpr *mod) | operations_research::Solver | |
| MakeMonotonicElement(IndexEvaluator1 values, bool increasing, IntVar *index) | operations_research::Solver | |
| MakeMoveTowardTargetOperator(const Assignment &target) | operations_research::Solver | |
| MakeMoveTowardTargetOperator(const std::vector< IntVar * > &variables, const std::vector< int64_t > &target_values) | operations_research::Solver | |
| MakeNBestLexicographicValueSolutionCollector(const Assignment *assignment, int solution_count, std::vector< bool > maximize) | operations_research::Solver | |
| MakeNBestLexicographicValueSolutionCollector(int solution_count, std::vector< bool > maximize) | operations_research::Solver | |
| MakeNBestValueSolutionCollector(const Assignment *assignment, int solution_count, bool maximize) | operations_research::Solver | |
| MakeNBestValueSolutionCollector(int solution_count, bool maximize) | operations_research::Solver | |
| MakeNeighborhoodLimit(LocalSearchOperator *op, int64_t limit) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step, SearchMonitor *monitor1) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step, SearchMonitor *monitor1, SearchMonitor *monitor2) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step, SearchMonitor *monitor1, SearchMonitor *monitor2, SearchMonitor *monitor3) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step, SearchMonitor *monitor1, SearchMonitor *monitor2, SearchMonitor *monitor3, SearchMonitor *monitor4) | operations_research::Solver | |
| MakeNestedOptimize(DecisionBuilder *db, Assignment *solution, bool maximize, int64_t step, const std::vector< SearchMonitor * > &monitors) | operations_research::Solver | |
| MakeNoCycle(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, IndexFilter1 sink_handler=nullptr) | operations_research::Solver | |
| MakeNoCycle(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, IndexFilter1 sink_handler, bool assume_paths) | operations_research::Solver | |
| MakeNonEquality(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeNonEquality(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeNonEquality(IntExpr *expr, int value) | operations_research::Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size) | operations_research::Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, absl::Span< const int64_t > x_size, absl::Span< const int64_t > y_size) | operations_research::Solver | |
| MakeNonOverlappingBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, absl::Span< const int > x_size, absl::Span< const int > y_size) | operations_research::Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, const std::vector< IntVar * > &x_size, const std::vector< IntVar * > &y_size) | operations_research::Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, absl::Span< const int64_t > x_size, absl::Span< const int64_t > y_size) | operations_research::Solver | |
| MakeNonOverlappingNonStrictBoxesConstraint(const std::vector< IntVar * > &x_vars, const std::vector< IntVar * > &y_vars, absl::Span< const int > x_size, absl::Span< const int > y_size) | operations_research::Solver | |
| MakeNotBetweenCt(IntExpr *expr, int64_t l, int64_t u) | operations_research::Solver | |
| MakeNotMemberCt(IntExpr *expr, const std::vector< int64_t > &values) | operations_research::Solver | |
| MakeNotMemberCt(IntExpr *expr, const std::vector< int > &values) | operations_research::Solver | |
| MakeNotMemberCt(IntExpr *expr, std::vector< int64_t > starts, std::vector< int64_t > ends) | operations_research::Solver | |
| MakeNotMemberCt(IntExpr *expr, std::vector< int > starts, std::vector< int > ends) | operations_research::Solver | |
| MakeNotMemberCt(IntExpr *expr, SortedDisjointIntervalList intervals) | operations_research::Solver | |
| MakeNullIntersect(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars) | operations_research::Solver | |
| MakeNullIntersectExcept(const std::vector< IntVar * > &first_vars, const std::vector< IntVar * > &second_vars, int64_t escape_value) | operations_research::Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, LocalSearchOperators op, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) | operations_research::Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchOperators op, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) | operations_research::Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, IndexEvaluator3 evaluator, EvaluatorLocalSearchOperators op) | operations_research::Solver | |
| MakeOperator(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, IndexEvaluator3 evaluator, EvaluatorLocalSearchOperators op) | operations_research::Solver | |
| MakeOpposite(IntExpr *expr) | operations_research::Solver | |
| MakeOptimize(bool maximize, IntVar *v, int64_t step) | operations_research::Solver | |
| MakePack(const std::vector< IntVar * > &vars, int number_of_bins) | operations_research::Solver | |
| MakePathConnected(std::vector< IntVar * > nexts, std::vector< int64_t > sources, std::vector< int64_t > sinks, std::vector< IntVar * > status) | operations_research::Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &transits) | operations_research::Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, IndexEvaluator2 transit_evaluator) | operations_research::Solver | |
| MakePathCumul(const std::vector< IntVar * > &nexts, const std::vector< IntVar * > &active, const std::vector< IntVar * > &cumuls, const std::vector< IntVar * > &slacks, IndexEvaluator2 transit_evaluator) | operations_research::Solver | |
| MakePathEnergyCostConstraint(PathEnergyCostConstraintSpecification specification) | operations_research::Solver | |
| MakePathPrecedenceConstraint(std::vector< IntVar * > nexts, const std::vector< std::pair< int, int > > &precedences) | operations_research::Solver | |
| MakePathPrecedenceConstraint(std::vector< IntVar * > nexts, const std::vector< std::pair< int, int > > &precedences, absl::Span< const int > lifo_path_starts, absl::Span< const int > fifo_path_starts) | operations_research::Solver | |
| MakePathTransitPrecedenceConstraint(std::vector< IntVar * > nexts, std::vector< IntVar * > transits, const std::vector< std::pair< int, int > > &precedences) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IndexEvaluator2 value_evaluator) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, VariableValueComparator var_val1_val2_comparator) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IndexEvaluator2 value_evaluator) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IntVarStrategy var_str, IndexEvaluator2 value_evaluator, IndexEvaluator1 tie_breaker) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator1 var_evaluator, IndexEvaluator2 value_evaluator, IndexEvaluator1 tie_breaker) | operations_research::Solver | |
| MakePhase(IntVar *v0, IntVarStrategy var_str, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(IntVar *v0, IntVar *v1, IntVarStrategy var_str, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(IntVar *v0, IntVar *v1, IntVar *v2, IntVarStrategy var_str, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(IntVar *v0, IntVar *v1, IntVar *v2, IntVar *v3, IntVarStrategy var_str, IntValueStrategy val_str) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator2 eval, EvaluatorStrategy str) | operations_research::Solver | |
| MakePhase(const std::vector< IntVar * > &vars, IndexEvaluator2 eval, IndexEvaluator1 tie_breaker, EvaluatorStrategy str) | operations_research::Solver | |
| MakePhase(const std::vector< IntervalVar * > &intervals, IntervalStrategy str) | operations_research::Solver | |
| MakePhase(const std::vector< SequenceVar * > &sequences, SequenceStrategy str) | operations_research::Solver | |
| MakePiecewiseLinearExpr(IntExpr *expr, const PiecewiseLinearFunction &f) | operations_research::Solver | |
| MakePower(IntExpr *expr, int64_t n) | operations_research::Solver | |
| MakePrintModelVisitor() | operations_research::Solver | |
| MakeProd(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeProd(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeProfiledDecisionBuilderWrapper(DecisionBuilder *db) | operations_research::Solver | |
| MakeRandomLnsOperator(const std::vector< IntVar * > &vars, int number_of_variables) | operations_research::Solver | |
| MakeRandomLnsOperator(const std::vector< IntVar * > &vars, int number_of_variables, int32_t seed) | operations_research::Solver | |
| MakeRankFirstInterval(SequenceVar *sequence, int index) | operations_research::Solver | |
| MakeRankLastInterval(SequenceVar *sequence, int index) | operations_research::Solver | |
| MakeRejectFilter() | operations_research::Solver | |
| MakeRestoreAssignment(Assignment *assignment) | operations_research::Solver | |
| MakeRoundRobinCompoundObjectiveMonitor(std::vector< BaseObjectiveMonitor * > monitors, int num_max_local_optima_before_metaheuristic_switch) | operations_research::Solver | |
| MakeScalProd(const std::vector< IntVar * > &vars, const std::vector< int64_t > &coefs) | operations_research::Solver | |
| MakeScalProd(const std::vector< IntVar * > &vars, const std::vector< int > &coefs) | operations_research::Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int64_t > &coefficients, int64_t cst) | operations_research::Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, int64_t cst) | operations_research::Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int64_t > &coefficients, IntVar *target) | operations_research::Solver | |
| MakeScalProdEquality(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, IntVar *target) | operations_research::Solver | |
| MakeScalProdGreaterOrEqual(const std::vector< IntVar * > &vars, const std::vector< int64_t > &coeffs, int64_t cst) | operations_research::Solver | |
| MakeScalProdGreaterOrEqual(const std::vector< IntVar * > &vars, const std::vector< int > &coeffs, int64_t cst) | operations_research::Solver | |
| MakeScalProdLessOrEqual(const std::vector< IntVar * > &vars, const std::vector< int64_t > &coefficients, int64_t cst) | operations_research::Solver | |
| MakeScalProdLessOrEqual(const std::vector< IntVar * > &vars, const std::vector< int > &coefficients, int64_t cst) | operations_research::Solver | |
| MakeScheduleOrExpedite(IntervalVar *var, int64_t est, int64_t *marker) | operations_research::Solver | |
| MakeScheduleOrPostpone(IntervalVar *var, int64_t est, int64_t *marker) | operations_research::Solver | |
| MakeSearchLog(int branch_period) | operations_research::Solver | |
| MakeSearchLog(int branch_period, IntVar *var) | operations_research::Solver | |
| MakeSearchLog(int branch_period, std::function< std::string()> display_callback) | operations_research::Solver | |
| MakeSearchLog(int branch_period, IntVar *var, std::function< std::string()> display_callback) | operations_research::Solver | |
| MakeSearchLog(int branch_period, std::vector< IntVar * > vars, std::function< std::string()> display_callback) | operations_research::Solver | |
| MakeSearchLog(int branch_period, OptimizeVar *opt_var) | operations_research::Solver | |
| MakeSearchLog(int branch_period, OptimizeVar *opt_var, std::function< std::string()> display_callback) | operations_research::Solver | |
| MakeSearchLog(SearchLogParameters parameters) | operations_research::Solver | |
| MakeSearchTrace(const std::string &prefix) | operations_research::Solver | |
| MakeSemiContinuousExpr(IntExpr *expr, int64_t fixed_charge, int64_t step) | operations_research::Solver | |
| MakeSimulatedAnnealing(bool maximize, IntVar *v, int64_t step, int64_t initial_temperature) | operations_research::Solver | |
| MakeSolutionsLimit(int64_t solutions) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db, SearchMonitor *monitor1) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db, SearchMonitor *monitor1, SearchMonitor *monitor2) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db, SearchMonitor *monitor1, SearchMonitor *monitor2, SearchMonitor *monitor3) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db, SearchMonitor *monitor1, SearchMonitor *monitor2, SearchMonitor *monitor3, SearchMonitor *monitor4) | operations_research::Solver | |
| MakeSolveOnce(DecisionBuilder *db, const std::vector< SearchMonitor * > &monitors) | operations_research::Solver | |
| MakeSortingConstraint(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &sorted) | operations_research::Solver | |
| MakeSplitVariableDomain(IntVar *var, int64_t val, bool start_with_lower_half) | operations_research::Solver | |
| MakeSquare(IntExpr *expr) | operations_research::Solver | |
| MakeStatisticsModelVisitor() | operations_research::Solver | |
| MakeStoreAssignment(Assignment *assignment) | operations_research::Solver | |
| MakeStrictDisjunctiveConstraint(const std::vector< IntervalVar * > &intervals, const std::string &name) | operations_research::Solver | |
| MakeSubCircuit(const std::vector< IntVar * > &nexts) | operations_research::Solver | |
| MakeSum(IntExpr *left, IntExpr *right) | operations_research::Solver | |
| MakeSum(IntExpr *expr, int64_t value) | operations_research::Solver | |
| MakeSum(const std::vector< IntVar * > &vars) | operations_research::Solver | |
| MakeSumEquality(const std::vector< IntVar * > &vars, int64_t cst) | operations_research::Solver | |
| MakeSumEquality(const std::vector< IntVar * > &vars, IntVar *var) | operations_research::Solver | |
| MakeSumGreaterOrEqual(const std::vector< IntVar * > &vars, int64_t cst) | operations_research::Solver | |
| MakeSumLessOrEqual(const std::vector< IntVar * > &vars, int64_t cst) | operations_research::Solver | |
| MakeSumObjectiveFilter(const std::vector< IntVar * > &vars, IndexEvaluator2 values, Solver::LocalSearchFilterBound filter_enum) | operations_research::Solver | |
| MakeSumObjectiveFilter(const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, IndexEvaluator3 values, Solver::LocalSearchFilterBound filter_enum) | operations_research::Solver | |
| MakeSymmetryManager(const std::vector< SymmetryBreaker * > &visitors) | operations_research::Solver | |
| MakeSymmetryManager(SymmetryBreaker *v1) | operations_research::Solver | |
| MakeSymmetryManager(SymmetryBreaker *v1, SymmetryBreaker *v2) | operations_research::Solver | |
| MakeSymmetryManager(SymmetryBreaker *v1, SymmetryBreaker *v2, SymmetryBreaker *v3) | operations_research::Solver | |
| MakeSymmetryManager(SymmetryBreaker *v1, SymmetryBreaker *v2, SymmetryBreaker *v3, SymmetryBreaker *v4) | operations_research::Solver | |
| MakeTabuSearch(bool maximize, IntVar *objective, int64_t step, const std::vector< IntVar * > &vars, int64_t keep_tenure, int64_t forbid_tenure, double tabu_factor) | operations_research::Solver | |
| MakeTemporalDisjunction(IntervalVar *t1, IntervalVar *t2, IntVar *alt) | operations_research::Solver | |
| MakeTemporalDisjunction(IntervalVar *t1, IntervalVar *t2) | operations_research::Solver | |
| MakeTimeLimit(absl::Duration time) | operations_research::Solver | |
| MakeTimeLimit(int64_t time_in_ms) | operations_research::Solver | inline |
| MakeTransitionConstraint(const std::vector< IntVar * > &vars, const IntTupleSet &transition_table, int64_t initial_state, const std::vector< int64_t > &final_states) | operations_research::Solver | |
| MakeTransitionConstraint(const std::vector< IntVar * > &vars, const IntTupleSet &transition_table, int64_t initial_state, const std::vector< int > &final_states) | operations_research::Solver | |
| MakeTrueConstraint() | operations_research::Solver | |
| MakeVariableDegreeVisitor(absl::flat_hash_map< const IntVar *, int > *map) | operations_research::Solver | |
| MakeVariableDomainFilter() | operations_research::Solver | |
| MakeVariableGreaterOrEqualValue(IntVar *var, int64_t value) | operations_research::Solver | |
| MakeVariableLessOrEqualValue(IntVar *var, int64_t value) | operations_research::Solver | |
| MakeWeightedMaximize(const std::vector< IntVar * > &sub_objectives, const std::vector< int64_t > &weights, int64_t step) | operations_research::Solver | |
| MakeWeightedMaximize(const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64_t step) | operations_research::Solver | |
| MakeWeightedMinimize(const std::vector< IntVar * > &sub_objectives, const std::vector< int64_t > &weights, int64_t step) | operations_research::Solver | |
| MakeWeightedMinimize(const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64_t step) | operations_research::Solver | |
| MakeWeightedOptimize(bool maximize, const std::vector< IntVar * > &sub_objectives, const std::vector< int64_t > &weights, int64_t step) | operations_research::Solver | |
| MakeWeightedOptimize(bool maximize, const std::vector< IntVar * > &sub_objectives, const std::vector< int > &weights, int64_t step) | operations_research::Solver | |
| MarkerType enum name | operations_research::Solver | |
| MAXIMIZATION enum value | operations_research::Solver | |
| MemoryUsage() | operations_research::Solver | static |
| MINIMIZATION enum value | operations_research::Solver | |
| model_name() const | operations_research::Solver | |
| MonitorEvent enum name | operations_research::Solver | |
| MultiArmedBanditConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, double memory_coefficient, double exploration_coefficient, bool maximize) | operations_research::Solver | |
| NameAllVariables() const | operations_research::Solver | |
| neighbors() const | operations_research::Solver | inline |
| NewSearch(DecisionBuilder *db, const std::vector< SearchMonitor * > &monitors) | operations_research::Solver | |
| NewSearch(DecisionBuilder *db) | operations_research::Solver | |
| NewSearch(DecisionBuilder *db, SearchMonitor *m1) | operations_research::Solver | |
| NewSearch(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2) | operations_research::Solver | |
| NewSearch(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2, SearchMonitor *m3) | operations_research::Solver | |
| NewSearch(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2, SearchMonitor *m3, SearchMonitor *m4) | operations_research::Solver | |
| NextSolution() | operations_research::Solver | |
| NO_CHANGE enum value | operations_research::Solver | |
| NO_MORE_SOLUTIONS enum value | operations_research::Solver | |
| NORMAL_PRIORITY enum value | operations_research::Solver | |
| NOT_SET enum value | operations_research::Solver | |
| Now() const | operations_research::Solver | |
| operator=(const Solver &)=delete | operations_research::Solver | |
| optimization_direction() const | operations_research::Solver | inline |
| OptimizationDirection enum name | operations_research::Solver | |
| OROPT enum value | operations_research::Solver | |
| OUTSIDE_SEARCH enum value | operations_research::Solver | |
| parameters() const | operations_research::Solver | inline |
| PATHLNS enum value | operations_research::Solver | |
| PopState() | operations_research::Solver | |
| PROBLEM_INFEASIBLE enum value | operations_research::Solver | |
| PropagationBaseObject class | operations_research::Solver | friend |
| PushState() | operations_research::Solver | |
| Queue class | operations_research::Solver | friend |
| Rand32(int32_t size) | operations_research::Solver | inline |
| Rand64(int64_t size) | operations_research::Solver | inline |
| RandomConcatenateOperators(const std::vector< LocalSearchOperator * > &ops) | operations_research::Solver | |
| RandomConcatenateOperators(const std::vector< LocalSearchOperator * > &ops, int32_t seed) | operations_research::Solver | |
| RegisterDemon(Demon *demon) | operations_research::Solver | |
| RegisterIntervalVar(IntervalVar *var) | operations_research::Solver | |
| RegisterIntExpr(IntExpr *expr) | operations_research::Solver | |
| RegisterIntVar(IntVar *var) | operations_research::Solver | |
| RELOCATE enum value | operations_research::Solver | |
| ReSeed(int32_t seed) | operations_research::Solver | inline |
| RestartCurrentSearch() | operations_research::Solver | |
| RestartSearch() | operations_research::Solver | |
| RevAlloc(T *object) | operations_research::Solver | inline |
| RevAllocArray(T *object) | operations_research::Solver | inline |
| REVERSIBLE_ACTION enum value | operations_research::Solver | |
| RevImmutableMultiMap class | operations_research::Solver | friend |
| RoutingModel class | operations_research::Solver | friend |
| RunUncheckedLocalSearch(const Assignment *initial_solution, LocalSearchFilterManager *filter_manager, LocalSearchOperator *ls_operator, const std::vector< SearchMonitor * > &monitors, RegularLimit *limit, absl::flat_hash_set< IntVar * > *touched=nullptr) | operations_research::Solver | |
| SaveAndAdd(T *adr, T val) | operations_research::Solver | inline |
| SaveAndSetValue(T *adr, T val) | operations_research::Solver | inline |
| SaveValue(T *o) | operations_research::Solver | inline |
| SearchContext() const | operations_research::Solver | |
| SearchContext(const Search *search) const | operations_research::Solver | |
| SearchDepth() const | operations_research::Solver | |
| SearchLeftDepth() const | operations_research::Solver | |
| SearchLimit class | operations_research::Solver | friend |
| SearchMonitor class | operations_research::Solver | friend |
| SENTINEL enum value | operations_research::Solver | |
| SEQUENCE_DEFAULT enum value | operations_research::Solver | |
| SEQUENCE_SIMPLE enum value | operations_research::Solver | |
| SequenceStrategy enum name | operations_research::Solver | |
| set_context(absl::string_view context) | operations_research::Solver | inline |
| set_fail_intercept(std::function< void()> fail_intercept) | operations_research::Solver | inline |
| set_optimization_direction(OptimizationDirection direction) | operations_research::Solver | inline |
| SetBranchSelector(BranchSelector bs) | operations_research::Solver | |
| SetGuidedLocalSearchPenaltyCallback(std::function< int64_t(int64_t, int64_t, int64_t)> penalty_callback) | operations_research::Solver | inline |
| SetSearchContext(Search *search, absl::string_view search_context) | operations_research::Solver | |
| SetUseFastLocalSearch(bool use_fast_local_search) | operations_research::Solver | inline |
| ShouldFail() | operations_research::Solver | inline |
| SIMPLE_MARKER enum value | operations_research::Solver | |
| SIMPLELNS enum value | operations_research::Solver | |
| SimpleRevFIFO class | operations_research::Solver | friend |
| solutions() const | operations_research::Solver | |
| Solve(DecisionBuilder *db, const std::vector< SearchMonitor * > &monitors) | operations_research::Solver | |
| Solve(DecisionBuilder *db) | operations_research::Solver | |
| Solve(DecisionBuilder *db, SearchMonitor *m1) | operations_research::Solver | |
| Solve(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2) | operations_research::Solver | |
| Solve(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2, SearchMonitor *m3) | operations_research::Solver | |
| Solve(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2, SearchMonitor *m3, SearchMonitor *m4) | operations_research::Solver | |
| SolveAndCommit(DecisionBuilder *db, const std::vector< SearchMonitor * > &monitors) | operations_research::Solver | |
| SolveAndCommit(DecisionBuilder *db) | operations_research::Solver | |
| SolveAndCommit(DecisionBuilder *db, SearchMonitor *m1) | operations_research::Solver | |
| SolveAndCommit(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2) | operations_research::Solver | |
| SolveAndCommit(DecisionBuilder *db, SearchMonitor *m1, SearchMonitor *m2, SearchMonitor *m3) | operations_research::Solver | |
| SolveDepth() const | operations_research::Solver | |
| Solver(const std::string &name) | operations_research::Solver | explicit |
| Solver(const std::string &name, const ConstraintSolverParameters ¶meters) | operations_research::Solver | |
| Solver(const Solver &)=delete | operations_research::Solver | |
| SolverState enum name | operations_research::Solver | |
| SPLIT_LOWER_HALF enum value | operations_research::Solver | |
| SPLIT_UPPER_HALF enum value | operations_research::Solver | |
| stamp() const | operations_research::Solver | |
| STARTS_AFTER enum value | operations_research::Solver | |
| STARTS_AFTER_END enum value | operations_research::Solver | |
| STARTS_AFTER_START enum value | operations_research::Solver | |
| STARTS_AT enum value | operations_research::Solver | |
| STARTS_AT_END enum value | operations_research::Solver | |
| STARTS_AT_START enum value | operations_research::Solver | |
| STARTS_BEFORE enum value | operations_research::Solver | |
| state() const | operations_research::Solver | inline |
| STAYS_IN_SYNC enum value | operations_research::Solver | |
| SWAPACTIVE enum value | operations_research::Solver | |
| SWAPACTIVECHAIN enum value | operations_research::Solver | |
| SWITCH_BRANCHES enum value | operations_research::Solver | |
| tmp_vector_ | operations_research::Solver | |
| TopPeriodicCheck() | operations_research::Solver | |
| TopProgressPercent() | operations_research::Solver | |
| Try(DecisionBuilder *db1, DecisionBuilder *db2) | operations_research::Solver | |
| Try(DecisionBuilder *db1, DecisionBuilder *db2, DecisionBuilder *db3) | operations_research::Solver | |
| Try(DecisionBuilder *db1, DecisionBuilder *db2, DecisionBuilder *db3, DecisionBuilder *db4) | operations_research::Solver | |
| Try(const std::vector< DecisionBuilder * > &dbs) | operations_research::Solver | |
| TSPLNS enum value | operations_research::Solver | |
| TSPOPT enum value | operations_research::Solver | |
| TWOOPT enum value | operations_research::Solver | |
| UNACTIVELNS enum value | operations_research::Solver | |
| UnaryIntervalRelation enum name | operations_research::Solver | |
| unchecked_solutions() const | operations_research::Solver | |
| UseFastLocalSearch() const | operations_research::Solver | inline |
| VAR_PRIORITY enum value | operations_research::Solver | |
| VariableIndexSelector typedef | operations_research::Solver | |
| VariableValueComparator typedef | operations_research::Solver | |
| VariableValueSelector typedef | operations_research::Solver | |
| wall_time() const | operations_research::Solver | |
| ~Solver() | operations_research::Solver |
1.14.0