4 #ifndef PROTOBUF_INCLUDED_ortools_2fsat_2fsat_5fparameters_2eproto 5 #define PROTOBUF_INCLUDED_ortools_2fsat_2fsat_5fparameters_2eproto 10 #include <google/protobuf/port_def.inc> 11 #if PROTOBUF_VERSION < 3007000 12 #error This file was generated by a newer version of protoc which is 13 #error incompatible with your Protocol Buffer headers. Please update 16 #if 3007001 < PROTOBUF_MIN_PROTOC_VERSION 17 #error This file was generated by an older version of protoc which is 18 #error incompatible with your Protocol Buffer headers. Please 19 #error regenerate this file with a newer version of protoc. 22 #include <google/protobuf/port_undef.inc> 23 #include <google/protobuf/io/coded_stream.h> 24 #include <google/protobuf/arena.h> 25 #include <google/protobuf/arenastring.h> 26 #include <google/protobuf/generated_message_table_driven.h> 27 #include <google/protobuf/generated_message_util.h> 28 #include <google/protobuf/inlined_string_field.h> 29 #include <google/protobuf/metadata.h> 30 #include <google/protobuf/message.h> 31 #include <google/protobuf/repeated_field.h> 32 #include <google/protobuf/extension_set.h> 33 #include <google/protobuf/generated_enum_reflection.h> 34 #include <google/protobuf/unknown_field_set.h> 36 #include <google/protobuf/port_def.inc> 37 #define PROTOBUF_INTERNAL_EXPORT_ortools_2fsat_2fsat_5fparameters_2eproto 41 static const ::google::protobuf::internal::ParseTableField entries[]
43 static const ::google::protobuf::internal::AuxillaryParseTableField aux[]
45 static const ::google::protobuf::internal::ParseTable schema[1]
49 static const ::google::protobuf::uint32
offsets[];
55 class SatParametersDefaultTypeInternal;
79 return ::google::protobuf::internal::NameOfEnum(
84 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_VariableOrder>(
101 return ::google::protobuf::internal::NameOfEnum(
106 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_Polarity>(
122 return ::google::protobuf::internal::NameOfEnum(
127 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_ConflictMinimizationAlgorithm>(
144 return ::google::protobuf::internal::NameOfEnum(
149 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_BinaryMinizationAlgorithm>(
164 return ::google::protobuf::internal::NameOfEnum(
169 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_ClauseProtection>(
183 return ::google::protobuf::internal::NameOfEnum(
188 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_ClauseOrdering>(
205 return ::google::protobuf::internal::NameOfEnum(
210 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_RestartAlgorithm>(
225 return ::google::protobuf::internal::NameOfEnum(
230 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_MaxSatAssumptionOrder>(
245 return ::google::protobuf::internal::NameOfEnum(
250 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_MaxSatStratificationAlgorithm>(
268 return ::google::protobuf::internal::NameOfEnum(
273 return ::google::protobuf::internal::ParseNamedEnum<SatParameters_SearchBranching>(
278 class SatParameters :
279 public ::google::protobuf::Message {
293 *
this = ::std::move(from);
297 if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
298 if (
this != &from) InternalSwap(&from);
305 inline const ::google::protobuf::UnknownFieldSet&
unknown_fields()
const {
306 return _internal_metadata_.unknown_fields();
309 return _internal_metadata_.mutable_unknown_fields();
312 static const ::google::protobuf::Descriptor*
descriptor() {
319 return reinterpret_cast<const SatParameters*>(
333 return CreateMaybeMessage<SatParameters>(
nullptr);
337 return CreateMaybeMessage<SatParameters>(arena);
339 void CopyFrom(const ::google::protobuf::Message& from)
final;
340 void MergeFrom(const ::google::protobuf::Message& from)
final;
343 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
347 #if GOOGLE_PROTOBUF_ENABLE_EXPERIMENTAL_PARSER 348 static const char* _InternalParse(
const char* begin,
const char* end,
void*
object, ::google::protobuf::internal::ParseContext* ctx);
349 ::google::protobuf::internal::ParseFunc _ParseFunc() const final {
return _InternalParse; }
352 ::google::protobuf::io::CodedInputStream* input)
final;
353 #endif // GOOGLE_PROTOBUF_ENABLE_EXPERIMENTAL_PARSER 355 ::google::protobuf::io::CodedOutputStream* output)
const final;
357 ::google::protobuf::uint8* target)
const final;
358 int GetCachedSize() const final {
return _cached_size_.Get(); }
363 void SetCachedSize(
int size)
const final;
366 inline ::google::protobuf::Arena* GetArenaNoVirtual()
const {
369 inline void* MaybeArenaPtr()
const {
374 ::google::protobuf::Metadata
GetMetadata() const final;
394 static inline const ::google::protobuf::EnumDescriptor*
426 static inline const ::google::protobuf::EnumDescriptor*
456 static inline const ::google::protobuf::EnumDescriptor*
488 static inline const ::google::protobuf::EnumDescriptor*
516 static inline const ::google::protobuf::EnumDescriptor*
542 static inline const ::google::protobuf::EnumDescriptor*
574 static inline const ::google::protobuf::EnumDescriptor*
602 static inline const ::google::protobuf::EnumDescriptor*
630 static inline const ::google::protobuf::EnumDescriptor*
664 static inline const ::google::protobuf::EnumDescriptor*
1475 class HasBitSetters;
1477 ::google::protobuf::internal::InternalMetadataWithArena _internal_metadata_;
1478 ::google::protobuf::internal::HasBits<4> _has_bits_;
1479 mutable ::google::protobuf::internal::CachedSize _cached_size_;
1480 ::google::protobuf::RepeatedField<int> restart_algorithms_;
1484 ::google::protobuf::internal::ArenaStringPtr default_restart_algorithms_;
1485 int preferred_variable_order_;
1486 int max_sat_assumption_order_;
1487 double random_branches_ratio_;
1488 double random_polarity_ratio_;
1489 bool use_pb_resolution_;
1490 bool minimize_reduction_during_pb_resolution_;
1491 bool max_sat_reverse_assumption_order_;
1492 bool use_overload_checker_in_cumulative_constraint_;
1493 int clause_cleanup_protection_;
1494 int clause_cleanup_ordering_;
1495 bool use_erwa_heuristic_;
1496 bool also_bump_variables_in_conflict_reasons_;
1497 bool use_blocking_restart_;
1498 bool log_search_progress_;
1499 double strategy_change_increase_ratio_;
1500 ::google::protobuf::int32 num_conflicts_before_strategy_changes_;
1501 int search_branching_;
1502 double initial_variables_activity_;
1503 bool exploit_best_solution_;
1504 bool optimize_with_core_;
1505 bool optimize_with_max_hs_;
1506 bool enumerate_all_solutions_;
1507 bool use_timetable_edge_finding_in_cumulative_constraint_;
1508 bool only_add_cuts_at_level_zero_;
1509 bool add_knapsack_cuts_;
1511 ::google::protobuf::int64 search_randomization_tolerance_;
1512 ::google::protobuf::int32 num_search_workers_;
1513 bool fill_tightened_domains_in_response_;
1514 bool stop_after_first_solution_;
1516 bool lns_focus_on_decision_variables_;
1518 bool randomize_search_;
1519 bool use_combined_no_overlap_;
1520 double min_orthogonality_for_lp_constraints_;
1521 ::google::protobuf::int32 mip_max_activity_exponent_;
1522 int initial_polarity_;
1523 int minimization_algorithm_;
1524 ::google::protobuf::int32 clause_cleanup_period_;
1525 ::google::protobuf::int32 clause_cleanup_target_;
1526 double variable_activity_decay_;
1527 double max_variable_activity_value_;
1528 double clause_activity_decay_;
1529 double max_clause_activity_value_;
1530 double glucose_max_decay_;
1531 double glucose_decay_increment_;
1532 ::google::protobuf::int32 glucose_decay_increment_period_;
1533 ::google::protobuf::int32 restart_period_;
1534 ::google::protobuf::int32 random_seed_;
1535 int binary_minimization_algorithm_;
1536 double max_time_in_seconds_;
1537 ::google::protobuf::int64 max_number_of_conflicts_;
1538 ::google::protobuf::int64 max_memory_in_mb_;
1539 bool use_phase_saving_;
1540 bool subsumption_during_conflict_analysis_;
1541 bool treat_binary_clauses_separately_;
1542 bool count_assumption_levels_in_lbd_;
1543 ::google::protobuf::int32 pb_cleanup_increment_;
1544 double pb_cleanup_ratio_;
1545 int max_sat_stratification_;
1546 ::google::protobuf::int32 presolve_bve_threshold_;
1547 double presolve_probing_deterministic_time_limit_;
1548 ::google::protobuf::int32 presolve_bve_clause_weight_;
1549 ::google::protobuf::int32 clause_cleanup_lbd_bound_;
1550 bool presolve_blocked_clause_;
1551 bool presolve_use_bva_;
1552 bool use_optimization_hints_;
1553 bool minimize_core_;
1554 ::google::protobuf::int32 restart_running_window_size_;
1555 double restart_dl_average_ratio_;
1556 double blocking_restart_multiplier_;
1557 double max_deterministic_time_;
1558 ::google::protobuf::int32 blocking_restart_window_size_;
1559 ::google::protobuf::int32 presolve_bva_threshold_;
1560 double restart_lbd_average_ratio_;
1561 bool find_multiple_cores_;
1562 bool cover_optimization_;
1563 bool use_precedences_in_disjunctive_constraint_;
1564 bool use_disjunctive_constraint_in_cumulative_constraint_;
1565 ::google::protobuf::int32 linearization_level_;
1566 ::google::protobuf::int32 max_num_cuts_;
1567 ::google::protobuf::int32 minimize_with_propagation_restart_period_;
1568 ::google::protobuf::int32 minimize_with_propagation_num_decisions_;
1569 ::google::protobuf::int32 binary_search_num_conflicts_;
1570 ::google::protobuf::int32 lns_num_threads_;
1571 bool exploit_all_lp_solution_;
1572 bool exploit_objective_;
1573 bool cp_model_presolve_;
1574 bool cp_model_use_sat_presolve_;
1575 ::google::protobuf::int32 boolean_encoding_level_;
1576 bool instantiate_all_variables_;
1577 bool auto_detect_greater_than_at_least_one_of_;
1578 bool share_objective_bounds_;
1579 bool share_level_zero_bounds_;
1580 bool use_optional_variables_;
1581 bool use_exact_lp_reason_;
1582 ::google::protobuf::int32 cp_model_probing_level_;
1584 bool use_mir_rounding_;
1585 bool add_lp_constraints_lazily_;
1586 bool exploit_integer_lp_solution_;
1587 ::google::protobuf::int32 max_integer_rounding_scaling_;
1588 ::google::protobuf::int64 max_inactive_count_;
1589 ::google::protobuf::int64 constraint_removal_batch_size_;
1590 ::google::protobuf::int64 pseudo_cost_reliability_threshold_;
1591 double mip_max_bound_;
1592 double mip_var_scaling_;
1593 double mip_wanted_precision_;
1594 double mip_check_precision_;
1595 friend struct ::TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto;
1603 #pragma GCC diagnostic push 1604 #pragma GCC diagnostic ignored "-Wstrict-aliasing" 1610 return (_has_bits_[0] & 0x00000002u) != 0;
1613 preferred_variable_order_ = 0;
1614 _has_bits_[0] &= ~0x00000002u;
1618 return static_cast< ::operations_research::sat::SatParameters_VariableOrder >(preferred_variable_order_);
1622 _has_bits_[0] |= 0x00000002u;
1623 preferred_variable_order_ = value;
1629 return (_has_bits_[1] & 0x00000040u) != 0;
1632 initial_polarity_ = 1;
1633 _has_bits_[1] &= ~0x00000040u;
1637 return static_cast< ::operations_research::sat::SatParameters_Polarity >(initial_polarity_);
1641 _has_bits_[1] |= 0x00000040u;
1642 initial_polarity_ = value;
1648 return (_has_bits_[1] & 0x00800000u) != 0;
1651 use_phase_saving_ =
true;
1652 _has_bits_[1] &= ~0x00800000u;
1656 return use_phase_saving_;
1659 _has_bits_[1] |= 0x00800000u;
1660 use_phase_saving_ = value;
1666 return (_has_bits_[0] & 0x00000010u) != 0;
1669 random_polarity_ratio_ = 0;
1670 _has_bits_[0] &= ~0x00000010u;
1674 return random_polarity_ratio_;
1677 _has_bits_[0] |= 0x00000010u;
1678 random_polarity_ratio_ = value;
1684 return (_has_bits_[0] & 0x00000008u) != 0;
1687 random_branches_ratio_ = 0;
1688 _has_bits_[0] &= ~0x00000008u;
1692 return random_branches_ratio_;
1695 _has_bits_[0] |= 0x00000008u;
1696 random_branches_ratio_ = value;
1702 return (_has_bits_[0] & 0x00000800u) != 0;
1705 use_erwa_heuristic_ =
false;
1706 _has_bits_[0] &= ~0x00000800u;
1710 return use_erwa_heuristic_;
1713 _has_bits_[0] |= 0x00000800u;
1714 use_erwa_heuristic_ = value;
1720 return (_has_bits_[0] & 0x00040000u) != 0;
1723 initial_variables_activity_ = 0;
1724 _has_bits_[0] &= ~0x00040000u;
1728 return initial_variables_activity_;
1731 _has_bits_[0] |= 0x00040000u;
1732 initial_variables_activity_ = value;
1738 return (_has_bits_[0] & 0x00001000u) != 0;
1741 also_bump_variables_in_conflict_reasons_ =
false;
1742 _has_bits_[0] &= ~0x00001000u;
1746 return also_bump_variables_in_conflict_reasons_;
1749 _has_bits_[0] |= 0x00001000u;
1750 also_bump_variables_in_conflict_reasons_ = value;
1756 return (_has_bits_[1] & 0x00000080u) != 0;
1759 minimization_algorithm_ = 2;
1760 _has_bits_[1] &= ~0x00000080u;
1764 return static_cast< ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm >(minimization_algorithm_);
1768 _has_bits_[1] |= 0x00000080u;
1769 minimization_algorithm_ = value;
1775 return (_has_bits_[1] & 0x00080000u) != 0;
1778 binary_minimization_algorithm_ = 1;
1779 _has_bits_[1] &= ~0x00080000u;
1783 return static_cast< ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm >(binary_minimization_algorithm_);
1787 _has_bits_[1] |= 0x00080000u;
1788 binary_minimization_algorithm_ = value;
1794 return (_has_bits_[1] & 0x01000000u) != 0;
1797 subsumption_during_conflict_analysis_ =
true;
1798 _has_bits_[1] &= ~0x01000000u;
1802 return subsumption_during_conflict_analysis_;
1805 _has_bits_[1] |= 0x01000000u;
1806 subsumption_during_conflict_analysis_ = value;
1812 return (_has_bits_[1] & 0x00000100u) != 0;
1815 clause_cleanup_period_ = 10000;
1816 _has_bits_[1] &= ~0x00000100u;
1820 return clause_cleanup_period_;
1823 _has_bits_[1] |= 0x00000100u;
1824 clause_cleanup_period_ = value;
1830 return (_has_bits_[1] & 0x00000200u) != 0;
1833 clause_cleanup_target_ = 10000;
1834 _has_bits_[1] &= ~0x00000200u;
1838 return clause_cleanup_target_;
1841 _has_bits_[1] |= 0x00000200u;
1842 clause_cleanup_target_ = value;
1848 return (_has_bits_[0] & 0x00000200u) != 0;
1851 clause_cleanup_protection_ = 0;
1852 _has_bits_[0] &= ~0x00000200u;
1856 return static_cast< ::operations_research::sat::SatParameters_ClauseProtection >(clause_cleanup_protection_);
1860 _has_bits_[0] |= 0x00000200u;
1861 clause_cleanup_protection_ = value;
1867 return (_has_bits_[2] & 0x00000002u) != 0;
1870 clause_cleanup_lbd_bound_ = 5;
1871 _has_bits_[2] &= ~0x00000002u;
1875 return clause_cleanup_lbd_bound_;
1878 _has_bits_[2] |= 0x00000002u;
1879 clause_cleanup_lbd_bound_ = value;
1885 return (_has_bits_[0] & 0x00000400u) != 0;
1888 clause_cleanup_ordering_ = 0;
1889 _has_bits_[0] &= ~0x00000400u;
1893 return static_cast< ::operations_research::sat::SatParameters_ClauseOrdering >(clause_cleanup_ordering_);
1897 _has_bits_[0] |= 0x00000400u;
1898 clause_cleanup_ordering_ = value;
1904 return (_has_bits_[1] & 0x08000000u) != 0;
1907 pb_cleanup_increment_ = 200;
1908 _has_bits_[1] &= ~0x08000000u;
1912 return pb_cleanup_increment_;
1915 _has_bits_[1] |= 0x08000000u;
1916 pb_cleanup_increment_ = value;
1922 return (_has_bits_[1] & 0x10000000u) != 0;
1925 pb_cleanup_ratio_ = 0.5;
1926 _has_bits_[1] &= ~0x10000000u;
1930 return pb_cleanup_ratio_;
1933 _has_bits_[1] |= 0x10000000u;
1934 pb_cleanup_ratio_ = value;
1940 return (_has_bits_[2] & 0x00080000u) != 0;
1943 minimize_with_propagation_restart_period_ = 10;
1944 _has_bits_[2] &= ~0x00080000u;
1948 return minimize_with_propagation_restart_period_;
1951 _has_bits_[2] |= 0x00080000u;
1952 minimize_with_propagation_restart_period_ = value;
1958 return (_has_bits_[2] & 0x00100000u) != 0;
1961 minimize_with_propagation_num_decisions_ = 1000;
1962 _has_bits_[2] &= ~0x00100000u;
1966 return minimize_with_propagation_num_decisions_;
1969 _has_bits_[2] |= 0x00100000u;
1970 minimize_with_propagation_num_decisions_ = value;
1976 return (_has_bits_[1] & 0x00000400u) != 0;
1979 variable_activity_decay_ = 0.8;
1980 _has_bits_[1] &= ~0x00000400u;
1984 return variable_activity_decay_;
1987 _has_bits_[1] |= 0x00000400u;
1988 variable_activity_decay_ = value;
1994 return (_has_bits_[1] & 0x00000800u) != 0;
1997 max_variable_activity_value_ = 1e+100;
1998 _has_bits_[1] &= ~0x00000800u;
2002 return max_variable_activity_value_;
2005 _has_bits_[1] |= 0x00000800u;
2006 max_variable_activity_value_ = value;
2012 return (_has_bits_[1] & 0x00004000u) != 0;
2015 glucose_max_decay_ = 0.95;
2016 _has_bits_[1] &= ~0x00004000u;
2020 return glucose_max_decay_;
2023 _has_bits_[1] |= 0x00004000u;
2024 glucose_max_decay_ = value;
2030 return (_has_bits_[1] & 0x00008000u) != 0;
2033 glucose_decay_increment_ = 0.01;
2034 _has_bits_[1] &= ~0x00008000u;
2038 return glucose_decay_increment_;
2041 _has_bits_[1] |= 0x00008000u;
2042 glucose_decay_increment_ = value;
2048 return (_has_bits_[1] & 0x00010000u) != 0;
2051 glucose_decay_increment_period_ = 5000;
2052 _has_bits_[1] &= ~0x00010000u;
2056 return glucose_decay_increment_period_;
2059 _has_bits_[1] |= 0x00010000u;
2060 glucose_decay_increment_period_ = value;
2066 return (_has_bits_[1] & 0x00001000u) != 0;
2069 clause_activity_decay_ = 0.999;
2070 _has_bits_[1] &= ~0x00001000u;
2074 return clause_activity_decay_;
2077 _has_bits_[1] |= 0x00001000u;
2078 clause_activity_decay_ = value;
2084 return (_has_bits_[1] & 0x00002000u) != 0;
2087 max_clause_activity_value_ = 1e+20;
2088 _has_bits_[1] &= ~0x00002000u;
2092 return max_clause_activity_value_;
2095 _has_bits_[1] |= 0x00002000u;
2096 max_clause_activity_value_ = value;
2102 return restart_algorithms_.size();
2105 restart_algorithms_.Clear();
2109 return static_cast< ::operations_research::sat::SatParameters_RestartAlgorithm >(restart_algorithms_.Get(index));
2113 restart_algorithms_.Set(index, value);
2118 restart_algorithms_.Add(value);
2121 inline const ::google::protobuf::RepeatedField<int>&
2124 return restart_algorithms_;
2126 inline ::google::protobuf::RepeatedField<int>*
2129 return &restart_algorithms_;
2134 return (_has_bits_[0] & 0x00000001u) != 0;
2138 _has_bits_[0] &= ~0x00000001u;
2142 return default_restart_algorithms_.GetNoArena();
2145 _has_bits_[0] |= 0x00000001u;
2151 _has_bits_[0] |= 0x00000001u;
2152 default_restart_algorithms_.SetNoArena(
2158 GOOGLE_DCHECK(value !=
nullptr);
2159 _has_bits_[0] |= 0x00000001u;
2164 _has_bits_[0] |= 0x00000001u;
2166 ::std::string(reinterpret_cast<const char*>(value), size));
2170 _has_bits_[0] |= 0x00000001u;
2179 _has_bits_[0] &= ~0x00000001u;
2184 _has_bits_[0] |= 0x00000001u;
2186 _has_bits_[0] &= ~0x00000001u;
2194 return (_has_bits_[1] & 0x00020000u) != 0;
2197 restart_period_ = 50;
2198 _has_bits_[1] &= ~0x00020000u;
2202 return restart_period_;
2205 _has_bits_[1] |= 0x00020000u;
2206 restart_period_ = value;
2212 return (_has_bits_[2] & 0x00000040u) != 0;
2215 restart_running_window_size_ = 50;
2216 _has_bits_[2] &= ~0x00000040u;
2220 return restart_running_window_size_;
2223 _has_bits_[2] |= 0x00000040u;
2224 restart_running_window_size_ = value;
2230 return (_has_bits_[2] & 0x00000080u) != 0;
2233 restart_dl_average_ratio_ = 1;
2234 _has_bits_[2] &= ~0x00000080u;
2238 return restart_dl_average_ratio_;
2241 _has_bits_[2] |= 0x00000080u;
2242 restart_dl_average_ratio_ = value;
2248 return (_has_bits_[2] & 0x00001000u) != 0;
2251 restart_lbd_average_ratio_ = 1;
2252 _has_bits_[2] &= ~0x00001000u;
2256 return restart_lbd_average_ratio_;
2259 _has_bits_[2] |= 0x00001000u;
2260 restart_lbd_average_ratio_ = value;
2266 return (_has_bits_[0] & 0x00002000u) != 0;
2269 use_blocking_restart_ =
false;
2270 _has_bits_[0] &= ~0x00002000u;
2274 return use_blocking_restart_;
2277 _has_bits_[0] |= 0x00002000u;
2278 use_blocking_restart_ = value;
2284 return (_has_bits_[2] & 0x00000400u) != 0;
2287 blocking_restart_window_size_ = 5000;
2288 _has_bits_[2] &= ~0x00000400u;
2292 return blocking_restart_window_size_;
2295 _has_bits_[2] |= 0x00000400u;
2296 blocking_restart_window_size_ = value;
2302 return (_has_bits_[2] & 0x00000100u) != 0;
2305 blocking_restart_multiplier_ = 1.4;
2306 _has_bits_[2] &= ~0x00000100u;
2310 return blocking_restart_multiplier_;
2313 _has_bits_[2] |= 0x00000100u;
2314 blocking_restart_multiplier_ = value;
2320 return (_has_bits_[0] & 0x00010000u) != 0;
2323 num_conflicts_before_strategy_changes_ = 0;
2324 _has_bits_[0] &= ~0x00010000u;
2328 return num_conflicts_before_strategy_changes_;
2331 _has_bits_[0] |= 0x00010000u;
2332 num_conflicts_before_strategy_changes_ = value;
2338 return (_has_bits_[0] & 0x00008000u) != 0;
2341 strategy_change_increase_ratio_ = 0;
2342 _has_bits_[0] &= ~0x00008000u;
2346 return strategy_change_increase_ratio_;
2349 _has_bits_[0] |= 0x00008000u;
2350 strategy_change_increase_ratio_ = value;
2356 return (_has_bits_[1] & 0x00100000u) != 0;
2359 max_time_in_seconds_ = std::numeric_limits<double>::infinity();
2360 _has_bits_[1] &= ~0x00100000u;
2364 return max_time_in_seconds_;
2367 _has_bits_[1] |= 0x00100000u;
2368 max_time_in_seconds_ = value;
2374 return (_has_bits_[2] & 0x00000200u) != 0;
2377 max_deterministic_time_ = std::numeric_limits<double>::infinity();
2378 _has_bits_[2] &= ~0x00000200u;
2382 return max_deterministic_time_;
2385 _has_bits_[2] |= 0x00000200u;
2386 max_deterministic_time_ = value;
2392 return (_has_bits_[1] & 0x00200000u) != 0;
2395 max_number_of_conflicts_ = PROTOBUF_LONGLONG(9223372036854775807);
2396 _has_bits_[1] &= ~0x00200000u;
2400 return max_number_of_conflicts_;
2403 _has_bits_[1] |= 0x00200000u;
2404 max_number_of_conflicts_ = value;
2410 return (_has_bits_[1] & 0x00400000u) != 0;
2413 max_memory_in_mb_ = PROTOBUF_LONGLONG(10000);
2414 _has_bits_[1] &= ~0x00400000u;
2418 return max_memory_in_mb_;
2421 _has_bits_[1] |= 0x00400000u;
2422 max_memory_in_mb_ = value;
2428 return (_has_bits_[1] & 0x02000000u) != 0;
2431 treat_binary_clauses_separately_ =
true;
2432 _has_bits_[1] &= ~0x02000000u;
2436 return treat_binary_clauses_separately_;
2439 _has_bits_[1] |= 0x02000000u;
2440 treat_binary_clauses_separately_ = value;
2446 return (_has_bits_[1] & 0x00040000u) != 0;
2450 _has_bits_[1] &= ~0x00040000u;
2454 return random_seed_;
2457 _has_bits_[1] |= 0x00040000u;
2458 random_seed_ = value;
2464 return (_has_bits_[0] & 0x00004000u) != 0;
2467 log_search_progress_ =
false;
2468 _has_bits_[0] &= ~0x00004000u;
2472 return log_search_progress_;
2475 _has_bits_[0] |= 0x00004000u;
2476 log_search_progress_ = value;
2482 return (_has_bits_[0] & 0x00000020u) != 0;
2485 use_pb_resolution_ =
false;
2486 _has_bits_[0] &= ~0x00000020u;
2490 return use_pb_resolution_;
2493 _has_bits_[0] |= 0x00000020u;
2494 use_pb_resolution_ = value;
2500 return (_has_bits_[0] & 0x00000040u) != 0;
2503 minimize_reduction_during_pb_resolution_ =
false;
2504 _has_bits_[0] &= ~0x00000040u;
2508 return minimize_reduction_during_pb_resolution_;
2511 _has_bits_[0] |= 0x00000040u;
2512 minimize_reduction_during_pb_resolution_ = value;
2518 return (_has_bits_[1] & 0x04000000u) != 0;
2521 count_assumption_levels_in_lbd_ =
true;
2522 _has_bits_[1] &= ~0x04000000u;
2526 return count_assumption_levels_in_lbd_;
2529 _has_bits_[1] |= 0x04000000u;
2530 count_assumption_levels_in_lbd_ = value;
2536 return (_has_bits_[1] & 0x40000000u) != 0;
2539 presolve_bve_threshold_ = 500;
2540 _has_bits_[1] &= ~0x40000000u;
2544 return presolve_bve_threshold_;
2547 _has_bits_[1] |= 0x40000000u;
2548 presolve_bve_threshold_ = value;
2554 return (_has_bits_[2] & 0x00000001u) != 0;
2557 presolve_bve_clause_weight_ = 3;
2558 _has_bits_[2] &= ~0x00000001u;
2562 return presolve_bve_clause_weight_;
2565 _has_bits_[2] |= 0x00000001u;
2566 presolve_bve_clause_weight_ = value;
2572 return (_has_bits_[1] & 0x80000000u) != 0;
2575 presolve_probing_deterministic_time_limit_ = 30;
2576 _has_bits_[1] &= ~0x80000000u;
2580 return presolve_probing_deterministic_time_limit_;
2583 _has_bits_[1] |= 0x80000000u;
2584 presolve_probing_deterministic_time_limit_ = value;
2590 return (_has_bits_[2] & 0x00000004u) != 0;
2593 presolve_blocked_clause_ =
true;
2594 _has_bits_[2] &= ~0x00000004u;
2598 return presolve_blocked_clause_;
2601 _has_bits_[2] |= 0x00000004u;
2602 presolve_blocked_clause_ = value;
2608 return (_has_bits_[2] & 0x00000008u) != 0;
2611 presolve_use_bva_ =
true;
2612 _has_bits_[2] &= ~0x00000008u;
2616 return presolve_use_bva_;
2619 _has_bits_[2] |= 0x00000008u;
2620 presolve_use_bva_ = value;
2626 return (_has_bits_[2] & 0x00000800u) != 0;
2629 presolve_bva_threshold_ = 1;
2630 _has_bits_[2] &= ~0x00000800u;
2634 return presolve_bva_threshold_;
2637 _has_bits_[2] |= 0x00000800u;
2638 presolve_bva_threshold_ = value;
2644 return (_has_bits_[2] & 0x00000010u) != 0;
2647 use_optimization_hints_ =
true;
2648 _has_bits_[2] &= ~0x00000010u;
2652 return use_optimization_hints_;
2655 _has_bits_[2] |= 0x00000010u;
2656 use_optimization_hints_ = value;
2662 return (_has_bits_[2] & 0x00000020u) != 0;
2665 minimize_core_ =
true;
2666 _has_bits_[2] &= ~0x00000020u;
2670 return minimize_core_;
2673 _has_bits_[2] |= 0x00000020u;
2674 minimize_core_ = value;
2680 return (_has_bits_[2] & 0x00002000u) != 0;
2683 find_multiple_cores_ =
true;
2684 _has_bits_[2] &= ~0x00002000u;
2688 return find_multiple_cores_;
2691 _has_bits_[2] |= 0x00002000u;
2692 find_multiple_cores_ = value;
2698 return (_has_bits_[2] & 0x00004000u) != 0;
2701 cover_optimization_ =
true;
2702 _has_bits_[2] &= ~0x00004000u;
2706 return cover_optimization_;
2709 _has_bits_[2] |= 0x00004000u;
2710 cover_optimization_ = value;
2716 return (_has_bits_[0] & 0x00000004u) != 0;
2719 max_sat_assumption_order_ = 0;
2720 _has_bits_[0] &= ~0x00000004u;
2724 return static_cast< ::operations_research::sat::SatParameters_MaxSatAssumptionOrder >(max_sat_assumption_order_);
2728 _has_bits_[0] |= 0x00000004u;
2729 max_sat_assumption_order_ = value;
2735 return (_has_bits_[0] & 0x00000080u) != 0;
2738 max_sat_reverse_assumption_order_ =
false;
2739 _has_bits_[0] &= ~0x00000080u;
2743 return max_sat_reverse_assumption_order_;
2746 _has_bits_[0] |= 0x00000080u;
2747 max_sat_reverse_assumption_order_ = value;
2753 return (_has_bits_[1] & 0x20000000u) != 0;
2756 max_sat_stratification_ = 1;
2757 _has_bits_[1] &= ~0x20000000u;
2761 return static_cast< ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm >(max_sat_stratification_);
2765 _has_bits_[1] |= 0x20000000u;
2766 max_sat_stratification_ = value;
2772 return (_has_bits_[2] & 0x00008000u) != 0;
2775 use_precedences_in_disjunctive_constraint_ =
true;
2776 _has_bits_[2] &= ~0x00008000u;
2780 return use_precedences_in_disjunctive_constraint_;
2783 _has_bits_[2] |= 0x00008000u;
2784 use_precedences_in_disjunctive_constraint_ = value;
2790 return (_has_bits_[0] & 0x00000100u) != 0;
2793 use_overload_checker_in_cumulative_constraint_ =
false;
2794 _has_bits_[0] &= ~0x00000100u;
2798 return use_overload_checker_in_cumulative_constraint_;
2801 _has_bits_[0] |= 0x00000100u;
2802 use_overload_checker_in_cumulative_constraint_ = value;
2808 return (_has_bits_[0] & 0x00800000u) != 0;
2811 use_timetable_edge_finding_in_cumulative_constraint_ =
false;
2812 _has_bits_[0] &= ~0x00800000u;
2816 return use_timetable_edge_finding_in_cumulative_constraint_;
2819 _has_bits_[0] |= 0x00800000u;
2820 use_timetable_edge_finding_in_cumulative_constraint_ = value;
2826 return (_has_bits_[2] & 0x00010000u) != 0;
2829 use_disjunctive_constraint_in_cumulative_constraint_ =
true;
2830 _has_bits_[2] &= ~0x00010000u;
2834 return use_disjunctive_constraint_in_cumulative_constraint_;
2837 _has_bits_[2] |= 0x00010000u;
2838 use_disjunctive_constraint_in_cumulative_constraint_ = value;
2844 return (_has_bits_[2] & 0x00020000u) != 0;
2847 linearization_level_ = 1;
2848 _has_bits_[2] &= ~0x00020000u;
2852 return linearization_level_;
2855 _has_bits_[2] |= 0x00020000u;
2856 linearization_level_ = value;
2862 return (_has_bits_[2] & 0x08000000u) != 0;
2865 boolean_encoding_level_ = 1;
2866 _has_bits_[2] &= ~0x08000000u;
2870 return boolean_encoding_level_;
2873 _has_bits_[2] |= 0x08000000u;
2874 boolean_encoding_level_ = value;
2880 return (_has_bits_[2] & 0x00040000u) != 0;
2883 max_num_cuts_ = 1000;
2884 _has_bits_[2] &= ~0x00040000u;
2888 return max_num_cuts_;
2891 _has_bits_[2] |= 0x00040000u;
2892 max_num_cuts_ = value;
2898 return (_has_bits_[0] & 0x01000000u) != 0;
2901 only_add_cuts_at_level_zero_ =
false;
2902 _has_bits_[0] &= ~0x01000000u;
2906 return only_add_cuts_at_level_zero_;
2909 _has_bits_[0] |= 0x01000000u;
2910 only_add_cuts_at_level_zero_ = value;
2916 return (_has_bits_[0] & 0x02000000u) != 0;
2919 add_knapsack_cuts_ =
false;
2920 _has_bits_[0] &= ~0x02000000u;
2924 return add_knapsack_cuts_;
2927 _has_bits_[0] |= 0x02000000u;
2928 add_knapsack_cuts_ = value;
2934 return (_has_bits_[0] & 0x04000000u) != 0;
2937 add_cg_cuts_ =
false;
2938 _has_bits_[0] &= ~0x04000000u;
2942 return add_cg_cuts_;
2945 _has_bits_[0] |= 0x04000000u;
2946 add_cg_cuts_ = value;
2952 return (_has_bits_[3] & 0x00000008u) != 0;
2955 add_mir_cuts_ =
true;
2956 _has_bits_[3] &= ~0x00000008u;
2960 return add_mir_cuts_;
2963 _has_bits_[3] |= 0x00000008u;
2964 add_mir_cuts_ = value;
2970 return (_has_bits_[3] & 0x00000010u) != 0;
2973 use_mir_rounding_ =
true;
2974 _has_bits_[3] &= ~0x00000010u;
2978 return use_mir_rounding_;
2981 _has_bits_[3] |= 0x00000010u;
2982 use_mir_rounding_ = value;
2988 return (_has_bits_[3] & 0x00000080u) != 0;
2991 max_integer_rounding_scaling_ = 600;
2992 _has_bits_[3] &= ~0x00000080u;
2996 return max_integer_rounding_scaling_;
2999 _has_bits_[3] |= 0x00000080u;
3000 max_integer_rounding_scaling_ = value;
3006 return (_has_bits_[3] & 0x00000020u) != 0;
3009 add_lp_constraints_lazily_ =
true;
3010 _has_bits_[3] &= ~0x00000020u;
3014 return add_lp_constraints_lazily_;
3017 _has_bits_[3] |= 0x00000020u;
3018 add_lp_constraints_lazily_ = value;
3024 return (_has_bits_[1] & 0x00000010u) != 0;
3027 min_orthogonality_for_lp_constraints_ = 0;
3028 _has_bits_[1] &= ~0x00000010u;
3032 return min_orthogonality_for_lp_constraints_;
3035 _has_bits_[1] |= 0x00000010u;
3036 min_orthogonality_for_lp_constraints_ = value;
3042 return (_has_bits_[3] & 0x00000100u) != 0;
3045 max_inactive_count_ = PROTOBUF_LONGLONG(1000);
3046 _has_bits_[3] &= ~0x00000100u;
3050 return max_inactive_count_;
3053 _has_bits_[3] |= 0x00000100u;
3054 max_inactive_count_ = value;
3060 return (_has_bits_[3] & 0x00000200u) != 0;
3063 constraint_removal_batch_size_ = PROTOBUF_LONGLONG(100);
3064 _has_bits_[3] &= ~0x00000200u;
3068 return constraint_removal_batch_size_;
3071 _has_bits_[3] |= 0x00000200u;
3072 constraint_removal_batch_size_ = value;
3078 return (_has_bits_[0] & 0x00020000u) != 0;
3081 search_branching_ = 0;
3082 _has_bits_[0] &= ~0x00020000u;
3086 return static_cast< ::operations_research::sat::SatParameters_SearchBranching >(search_branching_);
3090 _has_bits_[0] |= 0x00020000u;
3091 search_branching_ = value;
3097 return (_has_bits_[3] & 0x00000040u) != 0;
3100 exploit_integer_lp_solution_ =
true;
3101 _has_bits_[3] &= ~0x00000040u;
3105 return exploit_integer_lp_solution_;
3108 _has_bits_[3] |= 0x00000040u;
3109 exploit_integer_lp_solution_ = value;
3115 return (_has_bits_[2] & 0x00800000u) != 0;
3118 exploit_all_lp_solution_ =
true;
3119 _has_bits_[2] &= ~0x00800000u;
3123 return exploit_all_lp_solution_;
3126 _has_bits_[2] |= 0x00800000u;
3127 exploit_all_lp_solution_ = value;
3133 return (_has_bits_[0] & 0x00080000u) != 0;
3136 exploit_best_solution_ =
false;
3137 _has_bits_[0] &= ~0x00080000u;
3141 return exploit_best_solution_;
3144 _has_bits_[0] |= 0x00080000u;
3145 exploit_best_solution_ = value;
3151 return (_has_bits_[2] & 0x01000000u) != 0;
3154 exploit_objective_ =
true;
3155 _has_bits_[2] &= ~0x01000000u;
3159 return exploit_objective_;
3162 _has_bits_[2] |= 0x01000000u;
3163 exploit_objective_ = value;
3169 return (_has_bits_[3] & 0x00000400u) != 0;
3172 pseudo_cost_reliability_threshold_ = PROTOBUF_LONGLONG(100);
3173 _has_bits_[3] &= ~0x00000400u;
3177 return pseudo_cost_reliability_threshold_;
3180 _has_bits_[3] |= 0x00000400u;
3181 pseudo_cost_reliability_threshold_ = value;
3187 return (_has_bits_[0] & 0x00100000u) != 0;
3190 optimize_with_core_ =
false;
3191 _has_bits_[0] &= ~0x00100000u;
3195 return optimize_with_core_;
3198 _has_bits_[0] |= 0x00100000u;
3199 optimize_with_core_ = value;
3205 return (_has_bits_[2] & 0x00200000u) != 0;
3208 binary_search_num_conflicts_ = -1;
3209 _has_bits_[2] &= ~0x00200000u;
3213 return binary_search_num_conflicts_;
3216 _has_bits_[2] |= 0x00200000u;
3217 binary_search_num_conflicts_ = value;
3223 return (_has_bits_[0] & 0x00200000u) != 0;
3226 optimize_with_max_hs_ =
false;
3227 _has_bits_[0] &= ~0x00200000u;
3231 return optimize_with_max_hs_;
3234 _has_bits_[0] |= 0x00200000u;
3235 optimize_with_max_hs_ = value;
3241 return (_has_bits_[2] & 0x02000000u) != 0;
3244 cp_model_presolve_ =
true;
3245 _has_bits_[2] &= ~0x02000000u;
3249 return cp_model_presolve_;
3252 _has_bits_[2] |= 0x02000000u;
3253 cp_model_presolve_ = value;
3259 return (_has_bits_[3] & 0x00000004u) != 0;
3262 cp_model_probing_level_ = 2;
3263 _has_bits_[3] &= ~0x00000004u;
3267 return cp_model_probing_level_;
3270 _has_bits_[3] |= 0x00000004u;
3271 cp_model_probing_level_ = value;
3277 return (_has_bits_[2] & 0x04000000u) != 0;
3280 cp_model_use_sat_presolve_ =
true;
3281 _has_bits_[2] &= ~0x04000000u;
3285 return cp_model_use_sat_presolve_;
3288 _has_bits_[2] |= 0x04000000u;
3289 cp_model_use_sat_presolve_ = value;
3295 return (_has_bits_[0] & 0x00400000u) != 0;
3298 enumerate_all_solutions_ =
false;
3299 _has_bits_[0] &= ~0x00400000u;
3303 return enumerate_all_solutions_;
3306 _has_bits_[0] |= 0x00400000u;
3307 enumerate_all_solutions_ = value;
3313 return (_has_bits_[0] & 0x20000000u) != 0;
3316 fill_tightened_domains_in_response_ =
false;
3317 _has_bits_[0] &= ~0x20000000u;
3321 return fill_tightened_domains_in_response_;
3324 _has_bits_[0] |= 0x20000000u;
3325 fill_tightened_domains_in_response_ = value;
3331 return (_has_bits_[2] & 0x10000000u) != 0;
3334 instantiate_all_variables_ =
true;
3335 _has_bits_[2] &= ~0x10000000u;
3339 return instantiate_all_variables_;
3342 _has_bits_[2] |= 0x10000000u;
3343 instantiate_all_variables_ = value;
3349 return (_has_bits_[2] & 0x20000000u) != 0;
3352 auto_detect_greater_than_at_least_one_of_ =
true;
3353 _has_bits_[2] &= ~0x20000000u;
3357 return auto_detect_greater_than_at_least_one_of_;
3360 _has_bits_[2] |= 0x20000000u;
3361 auto_detect_greater_than_at_least_one_of_ = value;
3367 return (_has_bits_[0] & 0x40000000u) != 0;
3370 stop_after_first_solution_ =
false;
3371 _has_bits_[0] &= ~0x40000000u;
3375 return stop_after_first_solution_;
3378 _has_bits_[0] |= 0x40000000u;
3379 stop_after_first_solution_ = value;
3385 return (_has_bits_[0] & 0x10000000u) != 0;
3388 num_search_workers_ = 0;
3389 _has_bits_[0] &= ~0x10000000u;
3393 return num_search_workers_;
3396 _has_bits_[0] |= 0x10000000u;
3397 num_search_workers_ = value;
3403 return (_has_bits_[2] & 0x40000000u) != 0;
3406 share_objective_bounds_ =
true;
3407 _has_bits_[2] &= ~0x40000000u;
3411 return share_objective_bounds_;
3414 _has_bits_[2] |= 0x40000000u;
3415 share_objective_bounds_ = value;
3421 return (_has_bits_[2] & 0x80000000u) != 0;
3424 share_level_zero_bounds_ =
true;
3425 _has_bits_[2] &= ~0x80000000u;
3429 return share_level_zero_bounds_;
3432 _has_bits_[2] |= 0x80000000u;
3433 share_level_zero_bounds_ = value;
3439 return (_has_bits_[0] & 0x80000000u) != 0;
3443 _has_bits_[0] &= ~0x80000000u;
3450 _has_bits_[0] |= 0x80000000u;
3457 return (_has_bits_[2] & 0x00400000u) != 0;
3460 lns_num_threads_ = 1;
3461 _has_bits_[2] &= ~0x00400000u;
3465 return lns_num_threads_;
3468 _has_bits_[2] |= 0x00400000u;
3469 lns_num_threads_ = value;
3475 return (_has_bits_[1] & 0x00000001u) != 0;
3478 lns_focus_on_decision_variables_ =
false;
3479 _has_bits_[1] &= ~0x00000001u;
3483 return lns_focus_on_decision_variables_;
3486 _has_bits_[1] |= 0x00000001u;
3487 lns_focus_on_decision_variables_ = value;
3493 return (_has_bits_[1] & 0x00000002u) != 0;
3496 use_rins_lns_ =
false;
3497 _has_bits_[1] &= ~0x00000002u;
3501 return use_rins_lns_;
3504 _has_bits_[1] |= 0x00000002u;
3505 use_rins_lns_ = value;
3511 return (_has_bits_[1] & 0x00000004u) != 0;
3514 randomize_search_ =
false;
3515 _has_bits_[1] &= ~0x00000004u;
3519 return randomize_search_;
3522 _has_bits_[1] |= 0x00000004u;
3523 randomize_search_ = value;
3529 return (_has_bits_[0] & 0x08000000u) != 0;
3532 search_randomization_tolerance_ = PROTOBUF_LONGLONG(0);
3533 _has_bits_[0] &= ~0x08000000u;
3537 return search_randomization_tolerance_;
3540 _has_bits_[0] |= 0x08000000u;
3541 search_randomization_tolerance_ = value;
3547 return (_has_bits_[3] & 0x00000001u) != 0;
3550 use_optional_variables_ =
true;
3551 _has_bits_[3] &= ~0x00000001u;
3555 return use_optional_variables_;
3558 _has_bits_[3] |= 0x00000001u;
3559 use_optional_variables_ = value;
3565 return (_has_bits_[3] & 0x00000002u) != 0;
3568 use_exact_lp_reason_ =
true;
3569 _has_bits_[3] &= ~0x00000002u;
3573 return use_exact_lp_reason_;
3576 _has_bits_[3] |= 0x00000002u;
3577 use_exact_lp_reason_ = value;
3583 return (_has_bits_[1] & 0x00000008u) != 0;
3586 use_combined_no_overlap_ =
false;
3587 _has_bits_[1] &= ~0x00000008u;
3591 return use_combined_no_overlap_;
3594 _has_bits_[1] |= 0x00000008u;
3595 use_combined_no_overlap_ = value;
3601 return (_has_bits_[3] & 0x00000800u) != 0;
3604 mip_max_bound_ = 10000000;
3605 _has_bits_[3] &= ~0x00000800u;
3609 return mip_max_bound_;
3612 _has_bits_[3] |= 0x00000800u;
3613 mip_max_bound_ = value;
3619 return (_has_bits_[3] & 0x00001000u) != 0;
3622 mip_var_scaling_ = 1;
3623 _has_bits_[3] &= ~0x00001000u;
3627 return mip_var_scaling_;
3630 _has_bits_[3] |= 0x00001000u;
3631 mip_var_scaling_ = value;
3637 return (_has_bits_[3] & 0x00002000u) != 0;
3640 mip_wanted_precision_ = 1e-06;
3641 _has_bits_[3] &= ~0x00002000u;
3645 return mip_wanted_precision_;
3648 _has_bits_[3] |= 0x00002000u;
3649 mip_wanted_precision_ = value;
3655 return (_has_bits_[1] & 0x00000020u) != 0;
3658 mip_max_activity_exponent_ = 53;
3659 _has_bits_[1] &= ~0x00000020u;
3663 return mip_max_activity_exponent_;
3666 _has_bits_[1] |= 0x00000020u;
3667 mip_max_activity_exponent_ = value;
3673 return (_has_bits_[3] & 0x00004000u) != 0;
3676 mip_check_precision_ = 0.0001;
3677 _has_bits_[3] &= ~0x00004000u;
3681 return mip_check_precision_;
3684 _has_bits_[3] |= 0x00004000u;
3685 mip_check_precision_ = value;
3690 #pragma GCC diagnostic pop 3699 namespace protobuf {
3703 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_VariableOrder>() {
3708 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_Polarity>() {
3713 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm>() {
3718 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm>() {
3723 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ClauseProtection>() {
3728 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ClauseOrdering>() {
3733 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_RestartAlgorithm>() {
3738 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_MaxSatAssumptionOrder>() {
3743 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm>() {
3748 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_SearchBranching>() {
3757 #include <google/protobuf/port_undef.inc> 3758 #endif // PROTOBUF_INCLUDED_ortools_2fsat_2fsat_5fparameters_2eproto bool use_pb_resolution() const
::operations_research::sat::SatParameters_VariableOrder preferred_variable_order() const
bool has_clause_activity_decay() const
optional double clause_activity_decay = 17 [default = 0.999];
bool minimize_core() const
SatParameters_SearchBranching SearchBranching
void set_enumerate_all_solutions(bool value)
void set_max_deterministic_time(double value)
SatParameters * New() const final
implements Message -------------------------------------------—
void set_boolean_encoding_level(::google::protobuf::int32 value)
void clear_num_conflicts_before_strategy_changes()
void clear_minimize_reduction_during_pb_resolution()
bool has_find_multiple_cores() const
optional bool find_multiple_cores = 84 [default = true];
void set_minimize_core(bool value)
void clear_cp_model_probing_level()
void set_stop_after_first_solution(bool value)
void clear_also_bump_variables_in_conflict_reasons()
::google::protobuf::int32 minimize_with_propagation_num_decisions() const
static const MaxSatStratificationAlgorithm STRATIFICATION_DESCENT
const SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MIN
void clear_minimize_with_propagation_restart_period()
void clear_cp_model_presolve()
SatParameters_VariableOrder
void set_mip_max_activity_exponent(::google::protobuf::int32 value)
void clear_glucose_decay_increment()
void set_min_orthogonality_for_lp_constraints(double value)
bool SatParameters_MaxSatAssumptionOrder_Parse(const ::std::string &name, SatParameters_MaxSatAssumptionOrder *value)
bool has_add_mir_cuts() const
optional bool add_mir_cuts = 120 [default = true];
void set_clause_cleanup_ordering(::operations_research::sat::SatParameters_ClauseOrdering value)
static const ::google::protobuf::EnumDescriptor * ClauseOrdering_descriptor()
::google::protobuf::int32 presolve_bve_threshold() const
bool optimize_with_max_hs() const
::google::protobuf::int32 mip_max_activity_exponent() const
::google::protobuf::Metadata GetMetadata() const final
bool has_max_deterministic_time() const
optional double max_deterministic_time = 67 [default = inf];
static const int kBooleanEncodingLevelFieldNumber
const ::std::string & SatParameters_BinaryMinizationAlgorithm_Name(SatParameters_BinaryMinizationAlgorithm value)
const SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MAX
static const int kMipMaxActivityExponentFieldNumber
static bool Polarity_IsValid(int value)
static const int kCpModelUseSatPresolveFieldNumber
bool SatParameters_RestartAlgorithm_Parse(const ::std::string &name, SatParameters_RestartAlgorithm *value)
static const int MaxSatAssumptionOrder_ARRAYSIZE
SatParameters_BinaryMinizationAlgorithm
void set_use_pb_resolution(bool value)
void set_clause_cleanup_period(::google::protobuf::int32 value)
void set_mip_wanted_precision(double value)
bool cover_optimization() const
const ::google::protobuf::EnumDescriptor * SatParameters_VariableOrder_descriptor()
static const int kUsePbResolutionFieldNumber
::operations_research::sat::SatParameters_BinaryMinizationAlgorithm binary_minimization_algorithm() const
void clear_count_assumption_levels_in_lbd()
const ::std::string & SatParameters_ConflictMinimizationAlgorithm_Name(SatParameters_ConflictMinimizationAlgorithm value)
void clear_clause_cleanup_lbd_bound()
static const MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_DEPTH
static const int kMaxInactiveCountFieldNumber
void clear_pseudo_cost_reliability_threshold()
void set_restart_algorithms(int index, ::operations_research::sat::SatParameters_RestartAlgorithm value)
static const BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION
void clear_binary_minimization_algorithm()
bool has_clause_cleanup_lbd_bound() const
optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
static const MaxSatAssumptionOrder MaxSatAssumptionOrder_MIN
::google::protobuf::int64 max_number_of_conflicts() const
bool has_use_rins_lns() const
optional bool use_rins_lns = 129 [default = false];
void clear_clause_activity_decay()
bool use_combined_no_overlap() const
bool has_exploit_all_lp_solution() const
optional bool exploit_all_lp_solution = 116 [default = true];
static const int kPreferredVariableOrderFieldNumber
static const int kMinimizeCoreFieldNumber
void clear_presolve_bve_clause_weight()
void set_use_optional_variables(bool value)
bool has_pb_cleanup_increment() const
optional int32 pb_cleanup_increment = 46 [default = 200];
bool has_initial_variables_activity() const
optional double initial_variables_activity = 76 [default = 0];
void clear_restart_lbd_average_ratio()
void set_linearization_level(::google::protobuf::int32 value)
bool minimize_reduction_during_pb_resolution() const
bool use_exact_lp_reason() const
bool has_initial_polarity() const
optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FAL...
void set_restart_period(::google::protobuf::int32 value)
static bool MaxSatStratificationAlgorithm_IsValid(int value)
static const int kUseMirRoundingFieldNumber
void clear_restart_running_window_size()
static const int kLinearizationLevelFieldNumber
void clear_minimization_algorithm()
::google::protobuf::int32 presolve_bve_clause_weight() const
const int SatParameters_RestartAlgorithm_RestartAlgorithm_ARRAYSIZE
bool has_boolean_encoding_level() const
optional int32 boolean_encoding_level = 107 [default = 1];
static const VariableOrder IN_ORDER
void clear_blocking_restart_multiplier()
const ::google::protobuf::EnumDescriptor * SatParameters_RestartAlgorithm_descriptor()
void clear_exploit_all_lp_solution()
bool SatParameters_SearchBranching_IsValid(int value)
void set_log_search_progress(bool value)
void clear_optimize_with_max_hs()
::operations_research::sat::SatParameters_MaxSatAssumptionOrder max_sat_assumption_order() const
void set_count_assumption_levels_in_lbd(bool value)
bool has_clause_cleanup_protection() const
optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [defa...
void CopyFrom(const ::google::protobuf::Message &from) final
bool enumerate_all_solutions() const
static const ::std::string & BinaryMinizationAlgorithm_Name(BinaryMinizationAlgorithm value)
const SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MIN
bool has_pb_cleanup_ratio() const
optional double pb_cleanup_ratio = 47 [default = 0.5];
void clear_random_branches_ratio()
bool has_cp_model_probing_level() const
optional int32 cp_model_probing_level = 110 [default = 2];
double max_clause_activity_value() const
static const ClauseProtection ClauseProtection_MAX
::google::protobuf::int32 minimize_with_propagation_restart_period() const
void clear_use_phase_saving()
void set_treat_binary_clauses_separately(bool value)
bool exploit_all_lp_solution() const
static const int kCountAssumptionLevelsInLbdFieldNumber
const ::google::protobuf::EnumDescriptor * SatParameters_MaxSatStratificationAlgorithm_descriptor()
void set_also_bump_variables_in_conflict_reasons(bool value)
static const int kAlsoBumpVariablesInConflictReasonsFieldNumber
void clear_mip_check_precision()
void clear_use_exact_lp_reason()
static const RestartAlgorithm RestartAlgorithm_MIN
bool has_use_precedences_in_disjunctive_constraint() const
optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
bool has_clause_cleanup_target() const
optional int32 clause_cleanup_target = 13 [default = 10000];
void set_optimize_with_max_hs(bool value)
::google::protobuf::int64 constraint_removal_batch_size() const
static const ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm_MIN
static const int kFillTightenedDomainsInResponseFieldNumber
void set_restart_dl_average_ratio(double value)
void set_binary_minimization_algorithm(::operations_research::sat::SatParameters_BinaryMinizationAlgorithm value)
bool SatParameters_Polarity_Parse(const ::std::string &name, SatParameters_Polarity *value)
void clear_exploit_integer_lp_solution()
::google::protobuf::int32 linearization_level() const
void set_num_search_workers(::google::protobuf::int32 value)
const int SatParameters_Polarity_Polarity_ARRAYSIZE
static const int kRandomSeedFieldNumber
bool has_minimize_reduction_during_pb_resolution() const
optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
double initial_variables_activity() const
bool SatParameters_MaxSatStratificationAlgorithm_IsValid(int value)
void Swap(SatParameters *other)
void set_allocated_default_restart_algorithms(::std::string *default_restart_algorithms)
static const SearchBranching PORTFOLIO_SEARCH
bool use_rins_lns() const
double blocking_restart_multiplier() const
void set_exploit_integer_lp_solution(bool value)
double mip_wanted_precision() const
bool has_preferred_variable_order() const
optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default =...
void clear_constraint_removal_batch_size()
void clear_binary_search_num_conflicts()
void set_use_rins_lns(bool value)
bool use_phase_saving() const
void set_use_overload_checker_in_cumulative_constraint(bool value)
void clear_clause_cleanup_ordering()
bool has_use_optional_variables() const
optional bool use_optional_variables = 108 [default = true];
void clear_blocking_restart_window_size()
void clear_random_polarity_ratio()
bool share_objective_bounds() const
inline ::google::protobuf::UnknownFieldSet * mutable_unknown_fields()
bool has_blocking_restart_multiplier() const
optional double blocking_restart_multiplier = 66 [default = 1.4];
bool has_randomize_search() const
optional bool randomize_search = 103 [default = false];
void set_mip_var_scaling(double value)
static const int kPresolveBvaThresholdFieldNumber
static const MaxSatAssumptionOrder MaxSatAssumptionOrder_MAX
void clear_only_add_cuts_at_level_zero()
void clear_max_integer_rounding_scaling()
static const Polarity POLARITY_RANDOM
const SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MAX
static const ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm_MAX
bool cp_model_use_sat_presolve() const
const ::std::string & SatParameters_Polarity_Name(SatParameters_Polarity value)
static const int kAddCgCutsFieldNumber
bool has_also_bump_variables_in_conflict_reasons() const
optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
static const int kUseOptionalVariablesFieldNumber
double variable_activity_decay() const
double clause_activity_decay() const
bool add_lp_constraints_lazily() const
static const Polarity POLARITY_FALSE
bool use_overload_checker_in_cumulative_constraint() const
void set_presolve_use_bva(bool value)
void set_clause_cleanup_protection(::operations_research::sat::SatParameters_ClauseProtection value)
static const SearchBranching LP_SEARCH
void set_restart_lbd_average_ratio(double value)
const SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MIN
static bool VariableOrder_IsValid(int value)
static const ClauseProtection PROTECTION_ALWAYS
void set_max_time_in_seconds(double value)
const ::std::string & SatParameters_VariableOrder_Name(SatParameters_VariableOrder value)
bool SatParameters_ClauseOrdering_Parse(const ::std::string &name, SatParameters_ClauseOrdering *value)
bool has_instantiate_all_variables() const
optional bool instantiate_all_variables = 106 [default = true];
bool has_max_variable_activity_value() const
optional double max_variable_activity_value = 16 [default = 1e+100];
void clear_use_optimization_hints()
void clear_mip_var_scaling()
bool has_lns_focus_on_decision_variables() const
optional bool lns_focus_on_decision_variables = 105 [default = false];
static const int kBinaryMinimizationAlgorithmFieldNumber
static const int kOptimizeWithMaxHsFieldNumber
const ::std::string & SatParameters_MaxSatStratificationAlgorithm_Name(SatParameters_MaxSatStratificationAlgorithm value)
::operations_research::sat::SatParameters_ClauseOrdering clause_cleanup_ordering() const
void clear_auto_detect_greater_than_at_least_one_of()
void clear_use_blocking_restart()
void set_max_sat_reverse_assumption_order(bool value)
static const int kFindMultipleCoresFieldNumber
bool SatParameters_BinaryMinizationAlgorithm_IsValid(int value)
static const ::std::string & ConflictMinimizationAlgorithm_Name(ConflictMinimizationAlgorithm value)
static const int kMinimizeReductionDuringPbResolutionFieldNumber
void set_presolve_bve_clause_weight(::google::protobuf::int32 value)
static bool RestartAlgorithm_IsValid(int value)
static const ::std::string & RestartAlgorithm_Name(RestartAlgorithm value)
static const int kCpModelPresolveFieldNumber
bool find_multiple_cores() const
bool use_timetable_edge_finding_in_cumulative_constraint() const
bool has_glucose_decay_increment_period() const
optional int32 glucose_decay_increment_period = 24 [default = 5000];
void set_glucose_decay_increment(double value)
void clear_use_precedences_in_disjunctive_constraint()
static const VariableOrder IN_REVERSE_ORDER
bool has_auto_detect_greater_than_at_least_one_of() const
optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
static const int kNumSearchWorkersFieldNumber
bool has_max_clause_activity_value() const
optional double max_clause_activity_value = 18 [default = 1e+20];
void set_max_sat_assumption_order(::operations_research::sat::SatParameters_MaxSatAssumptionOrder value)
const ::google::protobuf::EnumDescriptor * SatParameters_MaxSatAssumptionOrder_descriptor()
const ::google::protobuf::EnumDescriptor * SatParameters_BinaryMinizationAlgorithm_descriptor()
::google::protobuf::int64 search_randomization_tolerance() const
void clear_mip_wanted_precision()
static bool ClauseProtection_IsValid(int value)
bool has_count_assumption_levels_in_lbd() const
optional bool count_assumption_levels_in_lbd = 49 [default = true];
bool max_sat_reverse_assumption_order() const
static const SearchBranching PSEUDO_COST_SEARCH
const SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MIN
void AddDescriptors_ortools_2fsat_2fsat_5fparameters_2eproto()
void clear_variable_activity_decay()
bool has_restart_lbd_average_ratio() const
optional double restart_lbd_average_ratio = 71 [default = 1];
void clear_max_sat_stratification()
static const int kUsePrecedencesInDisjunctiveConstraintFieldNumber
bool has_use_blocking_restart() const
optional bool use_blocking_restart = 64 [default = false];
bool has_mip_wanted_precision() const
optional double mip_wanted_precision = 126 [default = 1e-06];
void set_add_mir_cuts(bool value)
static const int kPresolveBveThresholdFieldNumber
void set_max_clause_activity_value(double value)
bool use_precedences_in_disjunctive_constraint() const
static bool ClauseProtection_Parse(const ::std::string &name, ClauseProtection *value)
void set_max_sat_stratification(::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm value)
void set_minimize_with_propagation_restart_period(::google::protobuf::int32 value)
::google::protobuf::int64 max_memory_in_mb() const
const SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MIN
void set_instantiate_all_variables(bool value)
static const int kUseOverloadCheckerInCumulativeConstraintFieldNumber
void clear_max_variable_activity_value()
static const int kMaxDeterministicTimeFieldNumber
void clear_presolve_blocked_clause()
static bool SearchBranching_IsValid(int value)
static const int kEnumerateAllSolutionsFieldNumber
static const int kMaxTimeInSecondsFieldNumber
bool has_add_knapsack_cuts() const
optional bool add_knapsack_cuts = 111 [default = false];
static const BinaryMinizationAlgorithm BinaryMinizationAlgorithm_MIN
void clear_strategy_change_increase_ratio()
static const int kBlockingRestartWindowSizeFieldNumber
static const SearchBranching SearchBranching_MIN
static const int kMaxSatAssumptionOrderFieldNumber
void set_exploit_objective(bool value)
bool has_random_polarity_ratio() const
optional double random_polarity_ratio = 45 [default = 0];
bool has_exploit_best_solution() const
optional bool exploit_best_solution = 130 [default = false];
bool has_max_sat_stratification() const
optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification ...
::google::protobuf::int32 presolve_bva_threshold() const
::operations_research::sat::SatParameters_ClauseProtection clause_cleanup_protection() const
const int SatParameters_SearchBranching_SearchBranching_ARRAYSIZE
::google::protobuf::int32 lns_num_threads() const
static bool MaxSatStratificationAlgorithm_Parse(const ::std::string &name, MaxSatStratificationAlgorithm *value)
void set_cp_model_presolve(bool value)
void set_clause_cleanup_target(::google::protobuf::int32 value)
SatParameters_BinaryMinizationAlgorithm BinaryMinizationAlgorithm
void clear_subsumption_during_conflict_analysis()
bool has_exploit_objective() const
optional bool exploit_objective = 131 [default = true];
void clear_boolean_encoding_level()
double pb_cleanup_ratio() const
bool has_presolve_bva_threshold() const
optional int32 presolve_bva_threshold = 73 [default = 1];
double mip_max_bound() const
void set_use_precedences_in_disjunctive_constraint(bool value)
static const BinaryMinizationAlgorithm BinaryMinizationAlgorithm_MAX
bool lns_focus_on_decision_variables() const
::google::protobuf::int64 pseudo_cost_reliability_threshold() const
bool has_random_branches_ratio() const
optional double random_branches_ratio = 32 [default = 0];
bool has_use_disjunctive_constraint_in_cumulative_constraint() const
optional bool use_disjunctive_constraint_in_cumulative_constraint = 80 [default = true];
::google::protobuf::int32 boolean_encoding_level() const
void MergeFrom(const ::google::protobuf::Message &from) final
bool has_cp_model_use_sat_presolve() const
optional bool cp_model_use_sat_presolve = 93 [default = true];
bool SatParameters_ClauseProtection_Parse(const ::std::string &name, SatParameters_ClauseProtection *value)
const int SatParameters_ClauseProtection_ClauseProtection_ARRAYSIZE
SatParameters_MaxSatAssumptionOrder MaxSatAssumptionOrder
void add_restart_algorithms(::operations_research::sat::SatParameters_RestartAlgorithm value)
bool SatParameters_VariableOrder_IsValid(int value)
void clear_instantiate_all_variables()
static const int kExploitAllLpSolutionFieldNumber
bool has_binary_search_num_conflicts() const
optional int32 binary_search_num_conflicts = 99 [default = -1];
static const int kClauseCleanupTargetFieldNumber
void set_blocking_restart_window_size(::google::protobuf::int32 value)
SatParameters_ClauseOrdering ClauseOrdering
static const int kNumConflictsBeforeStrategyChangesFieldNumber
static const int kVariableActivityDecayFieldNumber
static const Polarity Polarity_MAX
static const MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm_MIN
bool has_variable_activity_decay() const
optional double variable_activity_decay = 15 [default = 0.8];
static const int kPresolveProbingDeterministicTimeLimitFieldNumber
bool add_mir_cuts() const
void set_use_phase_saving(bool value)
const SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MIN
static const int VariableOrder_ARRAYSIZE
static const BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST
void set_lns_num_threads(::google::protobuf::int32 value)
static bool VariableOrder_Parse(const ::std::string &name, VariableOrder *value)
void set_random_seed(::google::protobuf::int32 value)
bool presolve_use_bva() const
static const VariableOrder IN_RANDOM_ORDER
bool SatParameters_MaxSatStratificationAlgorithm_Parse(const ::std::string &name, SatParameters_MaxSatStratificationAlgorithm *value)
bool subsumption_during_conflict_analysis() const
void set_blocking_restart_multiplier(double value)
static const ConflictMinimizationAlgorithm NONE
void set_initial_variables_activity(double value)
static const MaxSatStratificationAlgorithm STRATIFICATION_ASCENT
bool only_add_cuts_at_level_zero() const
static const ClauseProtection ClauseProtection_MIN
SatParametersDefaultTypeInternal _SatParameters_default_instance_
void set_subsumption_during_conflict_analysis(bool value)
bool has_restart_period() const
optional int32 restart_period = 30 [default = 50];
static const int kAddKnapsackCutsFieldNumber
const int SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_ARRAYSIZE
void clear_fill_tightened_domains_in_response()
::google::protobuf::int32 clause_cleanup_period() const
static const int kMinimizeWithPropagationRestartPeriodFieldNumber
void set_use_mir_rounding(bool value)
bool has_num_search_workers() const
optional int32 num_search_workers = 100 [default = 0];
bool use_mir_rounding() const
bool has_minimization_algorithm() const
optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm ...
void clear_minimize_with_propagation_num_decisions()
bool has_restart_running_window_size() const
optional int32 restart_running_window_size = 62 [default = 50];
static const int kUseOptimizationHintsFieldNumber
double glucose_max_decay() const
static const ::google::protobuf::EnumDescriptor * VariableOrder_descriptor()
bool use_blocking_restart() const
bool auto_detect_greater_than_at_least_one_of() const
const ::google::protobuf::EnumDescriptor * SatParameters_Polarity_descriptor()
bool has_exploit_integer_lp_solution() const
optional bool exploit_integer_lp_solution = 94 [default = true];
static const int kOptimizeWithCoreFieldNumber
bool has_enumerate_all_solutions() const
optional bool enumerate_all_solutions = 87 [default = false];
static const SearchBranching PORTFOLIO_WITH_QUICK_RESTART_SEARCH
static const int kRestartRunningWindowSizeFieldNumber
static const int ConflictMinimizationAlgorithm_ARRAYSIZE
static const int kDefaultRestartAlgorithmsFieldNumber
static const RestartAlgorithm DL_MOVING_AVERAGE_RESTART
const SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MAX
void clear_stop_after_first_solution()
static bool BinaryMinizationAlgorithm_IsValid(int value)
SatParameters_ConflictMinimizationAlgorithm
SatParameters_ClauseOrdering
::operations_research::sat::SatParameters_Polarity initial_polarity() const
static const int kTreatBinaryClausesSeparatelyFieldNumber
void clear_max_clause_activity_value()
bool share_level_zero_bounds() const
static const int kPseudoCostReliabilityThresholdFieldNumber
bool SatParameters_ConflictMinimizationAlgorithm_Parse(const ::std::string &name, SatParameters_ConflictMinimizationAlgorithm *value)
bool has_subsumption_during_conflict_analysis() const
optional bool subsumption_during_conflict_analysis = 56 [default = true];
void set_max_num_cuts(::google::protobuf::int32 value)
::google::protobuf::int32 num_conflicts_before_strategy_changes() const
void set_max_integer_rounding_scaling(::google::protobuf::int32 value)
void clear_restart_algorithms()
bool exploit_best_solution() const
bool has_use_phase_saving() const
optional bool use_phase_saving = 44 [default = true];
const SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MAX
static const ::google::protobuf::EnumDescriptor * ClauseProtection_descriptor()
::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm max_sat_stratification() const
const ::std::string & SatParameters_SearchBranching_Name(SatParameters_SearchBranching value)
static const ::google::protobuf::EnumDescriptor * ConflictMinimizationAlgorithm_descriptor()
void set_use_lns(bool value)
static const int kLnsNumThreadsFieldNumber
const int SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_ARRAYSIZE
void clear_max_inactive_count()
void set_optimize_with_core(bool value)
void set_mip_check_precision(double value)
::google::protobuf::int32 num_search_workers() const
bool instantiate_all_variables() const
SatParameters_SearchBranching
double random_branches_ratio() const
static const int kStopAfterFirstSolutionFieldNumber
void clear_use_optional_variables()
bool SatParameters_ClauseOrdering_IsValid(int value)
::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm minimization_algorithm() const
bool fill_tightened_domains_in_response() const
static bool ConflictMinimizationAlgorithm_Parse(const ::std::string &name, ConflictMinimizationAlgorithm *value)
void set_exploit_best_solution(bool value)
bool add_knapsack_cuts() const
bool has_presolve_use_bva() const
optional bool presolve_use_bva = 72 [default = true];
static const Polarity POLARITY_REVERSE_WEIGHTED_SIGN
const int SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_ARRAYSIZE
static const int kUseErwaHeuristicFieldNumber
void clear_preferred_variable_order()
const SatParameters_Polarity SatParameters_Polarity_Polarity_MAX
static const ::std::string & SearchBranching_Name(SearchBranching value)
static const RestartAlgorithm LBD_MOVING_AVERAGE_RESTART
void set_use_erwa_heuristic(bool value)
void clear_use_rins_lns()
double restart_dl_average_ratio() const
void clear_use_erwa_heuristic()
static const int kBlockingRestartMultiplierFieldNumber
static const Polarity POLARITY_TRUE
bool has_log_search_progress() const
optional bool log_search_progress = 41 [default = false];
void clear_exploit_best_solution()
void clear_initial_polarity()
void set_cp_model_use_sat_presolve(bool value)
static const int kAddLpConstraintsLazilyFieldNumber
static const ClauseOrdering ClauseOrdering_MAX
void clear_presolve_probing_deterministic_time_limit()
SatParameters_Polarity Polarity
void set_lns_focus_on_decision_variables(bool value)
const ::google::protobuf::UnknownFieldSet & unknown_fields() const
static const SearchBranching FIXED_SEARCH
static const int kRestartPeriodFieldNumber
::google::protobuf::int32 binary_search_num_conflicts() const
bool has_minimize_with_propagation_num_decisions() const
optional int32 minimize_with_propagation_num_decisions = 97 [default = 1000];
static const int Polarity_ARRAYSIZE
double strategy_change_increase_ratio() const
void set_max_inactive_count(::google::protobuf::int64 value)
void clear_mip_max_activity_exponent()
::google::protobuf::int32 blocking_restart_window_size() const
static const int kSubsumptionDuringConflictAnalysisFieldNumber
bool has_treat_binary_clauses_separately() const
optional bool treat_binary_clauses_separately = 33 [default = true];
bool has_pseudo_cost_reliability_threshold() const
optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
void set_only_add_cuts_at_level_zero(bool value)
bool has_max_memory_in_mb() const
optional int64 max_memory_in_mb = 40 [default = 10000];
static const MaxSatStratificationAlgorithm STRATIFICATION_NONE
bool use_disjunctive_constraint_in_cumulative_constraint() const
bool has_cp_model_presolve() const
optional bool cp_model_presolve = 86 [default = true];
void set_max_number_of_conflicts(::google::protobuf::int64 value)
void set_initial_polarity(::operations_research::sat::SatParameters_Polarity value)
void clear_pb_cleanup_ratio()
bool has_random_seed() const
optional int32 random_seed = 31 [default = 1];
static void InitAsDefaultInstance()
SatParameters_MaxSatStratificationAlgorithm
static const int kGlucoseMaxDecayFieldNumber
static const int kMaxNumberOfConflictsFieldNumber
static const MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_WEIGHT
bool has_binary_minimization_algorithm() const
optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorit...
void set_search_branching(::operations_research::sat::SatParameters_SearchBranching value)
bool randomize_search() const
static const int kGlucoseDecayIncrementFieldNumber
bool has_max_integer_rounding_scaling() const
optional int32 max_integer_rounding_scaling = 119 [default = 600];
static const ConflictMinimizationAlgorithm RECURSIVE
bool use_erwa_heuristic() const
void set_auto_detect_greater_than_at_least_one_of(bool value)
static const int kShareObjectiveBoundsFieldNumber
static const int kSearchBranchingFieldNumber
bool IsInitialized() const final
void set_restart_running_window_size(::google::protobuf::int32 value)
bool SatParameters_ClauseProtection_IsValid(int value)
::google::protobuf::int32 max_integer_rounding_scaling() const
void clear_add_lp_constraints_lazily()
size_t ByteSizeLong() const final
const SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MAX
static const ClauseProtection PROTECTION_NONE
bool has_cover_optimization() const
optional bool cover_optimization = 89 [default = true];
static const int kMaxVariableActivityValueFieldNumber
static const ::google::protobuf::EnumDescriptor * SearchBranching_descriptor()
static const int kMaxIntegerRoundingScalingFieldNumber
double restart_lbd_average_ratio() const
::google::protobuf::int32 restart_period() const
static const BinaryMinizationAlgorithm NO_BINARY_MINIMIZATION
static const SatParameters * internal_default_instance()
::google::protobuf::int64 max_inactive_count() const
bool SatParameters_ConflictMinimizationAlgorithm_IsValid(int value)
bool has_glucose_decay_increment() const
optional double glucose_decay_increment = 23 [default = 0.01];
const ::google::protobuf::EnumDescriptor * SatParameters_SearchBranching_descriptor()
static const int ClauseProtection_ARRAYSIZE
const SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MIN
bool treat_binary_clauses_separately() const
static const ConflictMinimizationAlgorithm SIMPLE
void clear_use_overload_checker_in_cumulative_constraint()
SatParameters_RestartAlgorithm
void clear_exploit_objective()
void set_add_lp_constraints_lazily(bool value)
bool has_use_pb_resolution() const
optional bool use_pb_resolution = 43 [default = false];
static const int kUseDisjunctiveConstraintInCumulativeConstraintFieldNumber
SatParameters_ClauseProtection
void set_use_combined_no_overlap(bool value)
void clear_lns_focus_on_decision_variables()
void clear_search_randomization_tolerance()
const SatParameters_Polarity SatParameters_Polarity_Polarity_MIN
bool has_strategy_change_increase_ratio() const
optional double strategy_change_increase_ratio = 69 [default = 0];
bool has_mip_max_activity_exponent() const
optional int32 mip_max_activity_exponent = 127 [default = 53];
static const ::std::string & VariableOrder_Name(VariableOrder value)
bool has_stop_after_first_solution() const
optional bool stop_after_first_solution = 98 [default = false];
void clear_restart_period()
static const RestartAlgorithm RestartAlgorithm_MAX
void set_binary_search_num_conflicts(::google::protobuf::int32 value)
void set_use_optimization_hints(bool value)
static bool BinaryMinizationAlgorithm_Parse(const ::std::string &name, BinaryMinizationAlgorithm *value)
void clear_clause_cleanup_period()
SatParameters_MaxSatAssumptionOrder
void clear_max_time_in_seconds()
void set_max_memory_in_mb(::google::protobuf::int64 value)
const SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MAX
static const ::google::protobuf::EnumDescriptor * MaxSatAssumptionOrder_descriptor()
double presolve_probing_deterministic_time_limit() const
bool has_restart_dl_average_ratio() const
optional double restart_dl_average_ratio = 63 [default = 1];
bool has_use_lns() const
optional bool use_lns = 101 [default = false];
static const ClauseOrdering CLAUSE_LBD
bool has_max_sat_assumption_order() const
optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [...
void set_cover_optimization(bool value)
static const int ClauseOrdering_ARRAYSIZE
bool has_blocking_restart_window_size() const
optional int32 blocking_restart_window_size = 65 [default = 5000];
::google::protobuf::int32 restart_running_window_size() const
::operations_research::sat::SatParameters_SearchBranching search_branching() const
bool has_mip_max_bound() const
optional double mip_max_bound = 124 [default = 10000000];
void clear_num_search_workers()
static const int kMinOrthogonalityForLpConstraintsFieldNumber
static bool SearchBranching_Parse(const ::std::string &name, SearchBranching *value)
static const int kMipWantedPrecisionFieldNumber
void clear_use_timetable_edge_finding_in_cumulative_constraint()
static const int kOnlyAddCutsAtLevelZeroFieldNumber
void set_num_conflicts_before_strategy_changes(::google::protobuf::int32 value)
static const int kMaxSatReverseAssumptionOrderFieldNumber
void clear_lns_num_threads()
double mip_check_precision() const
const int SatParameters_ClauseOrdering_ClauseOrdering_ARRAYSIZE
static const int kMinimizationAlgorithmFieldNumber
void clear_find_multiple_cores()
void clear_restart_dl_average_ratio()
bool exploit_objective() const
static const ::google::protobuf::Descriptor * descriptor()
bool has_max_time_in_seconds() const
optional double max_time_in_seconds = 36 [default = inf];
double mip_var_scaling() const
static constexpr int kIndexInFileMessages
const SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MIN
void clear_max_sat_assumption_order()
static const int kInstantiateAllVariablesFieldNumber
const ::std::string & SatParameters_RestartAlgorithm_Name(SatParameters_RestartAlgorithm value)
static const int RestartAlgorithm_ARRAYSIZE
static const int MaxSatStratificationAlgorithm_ARRAYSIZE
static const int kRandomizeSearchFieldNumber
void clear_max_deterministic_time()
void clear_minimize_core()
double random_polarity_ratio() const
static const RestartAlgorithm FIXED_RESTART
static bool MaxSatAssumptionOrder_IsValid(int value)
::google::protobuf::int32 random_seed() const
static const int SearchBranching_ARRAYSIZE
static const SearchBranching AUTOMATIC_SEARCH
double max_time_in_seconds() const
bool has_constraint_removal_batch_size() const
optional int64 constraint_removal_batch_size = 122 [default = 100];
SatParameters_ClauseProtection ClauseProtection
bool has_mip_var_scaling() const
optional double mip_var_scaling = 125 [default = 1];
void set_use_blocking_restart(bool value)
void set_add_cg_cuts(bool value)
void clear_use_pb_resolution()
const ::std::string & SatParameters_MaxSatAssumptionOrder_Name(SatParameters_MaxSatAssumptionOrder value)
bool log_search_progress() const
bool use_optimization_hints() const
void clear_max_num_cuts()
void clear_optimize_with_core()
void set_presolve_probing_deterministic_time_limit(double value)
void clear_max_memory_in_mb()
static const int kGlucoseDecayIncrementPeriodFieldNumber
static const RestartAlgorithm LUBY_RESTART
::google::protobuf::RepeatedField< int > * mutable_restart_algorithms()
static const Polarity POLARITY_WEIGHTED_SIGN
void set_random_branches_ratio(double value)
void set_max_variable_activity_value(double value)
void set_minimization_algorithm(::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm value)
bool has_share_level_zero_bounds() const
optional bool share_level_zero_bounds = 114 [default = true];
bool has_use_optimization_hints() const
optional bool use_optimization_hints = 35 [default = true];
bool SatParameters_RestartAlgorithm_IsValid(int value)
void set_mip_max_bound(double value)
static bool RestartAlgorithm_Parse(const ::std::string &name, RestartAlgorithm *value)
static const int kConstraintRemovalBatchSizeFieldNumber
void set_glucose_max_decay(double value)
static bool MaxSatAssumptionOrder_Parse(const ::std::string &name, MaxSatAssumptionOrder *value)
const int SatParameters_VariableOrder_VariableOrder_ARRAYSIZE
void clear_presolve_bve_threshold()
::google::protobuf::int32 pb_cleanup_increment() const
double max_deterministic_time() const
void clear_min_orthogonality_for_lp_constraints()
void set_constraint_removal_batch_size(::google::protobuf::int64 value)
bool has_presolve_bve_threshold() const
optional int32 presolve_bve_threshold = 54 [default = 500];
bool has_add_lp_constraints_lazily() const
optional bool add_lp_constraints_lazily = 112 [default = true];
static const ::std::string & Polarity_Name(Polarity value)
void clear_use_combined_no_overlap()
static bool Polarity_Parse(const ::std::string &name, Polarity *value)
static const int kPresolveBlockedClauseFieldNumber
void clear_glucose_decay_increment_period()
bool SatParameters_BinaryMinizationAlgorithm_Parse(const ::std::string &name, SatParameters_BinaryMinizationAlgorithm *value)
static const int kMaxClauseActivityValueFieldNumber
static const ::google::protobuf::EnumDescriptor * RestartAlgorithm_descriptor()
static const int kMinimizeWithPropagationNumDecisionsFieldNumber
void clear_use_disjunctive_constraint_in_cumulative_constraint()
const ::google::protobuf::EnumDescriptor * SatParameters_ClauseProtection_descriptor()
::std::string * mutable_default_restart_algorithms()
static const int kLnsFocusOnDecisionVariablesFieldNumber
void clear_share_objective_bounds()
void set_presolve_bve_threshold(::google::protobuf::int32 value)
const ::google::protobuf::EnumDescriptor * SatParameters_ClauseOrdering_descriptor()
static const int kClauseActivityDecayFieldNumber
void set_clause_activity_decay(double value)
void clear_add_knapsack_cuts()
static const ClauseOrdering CLAUSE_ACTIVITY
void set_presolve_blocked_clause(bool value)
bool has_lns_num_threads() const
optional int32 lns_num_threads = 102 [default = 1];
bool use_optional_variables() const
static const ConflictMinimizationAlgorithm EXPERIMENTAL
static const int kUseRinsLnsFieldNumber
void clear_randomize_search()
void clear_add_mir_cuts()
bool stop_after_first_solution() const
bool has_use_timetable_edge_finding_in_cumulative_constraint() const
optional bool use_timetable_edge_finding_in_cumulative_constraint = 79 [default = false];
static const BinaryMinizationAlgorithm BINARY_MINIMIZATION_WITH_REACHABILITY
void clear_clause_cleanup_target()
bool SatParameters_VariableOrder_Parse(const ::std::string &name, SatParameters_VariableOrder *value)
SatParameters_MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm
bool has_presolve_bve_clause_weight() const
optional int32 presolve_bve_clause_weight = 55 [default = 3];
const ::google::protobuf::EnumDescriptor * SatParameters_ConflictMinimizationAlgorithm_descriptor()
void set_pb_cleanup_ratio(double value)
static const int BinaryMinizationAlgorithm_ARRAYSIZE
void set_share_objective_bounds(bool value)
void clear_max_sat_reverse_assumption_order()
static const int kRandomPolarityRatioFieldNumber
void clear_default_restart_algorithms()
bool exploit_integer_lp_solution() const
void set_pb_cleanup_increment(::google::protobuf::int32 value)
void set_cp_model_probing_level(::google::protobuf::int32 value)
void clear_mip_max_bound()
static bool ClauseOrdering_IsValid(int value)
bool presolve_blocked_clause() const
static const ::std::string & MaxSatAssumptionOrder_Name(MaxSatAssumptionOrder value)
static const int kUseTimetableEdgeFindingInCumulativeConstraintFieldNumber
static const int kMaxMemoryInMbFieldNumber
bool has_search_branching() const
optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTO...
static const VariableOrder VariableOrder_MAX
static const int kUseLnsFieldNumber
static const int kMaxNumCutsFieldNumber
bool has_search_randomization_tolerance() const
optional int64 search_randomization_tolerance = 104 [default = 0];
bool has_use_exact_lp_reason() const
optional bool use_exact_lp_reason = 109 [default = true];
bool has_glucose_max_decay() const
optional double glucose_max_decay = 22 [default = 0.95];
void set_presolve_bva_threshold(::google::protobuf::int32 value)
static const RestartAlgorithm NO_RESTART
::google::protobuf::uint8 * InternalSerializeWithCachedSizesToArray(::google::protobuf::uint8 *target) const final
SatParameters_RestartAlgorithm RestartAlgorithm
bool has_add_cg_cuts() const
optional bool add_cg_cuts = 117 [default = false];
::google::protobuf::int32 cp_model_probing_level() const
void clear_treat_binary_clauses_separately()
bool SatParameters_Polarity_IsValid(int value)
SatParameters_ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm
static const int kRestartAlgorithmsFieldNumber
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...
static const ::std::string & ClauseOrdering_Name(ClauseOrdering value)
static const int kAutoDetectGreaterThanAtLeastOneOfFieldNumber
bool count_assumption_levels_in_lbd() const
const int SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_ARRAYSIZE
static const ::std::string & MaxSatStratificationAlgorithm_Name(MaxSatStratificationAlgorithm value)
static const int kStrategyChangeIncreaseRatioFieldNumber
::std::string * release_default_restart_algorithms()
void set_randomize_search(bool value)
static const Polarity Polarity_MIN
static const ::google::protobuf::EnumDescriptor * MaxSatStratificationAlgorithm_descriptor()
void SerializeWithCachedSizes(::google::protobuf::io::CodedOutputStream *output) const final
bool has_max_inactive_count() const
optional int64 max_inactive_count = 121 [default = 1000];
double max_variable_activity_value() const
const SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MIN
static const ClauseProtection PROTECTION_LBD
void clear_use_mir_rounding()
::google::protobuf::int32 max_num_cuts() const
bool has_use_combined_no_overlap() const
optional bool use_combined_no_overlap = 133 [default = false];
SatParameters & operator=(const SatParameters &from)
::google::protobuf::int32 clause_cleanup_lbd_bound() const
friend void swap(SatParameters &a, SatParameters &b)
void set_share_level_zero_bounds(bool value)
bool has_max_num_cuts() const
optional int32 max_num_cuts = 91 [default = 1000];
static const int kRestartLbdAverageRatioFieldNumber
static const int kPresolveUseBvaFieldNumber
static const int kClauseCleanupLbdBoundFieldNumber
double glucose_decay_increment() const
static const int kExploitBestSolutionFieldNumber
static const int kMipVarScalingFieldNumber
void set_random_polarity_ratio(double value)
const SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MAX
bool has_num_conflicts_before_strategy_changes() const
optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
static const BinaryMinizationAlgorithm EXPERIMENTAL_BINARY_MINIMIZATION
int GetCachedSize() const final
bool also_bump_variables_in_conflict_reasons() const
bool SatParameters_MaxSatAssumptionOrder_IsValid(int value)
static const int kBinarySearchNumConflictsFieldNumber
void clear_search_branching()
static const int kExploitObjectiveFieldNumber
bool has_max_sat_reverse_assumption_order() const
optional bool max_sat_reverse_assumption_order = 52 [default = false];
static const SearchBranching SearchBranching_MAX
static const int kUseExactLpReasonFieldNumber
bool has_clause_cleanup_period() const
optional int32 clause_cleanup_period = 11 [default = 10000];
static bool ConflictMinimizationAlgorithm_IsValid(int value)
bool has_default_restart_algorithms() const
optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,...
static const int kRandomBranchesRatioFieldNumber
void set_find_multiple_cores(bool value)
void set_variable_activity_decay(double value)
static const int kClauseCleanupOrderingFieldNumber
static const int kMaxSatStratificationFieldNumber
bool has_max_number_of_conflicts() const
optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
void set_use_exact_lp_reason(bool value)
static const int kUseCombinedNoOverlapFieldNumber
void set_fill_tightened_domains_in_response(bool value)
void set_search_randomization_tolerance(::google::protobuf::int64 value)
static ::google::protobuf::internal::ExplicitlyConstructed<::std::string > _i_give_permission_to_break_this_code_default_default_restart_algorithms_
static const ::google::protobuf::EnumDescriptor * Polarity_descriptor()
static const int kMipCheckPrecisionFieldNumber
::google::protobuf::int32 glucose_decay_increment_period() const
static const int kShareLevelZeroBoundsFieldNumber
bool has_clause_cleanup_ordering() const
optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default ...
double min_orthogonality_for_lp_constraints() const
bool has_min_orthogonality_for_lp_constraints() const
optional double min_orthogonality_for_lp_constraints = 115 [default = 0];
static const int kInitialVariablesActivityFieldNumber
static const SatParameters & default_instance()
bool has_optimize_with_core() const
optional bool optimize_with_core = 83 [default = false];
bool has_minimize_with_propagation_restart_period() const
optional int32 minimize_with_propagation_restart_period = 96 [default = 10];
void set_glucose_decay_increment_period(::google::protobuf::int32 value)
static const int kExploitIntegerLpSolutionFieldNumber
static const MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm_MAX
void set_strategy_change_increase_ratio(double value)
void set_minimize_reduction_during_pb_resolution(bool value)
const ::std::string & default_restart_algorithms() const
void clear_initial_variables_activity()
static const int kClauseCleanupProtectionFieldNumber
void set_use_disjunctive_constraint_in_cumulative_constraint(bool value)
const SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MAX
static const int kPbCleanupIncrementFieldNumber
static const ClauseOrdering ClauseOrdering_MIN
const ::google::protobuf::RepeatedField< int > & restart_algorithms() const
bool has_use_erwa_heuristic() const
optional bool use_erwa_heuristic = 75 [default = false];
void set_preferred_variable_order(::operations_research::sat::SatParameters_VariableOrder value)
static const int kPbCleanupRatioFieldNumber
bool has_use_mir_rounding() const
optional bool use_mir_rounding = 118 [default = true];
bool has_presolve_probing_deterministic_time_limit() const
optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
static const MaxSatAssumptionOrder DEFAULT_ASSUMPTION_ORDER
bool has_mip_check_precision() const
optional double mip_check_precision = 128 [default = 0.0001];
void clear_enumerate_all_solutions()
bool has_linearization_level() const
optional int32 linearization_level = 90 [default = 1];
static const int kInitialPolarityFieldNumber
const ::std::string & SatParameters_ClauseProtection_Name(SatParameters_ClauseProtection value)
bool has_share_objective_bounds() const
optional bool share_objective_bounds = 113 [default = true];
static const VariableOrder VariableOrder_MIN
void clear_glucose_max_decay()
static const int kRestartDlAverageRatioFieldNumber
void set_default_restart_algorithms(const ::std::string &value)
void set_clause_cleanup_lbd_bound(::google::protobuf::int32 value)
static const int kClauseCleanupPeriodFieldNumber
SatParameters_VariableOrder VariableOrder
nested types -------------------------------------------------—
void clear_cover_optimization()
bool MergePartialFromCodedStream(::google::protobuf::io::CodedInputStream *input) final
static const int kLogSearchProgressFieldNumber
bool has_use_overload_checker_in_cumulative_constraint() const
optional bool use_overload_checker_in_cumulative_constraint = 78 [default = false];
static const ::std::string & ClauseProtection_Name(ClauseProtection value)
void clear_share_level_zero_bounds()
bool has_presolve_blocked_clause() const
optional bool presolve_blocked_clause = 88 [default = true];
static const int kUsePhaseSavingFieldNumber
void clear_log_search_progress()
void set_exploit_all_lp_solution(bool value)
void clear_clause_cleanup_protection()
const ::std::string & SatParameters_ClauseOrdering_Name(SatParameters_ClauseOrdering value)
bool optimize_with_core() const
bool SatParameters_SearchBranching_Parse(const ::std::string &name, SatParameters_SearchBranching *value)
void set_add_knapsack_cuts(bool value)
bool cp_model_presolve() const
static const int kSearchRandomizationToleranceFieldNumber
bool has_only_add_cuts_at_level_zero() const
optional bool only_add_cuts_at_level_zero = 92 [default = false];
void set_minimize_with_propagation_num_decisions(::google::protobuf::int32 value)
void clear_cp_model_use_sat_presolve()
void set_pseudo_cost_reliability_threshold(::google::protobuf::int64 value)
void clear_presolve_bva_threshold()
bool has_minimize_core() const
optional bool minimize_core = 50 [default = true];
static const int kCpModelProbingLevelFieldNumber
bool has_fill_tightened_domains_in_response() const
optional bool fill_tightened_domains_in_response = 132 [default = false];
void set_use_timetable_edge_finding_in_cumulative_constraint(bool value)
static const int kPresolveBveClauseWeightFieldNumber
static bool ClauseOrdering_Parse(const ::std::string &name, ClauseOrdering *value)
static const int kCoverOptimizationFieldNumber
int restart_algorithms_size() const
accessors ----------------------------------------------------—
static const int kUseBlockingRestartFieldNumber
const SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MAX
void clear_max_number_of_conflicts()
static const ::google::protobuf::EnumDescriptor * BinaryMinizationAlgorithm_descriptor()
void clear_linearization_level()
::google::protobuf::int32 clause_cleanup_target() const
static const int kAddMirCutsFieldNumber
bool has_optimize_with_max_hs() const
optional bool optimize_with_max_hs = 85 [default = false];
static const int kMipMaxBoundFieldNumber
void clear_pb_cleanup_increment()
void clear_presolve_use_bva()
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final