4 #ifndef GOOGLE_PROTOBUF_INCLUDED_ortools_2fsat_2fsat_5fparameters_2eproto 5 #define GOOGLE_PROTOBUF_INCLUDED_ortools_2fsat_2fsat_5fparameters_2eproto 10 #include <google/protobuf/port_def.inc> 11 #if PROTOBUF_VERSION < 3008000 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 3008000 < 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/generated_message_reflection.h> 31 #include <google/protobuf/message.h> 32 #include <google/protobuf/repeated_field.h> 33 #include <google/protobuf/extension_set.h> 34 #include <google/protobuf/generated_enum_reflection.h> 35 #include <google/protobuf/unknown_field_set.h> 37 #include <google/protobuf/port_def.inc> 38 #define PROTOBUF_INTERNAL_EXPORT_ortools_2fsat_2fsat_5fparameters_2eproto 39 PROTOBUF_NAMESPACE_OPEN
43 PROTOBUF_NAMESPACE_CLOSE
47 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTableField entries[]
49 static const ::PROTOBUF_NAMESPACE_ID::internal::AuxillaryParseTableField aux[]
51 static const ::PROTOBUF_NAMESPACE_ID::internal::ParseTable schema[1]
53 static const ::PROTOBUF_NAMESPACE_ID::internal::FieldMetadata
field_metadata[];
55 static const ::PROTOBUF_NAMESPACE_ID::uint32
offsets[];
61 class SatParametersDefaultTypeInternal;
65 PROTOBUF_NAMESPACE_OPEN
67 PROTOBUF_NAMESPACE_CLOSE
84 static_assert(::std::is_same<T, SatParameters_VariableOrder>::value ||
85 ::std::is_integral<T>::value,
86 "Incorrect type passed to function SatParameters_VariableOrder_Name.");
87 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
92 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_VariableOrder>(
110 static_assert(::std::is_same<T, SatParameters_Polarity>::value ||
111 ::std::is_integral<T>::value,
112 "Incorrect type passed to function SatParameters_Polarity_Name.");
113 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
118 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_Polarity>(
135 static_assert(::std::is_same<T, SatParameters_ConflictMinimizationAlgorithm>::value ||
136 ::std::is_integral<T>::value,
137 "Incorrect type passed to function SatParameters_ConflictMinimizationAlgorithm_Name.");
138 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
143 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_ConflictMinimizationAlgorithm>(
161 static_assert(::std::is_same<T, SatParameters_BinaryMinizationAlgorithm>::value ||
162 ::std::is_integral<T>::value,
163 "Incorrect type passed to function SatParameters_BinaryMinizationAlgorithm_Name.");
164 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
169 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_BinaryMinizationAlgorithm>(
185 static_assert(::std::is_same<T, SatParameters_ClauseProtection>::value ||
186 ::std::is_integral<T>::value,
187 "Incorrect type passed to function SatParameters_ClauseProtection_Name.");
188 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
193 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_ClauseProtection>(
208 static_assert(::std::is_same<T, SatParameters_ClauseOrdering>::value ||
209 ::std::is_integral<T>::value,
210 "Incorrect type passed to function SatParameters_ClauseOrdering_Name.");
211 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
216 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_ClauseOrdering>(
234 static_assert(::std::is_same<T, SatParameters_RestartAlgorithm>::value ||
235 ::std::is_integral<T>::value,
236 "Incorrect type passed to function SatParameters_RestartAlgorithm_Name.");
237 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
242 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_RestartAlgorithm>(
258 static_assert(::std::is_same<T, SatParameters_MaxSatAssumptionOrder>::value ||
259 ::std::is_integral<T>::value,
260 "Incorrect type passed to function SatParameters_MaxSatAssumptionOrder_Name.");
261 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
266 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_MaxSatAssumptionOrder>(
282 static_assert(::std::is_same<T, SatParameters_MaxSatStratificationAlgorithm>::value ||
283 ::std::is_integral<T>::value,
284 "Incorrect type passed to function SatParameters_MaxSatStratificationAlgorithm_Name.");
285 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
290 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_MaxSatStratificationAlgorithm>(
310 static_assert(::std::is_same<T, SatParameters_SearchBranching>::value ||
311 ::std::is_integral<T>::value,
312 "Incorrect type passed to function SatParameters_SearchBranching_Name.");
313 return ::PROTOBUF_NAMESPACE_ID::internal::NameOfEnum(
318 return ::PROTOBUF_NAMESPACE_ID::internal::ParseNamedEnum<SatParameters_SearchBranching>(
323 class SatParameters :
324 public ::PROTOBUF_NAMESPACE_ID::Message {
332 *
this = ::std::move(from);
340 if (GetArenaNoVirtual() == from.GetArenaNoVirtual()) {
341 if (
this != &from) InternalSwap(&from);
348 inline const ::PROTOBUF_NAMESPACE_ID::UnknownFieldSet&
unknown_fields()
const {
349 return _internal_metadata_.unknown_fields();
352 return _internal_metadata_.mutable_unknown_fields();
355 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
descriptor() {
358 static const ::PROTOBUF_NAMESPACE_ID::Descriptor*
GetDescriptor() {
359 return GetMetadataStatic().descriptor;
361 static const ::PROTOBUF_NAMESPACE_ID::Reflection*
GetReflection() {
362 return GetMetadataStatic().reflection;
368 return reinterpret_cast<const SatParameters*>(
382 return CreateMaybeMessage<SatParameters>(
nullptr);
386 return CreateMaybeMessage<SatParameters>(arena);
388 void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from)
final;
389 void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message& from)
final;
392 PROTOBUF_ATTRIBUTE_REINITIALIZES
void Clear() final;
396 #if GOOGLE_PROTOBUF_ENABLE_EXPERIMENTAL_PARSER 397 const char* _InternalParse(
const char* ptr, ::PROTOBUF_NAMESPACE_ID::internal::ParseContext* ctx)
final;
400 ::PROTOBUF_NAMESPACE_ID::io::CodedInputStream* input)
final;
401 #endif // GOOGLE_PROTOBUF_ENABLE_EXPERIMENTAL_PARSER 403 ::PROTOBUF_NAMESPACE_ID::io::CodedOutputStream* output)
const final;
405 ::PROTOBUF_NAMESPACE_ID::uint8* target)
const final;
406 int GetCachedSize() const final {
return _cached_size_.Get(); }
409 inline void SharedCtor();
410 inline void SharedDtor();
411 void SetCachedSize(
int size)
const final;
413 friend class ::PROTOBUF_NAMESPACE_ID::internal::AnyMetadata;
414 static ::PROTOBUF_NAMESPACE_ID::StringPiece FullMessageName() {
415 return "operations_research.sat.SatParameters";
418 inline ::PROTOBUF_NAMESPACE_ID::Arena* GetArenaNoVirtual()
const {
421 inline void* MaybeArenaPtr()
const {
426 ::PROTOBUF_NAMESPACE_ID::Metadata
GetMetadata() const final;
428 static ::PROTOBUF_NAMESPACE_ID::Metadata GetMetadataStatic() {
453 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
459 static_assert(::std::is_same<T, VariableOrder>::value ||
460 ::std::is_integral<T>::value,
461 "Incorrect type passed to function VariableOrder_Name.");
489 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
494 static inline const std::string&
Polarity_Name(T enum_t_value) {
495 static_assert(::std::is_same<T, Polarity>::value ||
496 ::std::is_integral<T>::value,
497 "Incorrect type passed to function Polarity_Name.");
523 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
529 static_assert(::std::is_same<T, ConflictMinimizationAlgorithm>::value ||
530 ::std::is_integral<T>::value,
531 "Incorrect type passed to function ConflictMinimizationAlgorithm_Name.");
559 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
565 static_assert(::std::is_same<T, BinaryMinizationAlgorithm>::value ||
566 ::std::is_integral<T>::value,
567 "Incorrect type passed to function BinaryMinizationAlgorithm_Name.");
591 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
597 static_assert(::std::is_same<T, ClauseProtection>::value ||
598 ::std::is_integral<T>::value,
599 "Incorrect type passed to function ClauseProtection_Name.");
621 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
627 static_assert(::std::is_same<T, ClauseOrdering>::value ||
628 ::std::is_integral<T>::value,
629 "Incorrect type passed to function ClauseOrdering_Name.");
657 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
663 static_assert(::std::is_same<T, RestartAlgorithm>::value ||
664 ::std::is_integral<T>::value,
665 "Incorrect type passed to function RestartAlgorithm_Name.");
689 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
695 static_assert(::std::is_same<T, MaxSatAssumptionOrder>::value ||
696 ::std::is_integral<T>::value,
697 "Incorrect type passed to function MaxSatAssumptionOrder_Name.");
721 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
727 static_assert(::std::is_same<T, MaxSatStratificationAlgorithm>::value ||
728 ::std::is_integral<T>::value,
729 "Incorrect type passed to function MaxSatStratificationAlgorithm_Name.");
761 static inline const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor*
767 static_assert(::std::is_same<T, SearchBranching>::value ||
768 ::std::is_integral<T>::value,
769 "Incorrect type passed to function SearchBranching_Name.");
1588 class HasBitSetters;
1590 ::PROTOBUF_NAMESPACE_ID::internal::InternalMetadataWithArena _internal_metadata_;
1591 ::PROTOBUF_NAMESPACE_ID::internal::HasBits<4> _has_bits_;
1592 mutable ::PROTOBUF_NAMESPACE_ID::internal::CachedSize _cached_size_;
1593 ::PROTOBUF_NAMESPACE_ID::RepeatedField<int> restart_algorithms_;
1597 ::PROTOBUF_NAMESPACE_ID::internal::ArenaStringPtr default_restart_algorithms_;
1598 int preferred_variable_order_;
1599 int max_sat_assumption_order_;
1600 double random_branches_ratio_;
1601 double random_polarity_ratio_;
1602 bool use_pb_resolution_;
1603 bool minimize_reduction_during_pb_resolution_;
1604 bool max_sat_reverse_assumption_order_;
1605 bool use_overload_checker_in_cumulative_constraint_;
1606 int clause_cleanup_protection_;
1607 int clause_cleanup_ordering_;
1608 bool use_erwa_heuristic_;
1609 bool also_bump_variables_in_conflict_reasons_;
1610 bool use_blocking_restart_;
1611 bool log_search_progress_;
1612 double strategy_change_increase_ratio_;
1613 ::PROTOBUF_NAMESPACE_ID::int32 num_conflicts_before_strategy_changes_;
1614 int search_branching_;
1615 double initial_variables_activity_;
1616 bool exploit_best_solution_;
1617 bool optimize_with_core_;
1618 bool optimize_with_max_hs_;
1619 bool enumerate_all_solutions_;
1620 bool use_timetable_edge_finding_in_cumulative_constraint_;
1621 bool only_add_cuts_at_level_zero_;
1622 bool add_knapsack_cuts_;
1624 ::PROTOBUF_NAMESPACE_ID::int64 search_randomization_tolerance_;
1625 double min_orthogonality_for_lp_constraints_;
1627 bool lns_focus_on_decision_variables_;
1628 bool randomize_search_;
1629 bool use_combined_no_overlap_;
1630 bool fill_tightened_domains_in_response_;
1631 bool stop_after_first_solution_;
1632 bool interleave_search_;
1633 bool deterministic_parallel_search_;
1634 ::PROTOBUF_NAMESPACE_ID::int32 mip_max_activity_exponent_;
1635 int initial_polarity_;
1636 int minimization_algorithm_;
1637 ::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_period_;
1638 ::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_target_;
1639 double variable_activity_decay_;
1640 double max_variable_activity_value_;
1641 double clause_activity_decay_;
1642 double max_clause_activity_value_;
1643 double glucose_max_decay_;
1644 double glucose_decay_increment_;
1645 ::PROTOBUF_NAMESPACE_ID::int32 glucose_decay_increment_period_;
1646 ::PROTOBUF_NAMESPACE_ID::int32 restart_period_;
1647 ::PROTOBUF_NAMESPACE_ID::int32 random_seed_;
1648 int binary_minimization_algorithm_;
1649 double max_time_in_seconds_;
1650 ::PROTOBUF_NAMESPACE_ID::int64 max_number_of_conflicts_;
1651 ::PROTOBUF_NAMESPACE_ID::int64 max_memory_in_mb_;
1652 bool use_phase_saving_;
1653 bool subsumption_during_conflict_analysis_;
1654 bool treat_binary_clauses_separately_;
1655 bool count_assumption_levels_in_lbd_;
1656 ::PROTOBUF_NAMESPACE_ID::int32 pb_cleanup_increment_;
1657 double pb_cleanup_ratio_;
1658 int max_sat_stratification_;
1659 ::PROTOBUF_NAMESPACE_ID::int32 presolve_bve_threshold_;
1660 double presolve_probing_deterministic_time_limit_;
1661 ::PROTOBUF_NAMESPACE_ID::int32 presolve_bve_clause_weight_;
1662 ::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_lbd_bound_;
1663 bool presolve_blocked_clause_;
1664 bool presolve_use_bva_;
1665 bool use_optimization_hints_;
1666 bool minimize_core_;
1667 ::PROTOBUF_NAMESPACE_ID::int32 restart_running_window_size_;
1668 double restart_dl_average_ratio_;
1669 double blocking_restart_multiplier_;
1670 double max_deterministic_time_;
1671 ::PROTOBUF_NAMESPACE_ID::int32 blocking_restart_window_size_;
1672 ::PROTOBUF_NAMESPACE_ID::int32 presolve_bva_threshold_;
1673 double restart_lbd_average_ratio_;
1674 bool find_multiple_cores_;
1675 bool cover_optimization_;
1676 bool use_precedences_in_disjunctive_constraint_;
1677 bool use_disjunctive_constraint_in_cumulative_constraint_;
1678 ::PROTOBUF_NAMESPACE_ID::int32 linearization_level_;
1679 ::PROTOBUF_NAMESPACE_ID::int32 max_num_cuts_;
1680 ::PROTOBUF_NAMESPACE_ID::int32 minimize_with_propagation_restart_period_;
1681 ::PROTOBUF_NAMESPACE_ID::int32 minimize_with_propagation_num_decisions_;
1682 ::PROTOBUF_NAMESPACE_ID::int32 binary_search_num_conflicts_;
1683 ::PROTOBUF_NAMESPACE_ID::int32 num_search_workers_;
1684 bool exploit_all_lp_solution_;
1685 bool exploit_objective_;
1686 bool cp_model_presolve_;
1687 bool cp_model_use_sat_presolve_;
1688 ::PROTOBUF_NAMESPACE_ID::int32 boolean_encoding_level_;
1689 bool instantiate_all_variables_;
1690 bool auto_detect_greater_than_at_least_one_of_;
1691 bool share_objective_bounds_;
1692 bool share_level_zero_bounds_;
1693 ::PROTOBUF_NAMESPACE_ID::int32 cp_model_probing_level_;
1695 bool use_mir_rounding_;
1696 bool add_lp_constraints_lazily_;
1697 bool exploit_integer_lp_solution_;
1698 ::PROTOBUF_NAMESPACE_ID::int32 max_integer_rounding_scaling_;
1700 bool use_optional_variables_;
1701 bool use_exact_lp_reason_;
1702 bool catch_sigint_signal_;
1703 ::PROTOBUF_NAMESPACE_ID::int64 max_inactive_count_;
1704 ::PROTOBUF_NAMESPACE_ID::int64 constraint_removal_batch_size_;
1705 ::PROTOBUF_NAMESPACE_ID::int64 pseudo_cost_reliability_threshold_;
1706 double mip_max_bound_;
1707 double mip_var_scaling_;
1708 double mip_wanted_precision_;
1709 double mip_check_precision_;
1710 friend struct ::TableStruct_ortools_2fsat_2fsat_5fparameters_2eproto;
1718 #pragma GCC diagnostic push 1719 #pragma GCC diagnostic ignored "-Wstrict-aliasing" 1725 return (_has_bits_[0] & 0x00000002u) != 0;
1728 preferred_variable_order_ = 0;
1729 _has_bits_[0] &= ~0x00000002u;
1733 return static_cast< ::operations_research::sat::SatParameters_VariableOrder >(preferred_variable_order_);
1737 _has_bits_[0] |= 0x00000002u;
1738 preferred_variable_order_ = value;
1744 return (_has_bits_[1] & 0x00000040u) != 0;
1747 initial_polarity_ = 1;
1748 _has_bits_[1] &= ~0x00000040u;
1752 return static_cast< ::operations_research::sat::SatParameters_Polarity >(initial_polarity_);
1756 _has_bits_[1] |= 0x00000040u;
1757 initial_polarity_ = value;
1763 return (_has_bits_[1] & 0x00800000u) != 0;
1766 use_phase_saving_ =
true;
1767 _has_bits_[1] &= ~0x00800000u;
1771 return use_phase_saving_;
1774 _has_bits_[1] |= 0x00800000u;
1775 use_phase_saving_ = value;
1781 return (_has_bits_[0] & 0x00000010u) != 0;
1784 random_polarity_ratio_ = 0;
1785 _has_bits_[0] &= ~0x00000010u;
1789 return random_polarity_ratio_;
1792 _has_bits_[0] |= 0x00000010u;
1793 random_polarity_ratio_ = value;
1799 return (_has_bits_[0] & 0x00000008u) != 0;
1802 random_branches_ratio_ = 0;
1803 _has_bits_[0] &= ~0x00000008u;
1807 return random_branches_ratio_;
1810 _has_bits_[0] |= 0x00000008u;
1811 random_branches_ratio_ = value;
1817 return (_has_bits_[0] & 0x00000800u) != 0;
1820 use_erwa_heuristic_ =
false;
1821 _has_bits_[0] &= ~0x00000800u;
1825 return use_erwa_heuristic_;
1828 _has_bits_[0] |= 0x00000800u;
1829 use_erwa_heuristic_ = value;
1835 return (_has_bits_[0] & 0x00040000u) != 0;
1838 initial_variables_activity_ = 0;
1839 _has_bits_[0] &= ~0x00040000u;
1843 return initial_variables_activity_;
1846 _has_bits_[0] |= 0x00040000u;
1847 initial_variables_activity_ = value;
1853 return (_has_bits_[0] & 0x00001000u) != 0;
1856 also_bump_variables_in_conflict_reasons_ =
false;
1857 _has_bits_[0] &= ~0x00001000u;
1861 return also_bump_variables_in_conflict_reasons_;
1864 _has_bits_[0] |= 0x00001000u;
1865 also_bump_variables_in_conflict_reasons_ = value;
1871 return (_has_bits_[1] & 0x00000080u) != 0;
1874 minimization_algorithm_ = 2;
1875 _has_bits_[1] &= ~0x00000080u;
1879 return static_cast< ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm >(minimization_algorithm_);
1883 _has_bits_[1] |= 0x00000080u;
1884 minimization_algorithm_ = value;
1890 return (_has_bits_[1] & 0x00080000u) != 0;
1893 binary_minimization_algorithm_ = 1;
1894 _has_bits_[1] &= ~0x00080000u;
1898 return static_cast< ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm >(binary_minimization_algorithm_);
1902 _has_bits_[1] |= 0x00080000u;
1903 binary_minimization_algorithm_ = value;
1909 return (_has_bits_[1] & 0x01000000u) != 0;
1912 subsumption_during_conflict_analysis_ =
true;
1913 _has_bits_[1] &= ~0x01000000u;
1917 return subsumption_during_conflict_analysis_;
1920 _has_bits_[1] |= 0x01000000u;
1921 subsumption_during_conflict_analysis_ = value;
1927 return (_has_bits_[1] & 0x00000100u) != 0;
1930 clause_cleanup_period_ = 10000;
1931 _has_bits_[1] &= ~0x00000100u;
1935 return clause_cleanup_period_;
1938 _has_bits_[1] |= 0x00000100u;
1939 clause_cleanup_period_ = value;
1945 return (_has_bits_[1] & 0x00000200u) != 0;
1948 clause_cleanup_target_ = 10000;
1949 _has_bits_[1] &= ~0x00000200u;
1953 return clause_cleanup_target_;
1956 _has_bits_[1] |= 0x00000200u;
1957 clause_cleanup_target_ = value;
1963 return (_has_bits_[0] & 0x00000200u) != 0;
1966 clause_cleanup_protection_ = 0;
1967 _has_bits_[0] &= ~0x00000200u;
1971 return static_cast< ::operations_research::sat::SatParameters_ClauseProtection >(clause_cleanup_protection_);
1975 _has_bits_[0] |= 0x00000200u;
1976 clause_cleanup_protection_ = value;
1982 return (_has_bits_[2] & 0x00000002u) != 0;
1985 clause_cleanup_lbd_bound_ = 5;
1986 _has_bits_[2] &= ~0x00000002u;
1990 return clause_cleanup_lbd_bound_;
1993 _has_bits_[2] |= 0x00000002u;
1994 clause_cleanup_lbd_bound_ = value;
2000 return (_has_bits_[0] & 0x00000400u) != 0;
2003 clause_cleanup_ordering_ = 0;
2004 _has_bits_[0] &= ~0x00000400u;
2008 return static_cast< ::operations_research::sat::SatParameters_ClauseOrdering >(clause_cleanup_ordering_);
2012 _has_bits_[0] |= 0x00000400u;
2013 clause_cleanup_ordering_ = value;
2019 return (_has_bits_[1] & 0x08000000u) != 0;
2022 pb_cleanup_increment_ = 200;
2023 _has_bits_[1] &= ~0x08000000u;
2027 return pb_cleanup_increment_;
2030 _has_bits_[1] |= 0x08000000u;
2031 pb_cleanup_increment_ = value;
2037 return (_has_bits_[1] & 0x10000000u) != 0;
2040 pb_cleanup_ratio_ = 0.5;
2041 _has_bits_[1] &= ~0x10000000u;
2045 return pb_cleanup_ratio_;
2048 _has_bits_[1] |= 0x10000000u;
2049 pb_cleanup_ratio_ = value;
2055 return (_has_bits_[2] & 0x00080000u) != 0;
2058 minimize_with_propagation_restart_period_ = 10;
2059 _has_bits_[2] &= ~0x00080000u;
2063 return minimize_with_propagation_restart_period_;
2066 _has_bits_[2] |= 0x00080000u;
2067 minimize_with_propagation_restart_period_ = value;
2073 return (_has_bits_[2] & 0x00100000u) != 0;
2076 minimize_with_propagation_num_decisions_ = 1000;
2077 _has_bits_[2] &= ~0x00100000u;
2081 return minimize_with_propagation_num_decisions_;
2084 _has_bits_[2] |= 0x00100000u;
2085 minimize_with_propagation_num_decisions_ = value;
2091 return (_has_bits_[1] & 0x00000400u) != 0;
2094 variable_activity_decay_ = 0.8;
2095 _has_bits_[1] &= ~0x00000400u;
2099 return variable_activity_decay_;
2102 _has_bits_[1] |= 0x00000400u;
2103 variable_activity_decay_ = value;
2109 return (_has_bits_[1] & 0x00000800u) != 0;
2112 max_variable_activity_value_ = 1e+100;
2113 _has_bits_[1] &= ~0x00000800u;
2117 return max_variable_activity_value_;
2120 _has_bits_[1] |= 0x00000800u;
2121 max_variable_activity_value_ = value;
2127 return (_has_bits_[1] & 0x00004000u) != 0;
2130 glucose_max_decay_ = 0.95;
2131 _has_bits_[1] &= ~0x00004000u;
2135 return glucose_max_decay_;
2138 _has_bits_[1] |= 0x00004000u;
2139 glucose_max_decay_ = value;
2145 return (_has_bits_[1] & 0x00008000u) != 0;
2148 glucose_decay_increment_ = 0.01;
2149 _has_bits_[1] &= ~0x00008000u;
2153 return glucose_decay_increment_;
2156 _has_bits_[1] |= 0x00008000u;
2157 glucose_decay_increment_ = value;
2163 return (_has_bits_[1] & 0x00010000u) != 0;
2166 glucose_decay_increment_period_ = 5000;
2167 _has_bits_[1] &= ~0x00010000u;
2171 return glucose_decay_increment_period_;
2174 _has_bits_[1] |= 0x00010000u;
2175 glucose_decay_increment_period_ = value;
2181 return (_has_bits_[1] & 0x00001000u) != 0;
2184 clause_activity_decay_ = 0.999;
2185 _has_bits_[1] &= ~0x00001000u;
2189 return clause_activity_decay_;
2192 _has_bits_[1] |= 0x00001000u;
2193 clause_activity_decay_ = value;
2199 return (_has_bits_[1] & 0x00002000u) != 0;
2202 max_clause_activity_value_ = 1e+20;
2203 _has_bits_[1] &= ~0x00002000u;
2207 return max_clause_activity_value_;
2210 _has_bits_[1] |= 0x00002000u;
2211 max_clause_activity_value_ = value;
2217 return restart_algorithms_.size();
2220 restart_algorithms_.Clear();
2224 return static_cast< ::operations_research::sat::SatParameters_RestartAlgorithm >(restart_algorithms_.Get(index));
2228 restart_algorithms_.Set(index, value);
2233 restart_algorithms_.Add(value);
2236 inline const ::PROTOBUF_NAMESPACE_ID::RepeatedField<int>&
2239 return restart_algorithms_;
2241 inline ::PROTOBUF_NAMESPACE_ID::RepeatedField<int>*
2244 return &restart_algorithms_;
2249 return (_has_bits_[0] & 0x00000001u) != 0;
2253 _has_bits_[0] &= ~0x00000001u;
2257 return default_restart_algorithms_.GetNoArena();
2260 _has_bits_[0] |= 0x00000001u;
2265 _has_bits_[0] |= 0x00000001u;
2266 default_restart_algorithms_.SetNoArena(
2271 GOOGLE_DCHECK(value !=
nullptr);
2272 _has_bits_[0] |= 0x00000001u;
2277 _has_bits_[0] |= 0x00000001u;
2279 ::std::string(reinterpret_cast<const char*>(value), size));
2283 _has_bits_[0] |= 0x00000001u;
2292 _has_bits_[0] &= ~0x00000001u;
2297 _has_bits_[0] |= 0x00000001u;
2299 _has_bits_[0] &= ~0x00000001u;
2307 return (_has_bits_[1] & 0x00020000u) != 0;
2310 restart_period_ = 50;
2311 _has_bits_[1] &= ~0x00020000u;
2315 return restart_period_;
2318 _has_bits_[1] |= 0x00020000u;
2319 restart_period_ = value;
2325 return (_has_bits_[2] & 0x00000040u) != 0;
2328 restart_running_window_size_ = 50;
2329 _has_bits_[2] &= ~0x00000040u;
2333 return restart_running_window_size_;
2336 _has_bits_[2] |= 0x00000040u;
2337 restart_running_window_size_ = value;
2343 return (_has_bits_[2] & 0x00000080u) != 0;
2346 restart_dl_average_ratio_ = 1;
2347 _has_bits_[2] &= ~0x00000080u;
2351 return restart_dl_average_ratio_;
2354 _has_bits_[2] |= 0x00000080u;
2355 restart_dl_average_ratio_ = value;
2361 return (_has_bits_[2] & 0x00001000u) != 0;
2364 restart_lbd_average_ratio_ = 1;
2365 _has_bits_[2] &= ~0x00001000u;
2369 return restart_lbd_average_ratio_;
2372 _has_bits_[2] |= 0x00001000u;
2373 restart_lbd_average_ratio_ = value;
2379 return (_has_bits_[0] & 0x00002000u) != 0;
2382 use_blocking_restart_ =
false;
2383 _has_bits_[0] &= ~0x00002000u;
2387 return use_blocking_restart_;
2390 _has_bits_[0] |= 0x00002000u;
2391 use_blocking_restart_ = value;
2397 return (_has_bits_[2] & 0x00000400u) != 0;
2400 blocking_restart_window_size_ = 5000;
2401 _has_bits_[2] &= ~0x00000400u;
2405 return blocking_restart_window_size_;
2408 _has_bits_[2] |= 0x00000400u;
2409 blocking_restart_window_size_ = value;
2415 return (_has_bits_[2] & 0x00000100u) != 0;
2418 blocking_restart_multiplier_ = 1.4;
2419 _has_bits_[2] &= ~0x00000100u;
2423 return blocking_restart_multiplier_;
2426 _has_bits_[2] |= 0x00000100u;
2427 blocking_restart_multiplier_ = value;
2433 return (_has_bits_[0] & 0x00010000u) != 0;
2436 num_conflicts_before_strategy_changes_ = 0;
2437 _has_bits_[0] &= ~0x00010000u;
2441 return num_conflicts_before_strategy_changes_;
2444 _has_bits_[0] |= 0x00010000u;
2445 num_conflicts_before_strategy_changes_ = value;
2451 return (_has_bits_[0] & 0x00008000u) != 0;
2454 strategy_change_increase_ratio_ = 0;
2455 _has_bits_[0] &= ~0x00008000u;
2459 return strategy_change_increase_ratio_;
2462 _has_bits_[0] |= 0x00008000u;
2463 strategy_change_increase_ratio_ = value;
2469 return (_has_bits_[1] & 0x00100000u) != 0;
2472 max_time_in_seconds_ = std::numeric_limits<double>::infinity();
2473 _has_bits_[1] &= ~0x00100000u;
2477 return max_time_in_seconds_;
2480 _has_bits_[1] |= 0x00100000u;
2481 max_time_in_seconds_ = value;
2487 return (_has_bits_[2] & 0x00000200u) != 0;
2490 max_deterministic_time_ = std::numeric_limits<double>::infinity();
2491 _has_bits_[2] &= ~0x00000200u;
2495 return max_deterministic_time_;
2498 _has_bits_[2] |= 0x00000200u;
2499 max_deterministic_time_ = value;
2505 return (_has_bits_[1] & 0x00200000u) != 0;
2508 max_number_of_conflicts_ = PROTOBUF_LONGLONG(9223372036854775807);
2509 _has_bits_[1] &= ~0x00200000u;
2513 return max_number_of_conflicts_;
2516 _has_bits_[1] |= 0x00200000u;
2517 max_number_of_conflicts_ = value;
2523 return (_has_bits_[1] & 0x00400000u) != 0;
2526 max_memory_in_mb_ = PROTOBUF_LONGLONG(10000);
2527 _has_bits_[1] &= ~0x00400000u;
2531 return max_memory_in_mb_;
2534 _has_bits_[1] |= 0x00400000u;
2535 max_memory_in_mb_ = value;
2541 return (_has_bits_[1] & 0x02000000u) != 0;
2544 treat_binary_clauses_separately_ =
true;
2545 _has_bits_[1] &= ~0x02000000u;
2549 return treat_binary_clauses_separately_;
2552 _has_bits_[1] |= 0x02000000u;
2553 treat_binary_clauses_separately_ = value;
2559 return (_has_bits_[1] & 0x00040000u) != 0;
2563 _has_bits_[1] &= ~0x00040000u;
2567 return random_seed_;
2570 _has_bits_[1] |= 0x00040000u;
2571 random_seed_ = value;
2577 return (_has_bits_[0] & 0x00004000u) != 0;
2580 log_search_progress_ =
false;
2581 _has_bits_[0] &= ~0x00004000u;
2585 return log_search_progress_;
2588 _has_bits_[0] |= 0x00004000u;
2589 log_search_progress_ = value;
2595 return (_has_bits_[0] & 0x00000020u) != 0;
2598 use_pb_resolution_ =
false;
2599 _has_bits_[0] &= ~0x00000020u;
2603 return use_pb_resolution_;
2606 _has_bits_[0] |= 0x00000020u;
2607 use_pb_resolution_ = value;
2613 return (_has_bits_[0] & 0x00000040u) != 0;
2616 minimize_reduction_during_pb_resolution_ =
false;
2617 _has_bits_[0] &= ~0x00000040u;
2621 return minimize_reduction_during_pb_resolution_;
2624 _has_bits_[0] |= 0x00000040u;
2625 minimize_reduction_during_pb_resolution_ = value;
2631 return (_has_bits_[1] & 0x04000000u) != 0;
2634 count_assumption_levels_in_lbd_ =
true;
2635 _has_bits_[1] &= ~0x04000000u;
2639 return count_assumption_levels_in_lbd_;
2642 _has_bits_[1] |= 0x04000000u;
2643 count_assumption_levels_in_lbd_ = value;
2649 return (_has_bits_[1] & 0x40000000u) != 0;
2652 presolve_bve_threshold_ = 500;
2653 _has_bits_[1] &= ~0x40000000u;
2657 return presolve_bve_threshold_;
2660 _has_bits_[1] |= 0x40000000u;
2661 presolve_bve_threshold_ = value;
2667 return (_has_bits_[2] & 0x00000001u) != 0;
2670 presolve_bve_clause_weight_ = 3;
2671 _has_bits_[2] &= ~0x00000001u;
2675 return presolve_bve_clause_weight_;
2678 _has_bits_[2] |= 0x00000001u;
2679 presolve_bve_clause_weight_ = value;
2685 return (_has_bits_[1] & 0x80000000u) != 0;
2688 presolve_probing_deterministic_time_limit_ = 30;
2689 _has_bits_[1] &= ~0x80000000u;
2693 return presolve_probing_deterministic_time_limit_;
2696 _has_bits_[1] |= 0x80000000u;
2697 presolve_probing_deterministic_time_limit_ = value;
2703 return (_has_bits_[2] & 0x00000004u) != 0;
2706 presolve_blocked_clause_ =
true;
2707 _has_bits_[2] &= ~0x00000004u;
2711 return presolve_blocked_clause_;
2714 _has_bits_[2] |= 0x00000004u;
2715 presolve_blocked_clause_ = value;
2721 return (_has_bits_[2] & 0x00000008u) != 0;
2724 presolve_use_bva_ =
true;
2725 _has_bits_[2] &= ~0x00000008u;
2729 return presolve_use_bva_;
2732 _has_bits_[2] |= 0x00000008u;
2733 presolve_use_bva_ = value;
2739 return (_has_bits_[2] & 0x00000800u) != 0;
2742 presolve_bva_threshold_ = 1;
2743 _has_bits_[2] &= ~0x00000800u;
2747 return presolve_bva_threshold_;
2750 _has_bits_[2] |= 0x00000800u;
2751 presolve_bva_threshold_ = value;
2757 return (_has_bits_[2] & 0x00000010u) != 0;
2760 use_optimization_hints_ =
true;
2761 _has_bits_[2] &= ~0x00000010u;
2765 return use_optimization_hints_;
2768 _has_bits_[2] |= 0x00000010u;
2769 use_optimization_hints_ = value;
2775 return (_has_bits_[2] & 0x00000020u) != 0;
2778 minimize_core_ =
true;
2779 _has_bits_[2] &= ~0x00000020u;
2783 return minimize_core_;
2786 _has_bits_[2] |= 0x00000020u;
2787 minimize_core_ = value;
2793 return (_has_bits_[2] & 0x00002000u) != 0;
2796 find_multiple_cores_ =
true;
2797 _has_bits_[2] &= ~0x00002000u;
2801 return find_multiple_cores_;
2804 _has_bits_[2] |= 0x00002000u;
2805 find_multiple_cores_ = value;
2811 return (_has_bits_[2] & 0x00004000u) != 0;
2814 cover_optimization_ =
true;
2815 _has_bits_[2] &= ~0x00004000u;
2819 return cover_optimization_;
2822 _has_bits_[2] |= 0x00004000u;
2823 cover_optimization_ = value;
2829 return (_has_bits_[0] & 0x00000004u) != 0;
2832 max_sat_assumption_order_ = 0;
2833 _has_bits_[0] &= ~0x00000004u;
2837 return static_cast< ::operations_research::sat::SatParameters_MaxSatAssumptionOrder >(max_sat_assumption_order_);
2841 _has_bits_[0] |= 0x00000004u;
2842 max_sat_assumption_order_ = value;
2848 return (_has_bits_[0] & 0x00000080u) != 0;
2851 max_sat_reverse_assumption_order_ =
false;
2852 _has_bits_[0] &= ~0x00000080u;
2856 return max_sat_reverse_assumption_order_;
2859 _has_bits_[0] |= 0x00000080u;
2860 max_sat_reverse_assumption_order_ = value;
2866 return (_has_bits_[1] & 0x20000000u) != 0;
2869 max_sat_stratification_ = 1;
2870 _has_bits_[1] &= ~0x20000000u;
2874 return static_cast< ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm >(max_sat_stratification_);
2878 _has_bits_[1] |= 0x20000000u;
2879 max_sat_stratification_ = value;
2885 return (_has_bits_[2] & 0x00008000u) != 0;
2888 use_precedences_in_disjunctive_constraint_ =
true;
2889 _has_bits_[2] &= ~0x00008000u;
2893 return use_precedences_in_disjunctive_constraint_;
2896 _has_bits_[2] |= 0x00008000u;
2897 use_precedences_in_disjunctive_constraint_ = value;
2903 return (_has_bits_[0] & 0x00000100u) != 0;
2906 use_overload_checker_in_cumulative_constraint_ =
false;
2907 _has_bits_[0] &= ~0x00000100u;
2911 return use_overload_checker_in_cumulative_constraint_;
2914 _has_bits_[0] |= 0x00000100u;
2915 use_overload_checker_in_cumulative_constraint_ = value;
2921 return (_has_bits_[0] & 0x00800000u) != 0;
2924 use_timetable_edge_finding_in_cumulative_constraint_ =
false;
2925 _has_bits_[0] &= ~0x00800000u;
2929 return use_timetable_edge_finding_in_cumulative_constraint_;
2932 _has_bits_[0] |= 0x00800000u;
2933 use_timetable_edge_finding_in_cumulative_constraint_ = value;
2939 return (_has_bits_[2] & 0x00010000u) != 0;
2942 use_disjunctive_constraint_in_cumulative_constraint_ =
true;
2943 _has_bits_[2] &= ~0x00010000u;
2947 return use_disjunctive_constraint_in_cumulative_constraint_;
2950 _has_bits_[2] |= 0x00010000u;
2951 use_disjunctive_constraint_in_cumulative_constraint_ = value;
2957 return (_has_bits_[2] & 0x00020000u) != 0;
2960 linearization_level_ = 1;
2961 _has_bits_[2] &= ~0x00020000u;
2965 return linearization_level_;
2968 _has_bits_[2] |= 0x00020000u;
2969 linearization_level_ = value;
2975 return (_has_bits_[2] & 0x08000000u) != 0;
2978 boolean_encoding_level_ = 1;
2979 _has_bits_[2] &= ~0x08000000u;
2983 return boolean_encoding_level_;
2986 _has_bits_[2] |= 0x08000000u;
2987 boolean_encoding_level_ = value;
2993 return (_has_bits_[2] & 0x00040000u) != 0;
2996 max_num_cuts_ = 5000;
2997 _has_bits_[2] &= ~0x00040000u;
3001 return max_num_cuts_;
3004 _has_bits_[2] |= 0x00040000u;
3005 max_num_cuts_ = value;
3011 return (_has_bits_[0] & 0x01000000u) != 0;
3014 only_add_cuts_at_level_zero_ =
false;
3015 _has_bits_[0] &= ~0x01000000u;
3019 return only_add_cuts_at_level_zero_;
3022 _has_bits_[0] |= 0x01000000u;
3023 only_add_cuts_at_level_zero_ = value;
3029 return (_has_bits_[0] & 0x02000000u) != 0;
3032 add_knapsack_cuts_ =
false;
3033 _has_bits_[0] &= ~0x02000000u;
3037 return add_knapsack_cuts_;
3040 _has_bits_[0] |= 0x02000000u;
3041 add_knapsack_cuts_ = value;
3047 return (_has_bits_[0] & 0x04000000u) != 0;
3050 add_cg_cuts_ =
false;
3051 _has_bits_[0] &= ~0x04000000u;
3055 return add_cg_cuts_;
3058 _has_bits_[0] |= 0x04000000u;
3059 add_cg_cuts_ = value;
3065 return (_has_bits_[3] & 0x00000002u) != 0;
3068 add_mir_cuts_ =
true;
3069 _has_bits_[3] &= ~0x00000002u;
3073 return add_mir_cuts_;
3076 _has_bits_[3] |= 0x00000002u;
3077 add_mir_cuts_ = value;
3083 return (_has_bits_[3] & 0x00000004u) != 0;
3086 use_mir_rounding_ =
true;
3087 _has_bits_[3] &= ~0x00000004u;
3091 return use_mir_rounding_;
3094 _has_bits_[3] |= 0x00000004u;
3095 use_mir_rounding_ = value;
3101 return (_has_bits_[3] & 0x00000020u) != 0;
3104 max_integer_rounding_scaling_ = 600;
3105 _has_bits_[3] &= ~0x00000020u;
3109 return max_integer_rounding_scaling_;
3112 _has_bits_[3] |= 0x00000020u;
3113 max_integer_rounding_scaling_ = value;
3119 return (_has_bits_[3] & 0x00000008u) != 0;
3122 add_lp_constraints_lazily_ =
true;
3123 _has_bits_[3] &= ~0x00000008u;
3127 return add_lp_constraints_lazily_;
3130 _has_bits_[3] |= 0x00000008u;
3131 add_lp_constraints_lazily_ = value;
3137 return (_has_bits_[0] & 0x10000000u) != 0;
3140 min_orthogonality_for_lp_constraints_ = 0;
3141 _has_bits_[0] &= ~0x10000000u;
3145 return min_orthogonality_for_lp_constraints_;
3148 _has_bits_[0] |= 0x10000000u;
3149 min_orthogonality_for_lp_constraints_ = value;
3155 return (_has_bits_[3] & 0x00000400u) != 0;
3158 max_inactive_count_ = PROTOBUF_LONGLONG(1000);
3159 _has_bits_[3] &= ~0x00000400u;
3163 return max_inactive_count_;
3166 _has_bits_[3] |= 0x00000400u;
3167 max_inactive_count_ = value;
3173 return (_has_bits_[3] & 0x00000800u) != 0;
3176 constraint_removal_batch_size_ = PROTOBUF_LONGLONG(100);
3177 _has_bits_[3] &= ~0x00000800u;
3181 return constraint_removal_batch_size_;
3184 _has_bits_[3] |= 0x00000800u;
3185 constraint_removal_batch_size_ = value;
3191 return (_has_bits_[0] & 0x00020000u) != 0;
3194 search_branching_ = 0;
3195 _has_bits_[0] &= ~0x00020000u;
3199 return static_cast< ::operations_research::sat::SatParameters_SearchBranching >(search_branching_);
3203 _has_bits_[0] |= 0x00020000u;
3204 search_branching_ = value;
3210 return (_has_bits_[3] & 0x00000010u) != 0;
3213 exploit_integer_lp_solution_ =
true;
3214 _has_bits_[3] &= ~0x00000010u;
3218 return exploit_integer_lp_solution_;
3221 _has_bits_[3] |= 0x00000010u;
3222 exploit_integer_lp_solution_ = value;
3228 return (_has_bits_[2] & 0x00800000u) != 0;
3231 exploit_all_lp_solution_ =
true;
3232 _has_bits_[2] &= ~0x00800000u;
3236 return exploit_all_lp_solution_;
3239 _has_bits_[2] |= 0x00800000u;
3240 exploit_all_lp_solution_ = value;
3246 return (_has_bits_[0] & 0x00080000u) != 0;
3249 exploit_best_solution_ =
false;
3250 _has_bits_[0] &= ~0x00080000u;
3254 return exploit_best_solution_;
3257 _has_bits_[0] |= 0x00080000u;
3258 exploit_best_solution_ = value;
3264 return (_has_bits_[2] & 0x01000000u) != 0;
3267 exploit_objective_ =
true;
3268 _has_bits_[2] &= ~0x01000000u;
3272 return exploit_objective_;
3275 _has_bits_[2] |= 0x01000000u;
3276 exploit_objective_ = value;
3282 return (_has_bits_[3] & 0x00001000u) != 0;
3285 pseudo_cost_reliability_threshold_ = PROTOBUF_LONGLONG(100);
3286 _has_bits_[3] &= ~0x00001000u;
3290 return pseudo_cost_reliability_threshold_;
3293 _has_bits_[3] |= 0x00001000u;
3294 pseudo_cost_reliability_threshold_ = value;
3300 return (_has_bits_[0] & 0x00100000u) != 0;
3303 optimize_with_core_ =
false;
3304 _has_bits_[0] &= ~0x00100000u;
3308 return optimize_with_core_;
3311 _has_bits_[0] |= 0x00100000u;
3312 optimize_with_core_ = value;
3318 return (_has_bits_[2] & 0x00200000u) != 0;
3321 binary_search_num_conflicts_ = -1;
3322 _has_bits_[2] &= ~0x00200000u;
3326 return binary_search_num_conflicts_;
3329 _has_bits_[2] |= 0x00200000u;
3330 binary_search_num_conflicts_ = value;
3336 return (_has_bits_[0] & 0x00200000u) != 0;
3339 optimize_with_max_hs_ =
false;
3340 _has_bits_[0] &= ~0x00200000u;
3344 return optimize_with_max_hs_;
3347 _has_bits_[0] |= 0x00200000u;
3348 optimize_with_max_hs_ = value;
3354 return (_has_bits_[2] & 0x02000000u) != 0;
3357 cp_model_presolve_ =
true;
3358 _has_bits_[2] &= ~0x02000000u;
3362 return cp_model_presolve_;
3365 _has_bits_[2] |= 0x02000000u;
3366 cp_model_presolve_ = value;
3372 return (_has_bits_[3] & 0x00000001u) != 0;
3375 cp_model_probing_level_ = 2;
3376 _has_bits_[3] &= ~0x00000001u;
3380 return cp_model_probing_level_;
3383 _has_bits_[3] |= 0x00000001u;
3384 cp_model_probing_level_ = value;
3390 return (_has_bits_[2] & 0x04000000u) != 0;
3393 cp_model_use_sat_presolve_ =
true;
3394 _has_bits_[2] &= ~0x04000000u;
3398 return cp_model_use_sat_presolve_;
3401 _has_bits_[2] |= 0x04000000u;
3402 cp_model_use_sat_presolve_ = value;
3408 return (_has_bits_[0] & 0x00400000u) != 0;
3411 enumerate_all_solutions_ =
false;
3412 _has_bits_[0] &= ~0x00400000u;
3416 return enumerate_all_solutions_;
3419 _has_bits_[0] |= 0x00400000u;
3420 enumerate_all_solutions_ = value;
3426 return (_has_bits_[1] & 0x00000002u) != 0;
3429 fill_tightened_domains_in_response_ =
false;
3430 _has_bits_[1] &= ~0x00000002u;
3434 return fill_tightened_domains_in_response_;
3437 _has_bits_[1] |= 0x00000002u;
3438 fill_tightened_domains_in_response_ = value;
3444 return (_has_bits_[2] & 0x10000000u) != 0;
3447 instantiate_all_variables_ =
true;
3448 _has_bits_[2] &= ~0x10000000u;
3452 return instantiate_all_variables_;
3455 _has_bits_[2] |= 0x10000000u;
3456 instantiate_all_variables_ = value;
3462 return (_has_bits_[2] & 0x20000000u) != 0;
3465 auto_detect_greater_than_at_least_one_of_ =
true;
3466 _has_bits_[2] &= ~0x20000000u;
3470 return auto_detect_greater_than_at_least_one_of_;
3473 _has_bits_[2] |= 0x20000000u;
3474 auto_detect_greater_than_at_least_one_of_ = value;
3480 return (_has_bits_[1] & 0x00000004u) != 0;
3483 stop_after_first_solution_ =
false;
3484 _has_bits_[1] &= ~0x00000004u;
3488 return stop_after_first_solution_;
3491 _has_bits_[1] |= 0x00000004u;
3492 stop_after_first_solution_ = value;
3498 return (_has_bits_[2] & 0x00400000u) != 0;
3501 num_search_workers_ = 1;
3502 _has_bits_[2] &= ~0x00400000u;
3506 return num_search_workers_;
3509 _has_bits_[2] |= 0x00400000u;
3510 num_search_workers_ = value;
3516 return (_has_bits_[1] & 0x00000008u) != 0;
3519 interleave_search_ =
false;
3520 _has_bits_[1] &= ~0x00000008u;
3524 return interleave_search_;
3527 _has_bits_[1] |= 0x00000008u;
3528 interleave_search_ = value;
3534 return (_has_bits_[1] & 0x00000010u) != 0;
3537 deterministic_parallel_search_ =
false;
3538 _has_bits_[1] &= ~0x00000010u;
3542 return deterministic_parallel_search_;
3545 _has_bits_[1] |= 0x00000010u;
3546 deterministic_parallel_search_ = value;
3552 return (_has_bits_[2] & 0x40000000u) != 0;
3555 share_objective_bounds_ =
true;
3556 _has_bits_[2] &= ~0x40000000u;
3560 return share_objective_bounds_;
3563 _has_bits_[2] |= 0x40000000u;
3564 share_objective_bounds_ = value;
3570 return (_has_bits_[2] & 0x80000000u) != 0;
3573 share_level_zero_bounds_ =
true;
3574 _has_bits_[2] &= ~0x80000000u;
3578 return share_level_zero_bounds_;
3581 _has_bits_[2] |= 0x80000000u;
3582 share_level_zero_bounds_ = value;
3588 return (_has_bits_[0] & 0x20000000u) != 0;
3591 use_lns_only_ =
false;
3592 _has_bits_[0] &= ~0x20000000u;
3596 return use_lns_only_;
3599 _has_bits_[0] |= 0x20000000u;
3600 use_lns_only_ = value;
3606 return (_has_bits_[0] & 0x40000000u) != 0;
3609 lns_focus_on_decision_variables_ =
false;
3610 _has_bits_[0] &= ~0x40000000u;
3614 return lns_focus_on_decision_variables_;
3617 _has_bits_[0] |= 0x40000000u;
3618 lns_focus_on_decision_variables_ = value;
3624 return (_has_bits_[3] & 0x00000040u) != 0;
3627 use_rins_lns_ =
true;
3628 _has_bits_[3] &= ~0x00000040u;
3632 return use_rins_lns_;
3635 _has_bits_[3] |= 0x00000040u;
3636 use_rins_lns_ = value;
3642 return (_has_bits_[0] & 0x80000000u) != 0;
3645 randomize_search_ =
false;
3646 _has_bits_[0] &= ~0x80000000u;
3650 return randomize_search_;
3653 _has_bits_[0] |= 0x80000000u;
3654 randomize_search_ = value;
3660 return (_has_bits_[0] & 0x08000000u) != 0;
3663 search_randomization_tolerance_ = PROTOBUF_LONGLONG(0);
3664 _has_bits_[0] &= ~0x08000000u;
3668 return search_randomization_tolerance_;
3671 _has_bits_[0] |= 0x08000000u;
3672 search_randomization_tolerance_ = value;
3678 return (_has_bits_[3] & 0x00000080u) != 0;
3681 use_optional_variables_ =
true;
3682 _has_bits_[3] &= ~0x00000080u;
3686 return use_optional_variables_;
3689 _has_bits_[3] |= 0x00000080u;
3690 use_optional_variables_ = value;
3696 return (_has_bits_[3] & 0x00000100u) != 0;
3699 use_exact_lp_reason_ =
true;
3700 _has_bits_[3] &= ~0x00000100u;
3704 return use_exact_lp_reason_;
3707 _has_bits_[3] |= 0x00000100u;
3708 use_exact_lp_reason_ = value;
3714 return (_has_bits_[1] & 0x00000001u) != 0;
3717 use_combined_no_overlap_ =
false;
3718 _has_bits_[1] &= ~0x00000001u;
3722 return use_combined_no_overlap_;
3725 _has_bits_[1] |= 0x00000001u;
3726 use_combined_no_overlap_ = value;
3732 return (_has_bits_[3] & 0x00002000u) != 0;
3735 mip_max_bound_ = 10000000;
3736 _has_bits_[3] &= ~0x00002000u;
3740 return mip_max_bound_;
3743 _has_bits_[3] |= 0x00002000u;
3744 mip_max_bound_ = value;
3750 return (_has_bits_[3] & 0x00004000u) != 0;
3753 mip_var_scaling_ = 1;
3754 _has_bits_[3] &= ~0x00004000u;
3758 return mip_var_scaling_;
3761 _has_bits_[3] |= 0x00004000u;
3762 mip_var_scaling_ = value;
3768 return (_has_bits_[3] & 0x00008000u) != 0;
3771 mip_wanted_precision_ = 1e-06;
3772 _has_bits_[3] &= ~0x00008000u;
3776 return mip_wanted_precision_;
3779 _has_bits_[3] |= 0x00008000u;
3780 mip_wanted_precision_ = value;
3786 return (_has_bits_[1] & 0x00000020u) != 0;
3789 mip_max_activity_exponent_ = 53;
3790 _has_bits_[1] &= ~0x00000020u;
3794 return mip_max_activity_exponent_;
3797 _has_bits_[1] |= 0x00000020u;
3798 mip_max_activity_exponent_ = value;
3804 return (_has_bits_[3] & 0x00010000u) != 0;
3807 mip_check_precision_ = 0.0001;
3808 _has_bits_[3] &= ~0x00010000u;
3812 return mip_check_precision_;
3815 _has_bits_[3] |= 0x00010000u;
3816 mip_check_precision_ = value;
3822 return (_has_bits_[3] & 0x00000200u) != 0;
3825 catch_sigint_signal_ =
true;
3826 _has_bits_[3] &= ~0x00000200u;
3830 return catch_sigint_signal_;
3833 _has_bits_[3] |= 0x00000200u;
3834 catch_sigint_signal_ = value;
3839 #pragma GCC diagnostic pop 3847 PROTOBUF_NAMESPACE_OPEN
3851 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_VariableOrder>() {
3856 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_Polarity>() {
3861 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ConflictMinimizationAlgorithm>() {
3866 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_BinaryMinizationAlgorithm>() {
3871 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ClauseProtection>() {
3876 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_ClauseOrdering>() {
3881 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_RestartAlgorithm>() {
3886 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_MaxSatAssumptionOrder>() {
3891 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm>() {
3896 inline const EnumDescriptor* GetEnumDescriptor< ::operations_research::sat::SatParameters_SearchBranching>() {
3900 PROTOBUF_NAMESPACE_CLOSE
3904 #include <google/protobuf/port_undef.inc> 3905 #endif // GOOGLE_PROTOBUF_INCLUDED_GOOGLE_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 clear_catch_sigint_signal()
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()
static constexpr ClauseOrdering ClauseOrdering_MAX
::PROTOBUF_NAMESPACE_ID::int32 minimize_with_propagation_restart_period() const
::PROTOBUF_NAMESPACE_ID::int32 presolve_bve_clause_weight() const
static constexpr SearchBranching FIXED_SEARCH
void set_restart_running_window_size(::PROTOBUF_NAMESPACE_ID::int32 value)
::PROTOBUF_NAMESPACE_ID::int32 restart_period() const
void clear_minimize_with_propagation_restart_period()
void clear_cp_model_presolve()
void set_mip_max_activity_exponent(::PROTOBUF_NAMESPACE_ID::int32 value)
void clear_glucose_decay_increment()
static constexpr ClauseProtection ClauseProtection_MAX
void set_min_orthogonality_for_lp_constraints(double value)
static constexpr ConflictMinimizationAlgorithm EXPERIMENTAL
bool has_add_mir_cuts() const
optional bool add_mir_cuts = 120 [default = true];
void set_restart_period(::PROTOBUF_NAMESPACE_ID::int32 value)
void set_clause_cleanup_ordering(::operations_research::sat::SatParameters_ClauseOrdering value)
bool optimize_with_max_hs() const
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_MaxSatAssumptionOrder_descriptor()
bool has_max_deterministic_time() const
optional double max_deterministic_time = 67 [default = inf];
bool has_use_lns_only() const
optional bool use_lns_only = 101 [default = false];
SatParameters_ClauseProtection
static const int kBooleanEncodingLevelFieldNumber
::PROTOBUF_NAMESPACE_ID::int64 max_memory_in_mb() const
::PROTOBUF_NAMESPACE_ID::int32 max_integer_rounding_scaling() const
void set_clause_cleanup_lbd_bound(::PROTOBUF_NAMESPACE_ID::int32 value)
constexpr int SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_ARRAYSIZE
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST_WITH_TRANSITIVE_REDUCTION
static const int kMipMaxActivityExponentFieldNumber
static bool Polarity_IsValid(int value)
static const int kCpModelUseSatPresolveFieldNumber
::PROTOBUF_NAMESPACE_ID::int32 blocking_restart_window_size() const
void set_use_pb_resolution(bool value)
const ::PROTOBUF_NAMESPACE_ID::UnknownFieldSet & unknown_fields() const
void set_mip_wanted_precision(double value)
bool cover_optimization() const
static const int kInterleaveSearchFieldNumber
::PROTOBUF_NAMESPACE_ID::int32 num_search_workers() const
static const int kUsePbResolutionFieldNumber
::operations_research::sat::SatParameters_BinaryMinizationAlgorithm binary_minimization_algorithm() const
static constexpr ConflictMinimizationAlgorithm RECURSIVE
void clear_count_assumption_levels_in_lbd()
void clear_clause_cleanup_lbd_bound()
static const int kUseLnsOnlyFieldNumber
::PROTOBUF_NAMESPACE_ID::int32 max_num_cuts() const
static const int kMaxInactiveCountFieldNumber
void clear_pseudo_cost_reliability_threshold()
void set_restart_algorithms(int index, ::operations_research::sat::SatParameters_RestartAlgorithm value)
void clear_binary_minimization_algorithm()
bool has_clause_cleanup_lbd_bound() const
optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
bool has_use_rins_lns() const
optional bool use_rins_lns = 129 [default = true];
void clear_clause_activity_decay()
bool use_combined_no_overlap() const
SatParameters_BinaryMinizationAlgorithm
bool has_exploit_all_lp_solution() const
optional bool exploit_all_lp_solution = 116 [default = true];
static const int kPreferredVariableOrderFieldNumber
static constexpr BinaryMinizationAlgorithm EXPERIMENTAL_BINARY_MINIMIZATION
static const int kMinimizeCoreFieldNumber
void clear_presolve_bve_clause_weight()
::PROTOBUF_NAMESPACE_ID::int32 glucose_decay_increment_period() const
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()
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...
static bool MaxSatStratificationAlgorithm_IsValid(int value)
static const int kUseMirRoundingFieldNumber
void clear_restart_running_window_size()
static const int kLinearizationLevelFieldNumber
void clear_minimization_algorithm()
void set_cp_model_probing_level(::PROTOBUF_NAMESPACE_ID::int32 value)
bool catch_sigint_signal() const
bool has_boolean_encoding_level() const
optional int32 boolean_encoding_level = 107 [default = 1];
void clear_blocking_restart_multiplier()
void clear_exploit_all_lp_solution()
constexpr SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MAX
bool SatParameters_SearchBranching_IsValid(int value)
bool has_catch_sigint_signal() const
optional bool catch_sigint_signal = 135 [default = true];
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)
const std::string & SatParameters_ClauseOrdering_Name(T enum_t_value)
bool has_clause_cleanup_protection() const
optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [defa...
static constexpr SearchBranching AUTOMATIC_SEARCH
bool enumerate_all_solutions() const
::PROTOBUF_NAMESPACE_ID::int64 search_randomization_tolerance() const
bool has_pb_cleanup_ratio() const
optional double pb_cleanup_ratio = 47 [default = 0.5];
void set_max_inactive_count(::PROTOBUF_NAMESPACE_ID::int64 value)
void clear_random_branches_ratio()
const std::string & SatParameters_ClauseProtection_Name(T enum_t_value)
static constexpr MaxSatStratificationAlgorithm STRATIFICATION_ASCENT
bool has_cp_model_probing_level() const
optional int32 cp_model_probing_level = 110 [default = 2];
void set_binary_search_num_conflicts(::PROTOBUF_NAMESPACE_ID::int32 value)
constexpr SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MIN
double max_clause_activity_value() const
const ::PROTOBUF_NAMESPACE_ID::RepeatedField< int > & restart_algorithms() const
void clear_use_phase_saving()
static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_WEIGHT
static constexpr VariableOrder IN_ORDER
static constexpr SearchBranching SearchBranching_MIN
static constexpr ClauseOrdering CLAUSE_ACTIVITY
void set_treat_binary_clauses_separately(bool value)
bool exploit_all_lp_solution() const
static const int kCountAssumptionLevelsInLbdFieldNumber
void set_also_bump_variables_in_conflict_reasons(bool value)
static const int kAlsoBumpVariablesInConflictReasonsFieldNumber
constexpr SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MAX
void clear_mip_check_precision()
void clear_use_exact_lp_reason()
::PROTOBUF_NAMESPACE_ID::int32 num_conflicts_before_strategy_changes() const
void SerializeWithCachedSizes(::PROTOBUF_NAMESPACE_ID::io::CodedOutputStream *output) const final
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)
static const int kFillTightenedDomainsInResponseFieldNumber
void set_restart_dl_average_ratio(double value)
void set_binary_minimization_algorithm(::operations_research::sat::SatParameters_BinaryMinizationAlgorithm value)
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * GetDescriptor()
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_Polarity_descriptor()
void clear_exploit_integer_lp_solution()
const std::string & SatParameters_BinaryMinizationAlgorithm_Name(T enum_t_value)
static bool ClauseOrdering_Parse(const std::string &name, ClauseOrdering *value)
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 set_constraint_removal_batch_size(::PROTOBUF_NAMESPACE_ID::int64 value)
void Swap(SatParameters *other)
bool use_rins_lns() const
double blocking_restart_multiplier() const
void set_exploit_integer_lp_solution(bool value)
double mip_wanted_precision() const
static constexpr int ConflictMinimizationAlgorithm_ARRAYSIZE
void set_random_seed(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_preferred_variable_order() const
optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default =...
static const ::PROTOBUF_NAMESPACE_ID::Reflection * GetReflection()
void clear_constraint_removal_batch_size()
void clear_binary_search_num_conflicts()
::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_period() const
static constexpr BinaryMinizationAlgorithm BinaryMinizationAlgorithm_MIN
constexpr SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MAX
::PROTOBUF_NAMESPACE_ID::int32 cp_model_probing_level() const
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
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
void set_default_restart_algorithms(const std::string &value)
constexpr SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MAX
void clear_only_add_cuts_at_level_zero()
void clear_max_integer_rounding_scaling()
bool SatParameters_ClauseProtection_Parse(const std::string &name, SatParameters_ClauseProtection *value)
bool deterministic_parallel_search() const
bool has_interleave_search() const
optional bool interleave_search = 136 [default = false];
SatParameters_SearchBranching
bool cp_model_use_sat_presolve() const
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
bool use_overload_checker_in_cumulative_constraint() const
void set_presolve_use_bva(bool value)
constexpr int SatParameters_SearchBranching_SearchBranching_ARRAYSIZE
void set_clause_cleanup_protection(::operations_research::sat::SatParameters_ClauseProtection value)
void set_restart_lbd_average_ratio(double value)
static bool VariableOrder_IsValid(int value)
constexpr int SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_ARRAYSIZE
void set_max_time_in_seconds(double value)
static constexpr VariableOrder IN_RANDOM_ORDER
static bool VariableOrder_Parse(const std::string &name, VariableOrder *value)
constexpr SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MAX
bool SatParameters_ConflictMinimizationAlgorithm_Parse(const std::string &name, SatParameters_ConflictMinimizationAlgorithm *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
::operations_research::sat::SatParameters_ClauseOrdering clause_cleanup_ordering() const
void clear_auto_detect_greater_than_at_least_one_of()
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * RestartAlgorithm_descriptor()
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 int kMinimizeReductionDuringPbResolutionFieldNumber
static bool RestartAlgorithm_IsValid(int value)
static const int kCpModelPresolveFieldNumber
static bool BinaryMinizationAlgorithm_Parse(const std::string &name, BinaryMinizationAlgorithm *value)
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()
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
static constexpr ConflictMinimizationAlgorithm NONE
bool has_max_clause_activity_value() const
optional double max_clause_activity_value = 18 [default = 1e+20];
::PROTOBUF_NAMESPACE_ID::int32 presolve_bva_threshold() const
void set_max_sat_assumption_order(::operations_research::sat::SatParameters_MaxSatAssumptionOrder value)
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
void clear_variable_activity_decay()
::PROTOBUF_NAMESPACE_ID::int64 pseudo_cost_reliability_threshold() const
constexpr int SatParameters_RestartAlgorithm_RestartAlgorithm_ARRAYSIZE
bool has_restart_lbd_average_ratio() const
optional double restart_lbd_average_ratio = 71 [default = 1];
SatParameters_MaxSatAssumptionOrder
void clear_max_sat_stratification()
bool interleave_search() const
static bool RestartAlgorithm_Parse(const std::string &name, RestartAlgorithm *value)
constexpr int SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_ARRAYSIZE
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)
void set_presolve_bve_clause_weight(::PROTOBUF_NAMESPACE_ID::int32 value)
static const int kPresolveBveThresholdFieldNumber
void set_max_clause_activity_value(double value)
bool use_precedences_in_disjunctive_constraint() const
::PROTOBUF_NAMESPACE_ID::int32 minimize_with_propagation_num_decisions() const
void set_max_sat_stratification(::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm value)
SatParameters(SatParameters &&from) noexcept
void set_instantiate_all_variables(bool value)
static bool MaxSatStratificationAlgorithm_Parse(const std::string &name, MaxSatStratificationAlgorithm *value)
constexpr int SatParameters_ClauseOrdering_ClauseOrdering_ARRAYSIZE
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
void set_boolean_encoding_level(::PROTOBUF_NAMESPACE_ID::int32 value)
static constexpr int MaxSatAssumptionOrder_ARRAYSIZE
static const std::string & Polarity_Name(T enum_t_value)
bool has_add_knapsack_cuts() const
optional bool add_knapsack_cuts = 111 [default = false];
void clear_strategy_change_increase_ratio()
static const int kBlockingRestartWindowSizeFieldNumber
static constexpr MaxSatAssumptionOrder ORDER_ASSUMPTION_BY_DEPTH
static const int kMaxSatAssumptionOrderFieldNumber
::PROTOBUF_NAMESPACE_ID::int32 mip_max_activity_exponent() const
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 ...
::operations_research::sat::SatParameters_ClauseProtection clause_cleanup_protection() const
constexpr int SatParameters_Polarity_Polarity_ARRAYSIZE
static const std::string & ConflictMinimizationAlgorithm_Name(T enum_t_value)
void set_cp_model_presolve(bool value)
SatParameters_BinaryMinizationAlgorithm BinaryMinizationAlgorithm
static constexpr ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm_MIN
SatParameters_ConflictMinimizationAlgorithm
void clear_subsumption_during_conflict_analysis()
bool has_exploit_objective() const
optional bool exploit_objective = 131 [default = true];
void clear_boolean_encoding_level()
constexpr SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MIN
double pb_cleanup_ratio() const
bool has_presolve_bva_threshold() const
optional int32 presolve_bva_threshold = 73 [default = 1];
static constexpr Polarity POLARITY_RANDOM
double mip_max_bound() const
void set_use_precedences_in_disjunctive_constraint(bool value)
bool lns_focus_on_decision_variables() const
static bool ConflictMinimizationAlgorithm_Parse(const std::string &name, ConflictMinimizationAlgorithm *value)
::PROTOBUF_NAMESPACE_ID::int32 boolean_encoding_level() const
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_MaxSatStratificationAlgorithm_descriptor()
bool has_random_branches_ratio() const
optional double random_branches_ratio = 32 [default = 0];
void set_glucose_decay_increment_period(::PROTOBUF_NAMESPACE_ID::int32 value)
bool has_use_disjunctive_constraint_in_cumulative_constraint() const
optional bool use_disjunctive_constraint_in_cumulative_constraint = 80 [default = true];
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_VariableOrder_descriptor()
bool has_cp_model_use_sat_presolve() const
optional bool cp_model_use_sat_presolve = 93 [default = true];
static constexpr SearchBranching PORTFOLIO_WITH_QUICK_RESTART_SEARCH
SatParameters_MaxSatAssumptionOrder MaxSatAssumptionOrder
void add_restart_algorithms(::operations_research::sat::SatParameters_RestartAlgorithm value)
bool SatParameters_VariableOrder_IsValid(int value)
static constexpr MaxSatStratificationAlgorithm STRATIFICATION_DESCENT
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
SatParameters_ClauseOrdering ClauseOrdering
static const int kNumConflictsBeforeStrategyChangesFieldNumber
static const int kVariableActivityDecayFieldNumber
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)
static const std::string & MaxSatAssumptionOrder_Name(T enum_t_value)
bool presolve_use_bva() const
constexpr SatParameters_Polarity SatParameters_Polarity_Polarity_MAX
bool subsumption_during_conflict_analysis() const
void set_blocking_restart_multiplier(double value)
bool SatParameters_MaxSatAssumptionOrder_Parse(const std::string &name, SatParameters_MaxSatAssumptionOrder *value)
static constexpr Polarity Polarity_MAX
void set_initial_variables_activity(double value)
bool only_add_cuts_at_level_zero() const
const ::PROTOBUF_NAMESPACE_ID::internal::DescriptorTable descriptor_table_ortools_2fsat_2fsat_5fparameters_2eproto
SatParametersDefaultTypeInternal _SatParameters_default_instance_
void set_subsumption_during_conflict_analysis(bool value)
void clear_deterministic_parallel_search()
bool has_restart_period() const
optional int32 restart_period = 30 [default = 50];
static const int kAddKnapsackCutsFieldNumber
void clear_fill_tightened_domains_in_response()
constexpr SatParameters_ClauseProtection SatParameters_ClauseProtection_ClauseProtection_MIN
void set_max_integer_rounding_scaling(::PROTOBUF_NAMESPACE_ID::int32 value)
static const int kMinimizeWithPropagationRestartPeriodFieldNumber
static constexpr MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm_MAX
void set_use_mir_rounding(bool value)
bool has_num_search_workers() const
optional int32 num_search_workers = 100 [default = 1];
const std::string & SatParameters_ConflictMinimizationAlgorithm_Name(T enum_t_value)
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];
void set_clause_cleanup_period(::PROTOBUF_NAMESPACE_ID::int32 value)
static const int kUseOptimizationHintsFieldNumber
double glucose_max_decay() const
void set_blocking_restart_window_size(::PROTOBUF_NAMESPACE_ID::int32 value)
static constexpr int SearchBranching_ARRAYSIZE
bool use_blocking_restart() const
bool auto_detect_greater_than_at_least_one_of() const
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * ConflictMinimizationAlgorithm_descriptor()
bool has_exploit_integer_lp_solution() const
optional bool exploit_integer_lp_solution = 94 [default = true];
static constexpr int VariableOrder_ARRAYSIZE
static const int kOptimizeWithCoreFieldNumber
bool has_enumerate_all_solutions() const
optional bool enumerate_all_solutions = 87 [default = false];
bool use_lns_only() const
static const int kRestartRunningWindowSizeFieldNumber
static const int kDefaultRestartAlgorithmsFieldNumber
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * ClauseProtection_descriptor()
void set_search_randomization_tolerance(::PROTOBUF_NAMESPACE_ID::int64 value)
void clear_stop_after_first_solution()
::PROTOBUF_NAMESPACE_ID::int32 pb_cleanup_increment() const
static bool BinaryMinizationAlgorithm_IsValid(int value)
::PROTOBUF_NAMESPACE_ID::RepeatedField< int > * mutable_restart_algorithms()
::operations_research::sat::SatParameters_Polarity initial_polarity() const
constexpr SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MIN
static const int kTreatBinaryClausesSeparatelyFieldNumber
const std::string & SatParameters_VariableOrder_Name(T enum_t_value)
void clear_max_clause_activity_value()
bool share_level_zero_bounds() const
static const int kPseudoCostReliabilityThresholdFieldNumber
bool has_subsumption_during_conflict_analysis() const
optional bool subsumption_during_conflict_analysis = 56 [default = true];
void set_max_memory_in_mb(::PROTOBUF_NAMESPACE_ID::int64 value)
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * BinaryMinizationAlgorithm_descriptor()
void clear_restart_algorithms()
bool exploit_best_solution() const
bool has_use_phase_saving() const
optional bool use_phase_saving = 44 [default = true];
static constexpr RestartAlgorithm RestartAlgorithm_MIN
static const std::string & MaxSatStratificationAlgorithm_Name(T enum_t_value)
bool SatParameters_SearchBranching_Parse(const std::string &name, SatParameters_SearchBranching *value)
::operations_research::sat::SatParameters_MaxSatStratificationAlgorithm max_sat_stratification() const
void clear_max_inactive_count()
::PROTOBUF_NAMESPACE_ID::int64 constraint_removal_batch_size() const
static constexpr ConflictMinimizationAlgorithm SIMPLE
void set_optimize_with_core(bool value)
void set_mip_check_precision(double value)
bool instantiate_all_variables() const
double random_branches_ratio() const
static constexpr SearchBranching PSEUDO_COST_SEARCH
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
const std::string & SatParameters_MaxSatStratificationAlgorithm_Name(T enum_t_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 constexpr int MaxSatStratificationAlgorithm_ARRAYSIZE
static const int kUseErwaHeuristicFieldNumber
void clear_preferred_variable_order()
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
void set_presolve_bve_threshold(::PROTOBUF_NAMESPACE_ID::int32 value)
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
::PROTOBUF_NAMESPACE_ID::int64 max_number_of_conflicts() const
void clear_presolve_probing_deterministic_time_limit()
SatParameters_Polarity Polarity
void set_lns_focus_on_decision_variables(bool value)
static constexpr RestartAlgorithm NO_RESTART
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_SearchBranching_descriptor()
static constexpr ClauseProtection PROTECTION_ALWAYS
static bool SearchBranching_Parse(const std::string &name, SearchBranching *value)
static const int kRestartPeriodFieldNumber
bool has_minimize_with_propagation_num_decisions() const
optional int32 minimize_with_propagation_num_decisions = 97 [default = 1000];
::PROTOBUF_NAMESPACE_ID::int32 restart_running_window_size() const
double strategy_change_increase_ratio() const
void clear_mip_max_activity_exponent()
bool SatParameters_RestartAlgorithm_Parse(const std::string &name, SatParameters_RestartAlgorithm *value)
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];
bool use_disjunctive_constraint_in_cumulative_constraint() const
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * MaxSatStratificationAlgorithm_descriptor()
bool SatParameters_ClauseOrdering_Parse(const std::string &name, SatParameters_ClauseOrdering *value)
bool has_cp_model_presolve() const
optional bool cp_model_presolve = 86 [default = true];
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()
static const int kGlucoseMaxDecayFieldNumber
static const int kMaxNumberOfConflictsFieldNumber
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 constexpr BinaryMinizationAlgorithm BinaryMinizationAlgorithm_MAX
bool use_erwa_heuristic() const
static constexpr RestartAlgorithm LUBY_RESTART
void set_auto_detect_greater_than_at_least_one_of(bool value)
static const std::string & ClauseOrdering_Name(T enum_t_value)
static const std::string & SearchBranching_Name(T enum_t_value)
constexpr SatParameters_MaxSatStratificationAlgorithm SatParameters_MaxSatStratificationAlgorithm_MaxSatStratificationAlgorithm_MAX
static const int kShareObjectiveBoundsFieldNumber
static const int kSearchBranchingFieldNumber
bool IsInitialized() const final
static const ::PROTOBUF_NAMESPACE_ID::Descriptor * descriptor()
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_BinaryMinizationAlgorithm_descriptor()
bool SatParameters_ClauseProtection_IsValid(int value)
static constexpr int ClauseProtection_ARRAYSIZE
void clear_add_lp_constraints_lazily()
size_t ByteSizeLong() const final
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * Polarity_descriptor()
bool has_cover_optimization() const
optional bool cover_optimization = 89 [default = true];
static const int kMaxVariableActivityValueFieldNumber
static const int kMaxIntegerRoundingScalingFieldNumber
double restart_lbd_average_ratio() const
static const SatParameters * internal_default_instance()
bool SatParameters_ConflictMinimizationAlgorithm_IsValid(int value)
static constexpr MaxSatStratificationAlgorithm STRATIFICATION_NONE
bool has_glucose_decay_increment() const
optional double glucose_decay_increment = 23 [default = 0.01];
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * MaxSatAssumptionOrder_descriptor()
bool treat_binary_clauses_separately() const
static constexpr ClauseProtection PROTECTION_NONE
void MergeFrom(const ::PROTOBUF_NAMESPACE_ID::Message &from) final
static constexpr Polarity Polarity_MIN
static constexpr ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm_MAX
void clear_use_overload_checker_in_cumulative_constraint()
constexpr int SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_ARRAYSIZE
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];
void set_max_num_cuts(::PROTOBUF_NAMESPACE_ID::int32 value)
static const int kUseDisjunctiveConstraintInCumulativeConstraintFieldNumber
static constexpr Polarity POLARITY_WEIGHTED_SIGN
void set_use_combined_no_overlap(bool value)
void clear_lns_focus_on_decision_variables()
void clear_search_randomization_tolerance()
bool has_strategy_change_increase_ratio() const
optional double strategy_change_increase_ratio = 69 [default = 0];
const std::string & SatParameters_SearchBranching_Name(T enum_t_value)
bool has_mip_max_activity_exponent() const
optional int32 mip_max_activity_exponent = 127 [default = 53];
inline ::PROTOBUF_NAMESPACE_ID::UnknownFieldSet * mutable_unknown_fields()
bool has_stop_after_first_solution() const
optional bool stop_after_first_solution = 98 [default = false];
void clear_restart_period()
void set_use_optimization_hints(bool value)
void clear_clause_cleanup_period()
void clear_max_time_in_seconds()
static constexpr int Polarity_ARRAYSIZE
double presolve_probing_deterministic_time_limit() const
bool has_restart_dl_average_ratio() const
optional double restart_dl_average_ratio = 63 [default = 1];
static const int kDeterministicParallelSearchFieldNumber
bool has_max_sat_assumption_order() const
optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [...
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SearchBranching_descriptor()
SatParameters_MaxSatStratificationAlgorithm
const std::string & SatParameters_RestartAlgorithm_Name(T enum_t_value)
void set_cover_optimization(bool value)
bool has_blocking_restart_window_size() const
optional int32 blocking_restart_window_size = 65 [default = 5000];
::operations_research::sat::SatParameters_SearchBranching search_branching() const
void clear_use_lns_only()
bool has_mip_max_bound() const
optional double mip_max_bound = 124 [default = 10000000];
void clear_num_search_workers()
static const int kMinOrthogonalityForLpConstraintsFieldNumber
static const std::string & VariableOrder_Name(T enum_t_value)
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_RestartAlgorithm_descriptor()
static const int kMipWantedPrecisionFieldNumber
void clear_use_timetable_edge_finding_in_cumulative_constraint()
static const int kOnlyAddCutsAtLevelZeroFieldNumber
static const int kMaxSatReverseAssumptionOrderFieldNumber
double mip_check_precision() const
static const int kMinimizationAlgorithmFieldNumber
void clear_find_multiple_cores()
void clear_restart_dl_average_ratio()
bool exploit_objective() const
bool has_max_time_in_seconds() const
optional double max_time_in_seconds = 36 [default = inf];
double mip_var_scaling() const
void set_num_conflicts_before_strategy_changes(::PROTOBUF_NAMESPACE_ID::int32 value)
static constexpr int kIndexInFileMessages
void clear_max_sat_assumption_order()
static const int kInstantiateAllVariablesFieldNumber
static const int kRandomizeSearchFieldNumber
void clear_max_deterministic_time()
void clear_minimize_core()
double random_polarity_ratio() const
static constexpr SearchBranching SearchBranching_MAX
static bool MaxSatAssumptionOrder_IsValid(int value)
static const std::string & ClauseProtection_Name(T enum_t_value)
void set_max_number_of_conflicts(::PROTOBUF_NAMESPACE_ID::int64 value)
double max_time_in_seconds() const
bool has_constraint_removal_batch_size() const
optional int64 constraint_removal_batch_size = 122 [default = 100];
static constexpr SearchBranching HINT_SEARCH
SatParameters_ClauseProtection ClauseProtection
bool has_mip_var_scaling() const
optional double mip_var_scaling = 125 [default = 1];
void set_use_blocking_restart(bool value)
constexpr int SatParameters_VariableOrder_VariableOrder_ARRAYSIZE
void set_add_cg_cuts(bool value)
void clear_use_pb_resolution()
bool log_search_progress() const
bool use_optimization_hints() const
void clear_max_num_cuts()
void clear_interleave_search()
void CopyFrom(const ::PROTOBUF_NAMESPACE_ID::Message &from) final
void clear_optimize_with_core()
void set_presolve_probing_deterministic_time_limit(double value)
void clear_max_memory_in_mb()
static const int kGlucoseDecayIncrementPeriodFieldNumber
void set_minimize_with_propagation_num_decisions(::PROTOBUF_NAMESPACE_ID::int32 value)
static constexpr VariableOrder IN_REVERSE_ORDER
static constexpr MaxSatAssumptionOrder MaxSatAssumptionOrder_MIN
static constexpr MaxSatAssumptionOrder DEFAULT_ASSUMPTION_ORDER
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];
::PROTOBUF_NAMESPACE_ID::int32 binary_search_num_conflicts() const
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 const int kConstraintRemovalBatchSizeFieldNumber
void set_glucose_max_decay(double value)
void clear_presolve_bve_threshold()
double max_deterministic_time() const
static constexpr RestartAlgorithm FIXED_RESTART
void clear_min_orthogonality_for_lp_constraints()
static constexpr SearchBranching LP_SEARCH
static constexpr ClauseProtection PROTECTION_LBD
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];
constexpr SatParameters_ClauseOrdering SatParameters_ClauseOrdering_ClauseOrdering_MAX
void clear_use_combined_no_overlap()
static const int kPresolveBlockedClauseFieldNumber
void clear_glucose_decay_increment_period()
::PROTOBUF_NAMESPACE_ID::uint8 * InternalSerializeWithCachedSizesToArray(::PROTOBUF_NAMESPACE_ID::uint8 *target) const final
static const int kMaxClauseActivityValueFieldNumber
static constexpr RestartAlgorithm DL_MOVING_AVERAGE_RESTART
static const int kMinimizeWithPropagationNumDecisionsFieldNumber
void clear_use_disjunctive_constraint_in_cumulative_constraint()
std::string * mutable_default_restart_algorithms()
static const int kLnsFocusOnDecisionVariablesFieldNumber
void clear_share_objective_bounds()
static constexpr int ClauseOrdering_ARRAYSIZE
const std::string & SatParameters_MaxSatAssumptionOrder_Name(T enum_t_value)
static const int kClauseActivityDecayFieldNumber
constexpr int SatParameters_ClauseProtection_ClauseProtection_ARRAYSIZE
void set_clause_activity_decay(double value)
void clear_add_knapsack_cuts()
void set_presolve_blocked_clause(bool value)
constexpr SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MAX
bool use_optional_variables() const
::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_lbd_bound() const
constexpr SatParameters_MaxSatAssumptionOrder SatParameters_MaxSatAssumptionOrder_MaxSatAssumptionOrder_MIN
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];
SatParameters_VariableOrder
static constexpr ClauseOrdering ClauseOrdering_MIN
void clear_clause_cleanup_target()
void set_allocated_default_restart_algorithms(std::string *default_restart_algorithms)
::PROTOBUF_NAMESPACE_ID::Metadata GetMetadata() const final
SatParameters_MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm
bool has_presolve_bve_clause_weight() const
optional int32 presolve_bve_clause_weight = 55 [default = 3];
void set_pb_cleanup_ratio(double value)
const std::string & SatParameters_Polarity_Name(T enum_t_value)
static const std::string & RestartAlgorithm_Name(T enum_t_value)
void set_num_search_workers(::PROTOBUF_NAMESPACE_ID::int32 value)
void set_share_objective_bounds(bool value)
void clear_max_sat_reverse_assumption_order()
static const int kRandomPolarityRatioFieldNumber
static constexpr SearchBranching PORTFOLIO_SEARCH
void clear_default_restart_algorithms()
bool exploit_integer_lp_solution() const
static constexpr ClauseProtection ClauseProtection_MIN
void clear_mip_max_bound()
static bool ClauseOrdering_IsValid(int value)
bool presolve_blocked_clause() const
::PROTOBUF_NAMESPACE_ID::int32 random_seed() const
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 int kMaxNumCutsFieldNumber
static constexpr int BinaryMinizationAlgorithm_ARRAYSIZE
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];
SatParameters_RestartAlgorithm RestartAlgorithm
bool has_add_cg_cuts() const
optional bool add_cg_cuts = 117 [default = false];
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_FIRST
void clear_treat_binary_clauses_separately()
bool SatParameters_Polarity_IsValid(int value)
SatParameters_ConflictMinimizationAlgorithm ConflictMinimizationAlgorithm
::PROTOBUF_NAMESPACE_ID::int32 clause_cleanup_target() const
static const int kRestartAlgorithmsFieldNumber
Licensed under the Apache License, Version 2.0 (the "License"); you may not use this file except in c...
static constexpr BinaryMinizationAlgorithm NO_BINARY_MINIMIZATION
static const int kAutoDetectGreaterThanAtLeastOneOfFieldNumber
bool count_assumption_levels_in_lbd() const
constexpr SatParameters_BinaryMinizationAlgorithm SatParameters_BinaryMinizationAlgorithm_BinaryMinizationAlgorithm_MIN
static const int kStrategyChangeIncreaseRatioFieldNumber
std::string * release_default_restart_algorithms()
void set_randomize_search(bool value)
bool has_max_inactive_count() const
optional int64 max_inactive_count = 121 [default = 1000];
double max_variable_activity_value() const
static constexpr ClauseOrdering CLAUSE_LBD
bool SatParameters_Polarity_Parse(const std::string &name, SatParameters_Polarity *value)
void clear_use_mir_rounding()
const std::string & default_restart_algorithms() const
bool has_use_combined_no_overlap() const
optional bool use_combined_no_overlap = 133 [default = false];
static const std::string & BinaryMinizationAlgorithm_Name(T enum_t_value)
void set_clause_cleanup_target(::PROTOBUF_NAMESPACE_ID::int32 value)
SatParameters & operator=(const SatParameters &from)
friend void swap(SatParameters &a, SatParameters &b)
void set_share_level_zero_bounds(bool value)
::PROTOBUF_NAMESPACE_ID::int32 linearization_level() const
bool has_max_num_cuts() const
optional int32 max_num_cuts = 91 [default = 5000];
static const int kRestartLbdAverageRatioFieldNumber
static const int kPresolveUseBvaFieldNumber
void set_pseudo_cost_reliability_threshold(::PROTOBUF_NAMESPACE_ID::int64 value)
static const int kClauseCleanupLbdBoundFieldNumber
double glucose_decay_increment() const
static const int kExploitBestSolutionFieldNumber
static const int kMipVarScalingFieldNumber
void set_random_polarity_ratio(double value)
static constexpr int RestartAlgorithm_ARRAYSIZE
bool has_num_conflicts_before_strategy_changes() const
optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
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
static constexpr RestartAlgorithm RestartAlgorithm_MAX
bool has_max_sat_reverse_assumption_order() const
optional bool max_sat_reverse_assumption_order = 52 [default = false];
void set_pb_cleanup_increment(::PROTOBUF_NAMESPACE_ID::int32 value)
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 bool MaxSatAssumptionOrder_Parse(const std::string &name, MaxSatAssumptionOrder *value)
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];
constexpr SatParameters_SearchBranching SatParameters_SearchBranching_SearchBranching_MAX
void set_use_exact_lp_reason(bool value)
static const int kUseCombinedNoOverlapFieldNumber
void set_fill_tightened_domains_in_response(bool value)
void set_minimize_with_propagation_restart_period(::PROTOBUF_NAMESPACE_ID::int32 value)
static constexpr RestartAlgorithm LBD_MOVING_AVERAGE_RESTART
static const int kMipCheckPrecisionFieldNumber
bool SatParameters_BinaryMinizationAlgorithm_Parse(const std::string &name, SatParameters_BinaryMinizationAlgorithm *value)
static const int kShareLevelZeroBoundsFieldNumber
void set_catch_sigint_signal(bool value)
bool has_clause_cleanup_ordering() const
optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default ...
void set_presolve_bva_threshold(::PROTOBUF_NAMESPACE_ID::int32 value)
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 constexpr Polarity POLARITY_FALSE
::PROTOBUF_NAMESPACE_ID::int64 max_inactive_count() const
static const int kInitialVariablesActivityFieldNumber
bool MergePartialFromCodedStream(::PROTOBUF_NAMESPACE_ID::io::CodedInputStream *input) final
static const SatParameters & default_instance()
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_ClauseOrdering_descriptor()
bool has_optimize_with_core() const
optional bool optimize_with_core = 83 [default = false];
static bool ClauseProtection_Parse(const std::string &name, ClauseProtection *value)
bool has_minimize_with_propagation_restart_period() const
optional int32 minimize_with_propagation_restart_period = 96 [default = 10];
SatParameters_RestartAlgorithm
static const int kExploitIntegerLpSolutionFieldNumber
static constexpr MaxSatAssumptionOrder MaxSatAssumptionOrder_MAX
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_ClauseProtection_descriptor()
bool has_deterministic_parallel_search() const
optional bool deterministic_parallel_search = 134 [default = false];
void set_strategy_change_increase_ratio(double value)
void set_minimize_reduction_during_pb_resolution(bool value)
void clear_initial_variables_activity()
static const int kClauseCleanupProtectionFieldNumber
void set_use_disjunctive_constraint_in_cumulative_constraint(bool value)
static const int kPbCleanupIncrementFieldNumber
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];
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];
constexpr SatParameters_RestartAlgorithm SatParameters_RestartAlgorithm_RestartAlgorithm_MIN
static const int kInitialPolarityFieldNumber
void set_interleave_search(bool value)
static constexpr Polarity POLARITY_REVERSE_WEIGHTED_SIGN
static const int kCatchSigintSignalFieldNumber
bool has_share_objective_bounds() const
optional bool share_objective_bounds = 113 [default = true];
static ::PROTOBUF_NAMESPACE_ID::internal::ExplicitlyConstructed< std::string > _i_give_permission_to_break_this_code_default_default_restart_algorithms_
void clear_glucose_max_decay()
static const int kRestartDlAverageRatioFieldNumber
static const int kClauseCleanupPeriodFieldNumber
SatParameters_VariableOrder VariableOrder
nested types -------------------------------------------------—
void clear_cover_optimization()
static const int kLogSearchProgressFieldNumber
bool has_use_overload_checker_in_cumulative_constraint() const
optional bool use_overload_checker_in_cumulative_constraint = 78 [default = false];
void clear_share_level_zero_bounds()
bool has_presolve_blocked_clause() const
optional bool presolve_blocked_clause = 88 [default = true];
bool SatParameters_MaxSatStratificationAlgorithm_Parse(const std::string &name, SatParameters_MaxSatStratificationAlgorithm *value)
static constexpr MaxSatStratificationAlgorithm MaxSatStratificationAlgorithm_MIN
static const int kUsePhaseSavingFieldNumber
void clear_log_search_progress()
void set_exploit_all_lp_solution(bool value)
void clear_clause_cleanup_protection()
constexpr SatParameters_VariableOrder SatParameters_VariableOrder_VariableOrder_MIN
bool optimize_with_core() const
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];
::PROTOBUF_NAMESPACE_ID::int32 presolve_bve_threshold() const
const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * SatParameters_ConflictMinimizationAlgorithm_descriptor()
void clear_cp_model_use_sat_presolve()
bool SatParameters_VariableOrder_Parse(const std::string &name, SatParameters_VariableOrder *value)
void set_deterministic_parallel_search(bool value)
void set_use_lns_only(bool value)
static constexpr BinaryMinizationAlgorithm BINARY_MINIMIZATION_WITH_REACHABILITY
constexpr SatParameters_ConflictMinimizationAlgorithm SatParameters_ConflictMinimizationAlgorithm_ConflictMinimizationAlgorithm_MIN
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];
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * VariableOrder_descriptor()
void set_use_timetable_edge_finding_in_cumulative_constraint(bool value)
static constexpr VariableOrder VariableOrder_MAX
static const int kPresolveBveClauseWeightFieldNumber
SatParameters_ClauseOrdering
constexpr SatParameters_Polarity SatParameters_Polarity_Polarity_MIN
static const int kCoverOptimizationFieldNumber
int restart_algorithms_size() const
accessors ----------------------------------------------------—
static const int kUseBlockingRestartFieldNumber
void clear_max_number_of_conflicts()
void set_linearization_level(::PROTOBUF_NAMESPACE_ID::int32 value)
static const ::PROTOBUF_NAMESPACE_ID::EnumDescriptor * ClauseOrdering_descriptor()
void clear_linearization_level()
static const int kAddMirCutsFieldNumber
bool has_optimize_with_max_hs() const
optional bool optimize_with_max_hs = 85 [default = false];
static const int kMipMaxBoundFieldNumber
static constexpr VariableOrder VariableOrder_MIN
void clear_pb_cleanup_increment()
void clear_presolve_use_bva()
static bool Polarity_Parse(const std::string &name, Polarity *value)
static constexpr Polarity POLARITY_TRUE
PROTOBUF_ATTRIBUTE_REINITIALIZES void Clear() final