Google OR-Tools v9.9
a fast and portable software suite for combinatorial optimization
Loading...
Searching...
No Matches
SatParametersOuterClass.java
Go to the documentation of this file.
1// Generated by the protocol buffer compiler. DO NOT EDIT!
2// source: ortools/sat/sat_parameters.proto
3
4// Protobuf Java Version: 3.25.3
5package com.google.ortools.sat;
6
7public final class SatParametersOuterClass {
8 private SatParametersOuterClass() {}
9 public static void registerAllExtensions(
10 com.google.protobuf.ExtensionRegistryLite registry) {
11 }
12
13 public static void registerAllExtensions(
14 com.google.protobuf.ExtensionRegistry registry) {
16 (com.google.protobuf.ExtensionRegistryLite) registry);
17 }
18 static final com.google.protobuf.Descriptors.Descriptor
19 internal_static_operations_research_sat_SatParameters_descriptor;
20 static final
21 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable
22 internal_static_operations_research_sat_SatParameters_fieldAccessorTable;
23
24 public static com.google.protobuf.Descriptors.FileDescriptor
26 return descriptor;
27 }
28 private static com.google.protobuf.Descriptors.FileDescriptor
29 descriptor;
30 static {
31 java.lang.String[] descriptorData = {
32 "\n ortools/sat/sat_parameters.proto\022\027oper" +
33 "ations_research.sat\"\254]\n\rSatParameters\022\017\n" +
34 "\004name\030\253\001 \001(\t:\000\022`\n\030preferred_variable_ord" +
35 "er\030\001 \001(\01624.operations_research.sat.SatPa" +
36 "rameters.VariableOrder:\010IN_ORDER\022Y\n\020init" +
37 "ial_polarity\030\002 \001(\0162/.operations_research" +
38 ".sat.SatParameters.Polarity:\016POLARITY_FA" +
39 "LSE\022\036\n\020use_phase_saving\030, \001(\010:\004true\022)\n\032p" +
40 "olarity_rephase_increment\030\250\001 \001(\005:\0041000\022 " +
41 "\n\025random_polarity_ratio\030- \001(\001:\0010\022 \n\025rand" +
42 "om_branches_ratio\030 \001(\001:\0010\022!\n\022use_erwa_h" +
43 "euristic\030K \001(\010:\005false\022%\n\032initial_variabl" +
44 "es_activity\030L \001(\001:\0010\0226\n\'also_bump_variab" +
45 "les_in_conflict_reasons\030M \001(\010:\005false\022o\n\026" +
46 "minimization_algorithm\030\004 \001(\0162D.operation" +
47 "s_research.sat.SatParameters.ConflictMin" +
48 "imizationAlgorithm:\tRECURSIVE\022\202\001\n\035binary" +
49 "_minimization_algorithm\030\" \001(\0162@.operatio" +
50 "ns_research.sat.SatParameters.BinaryMini" +
51 "zationAlgorithm:\031BINARY_MINIMIZATION_FIR" +
52 "ST\0222\n$subsumption_during_conflict_analys" +
53 "is\0308 \001(\010:\004true\022$\n\025clause_cleanup_period\030" +
54 "\013 \001(\005:\00510000\022 \n\025clause_cleanup_target\030\r " +
55 "\001(\005:\0010\022\"\n\024clause_cleanup_ratio\030\276\001 \001(\001:\0030" +
56 ".5\022k\n\031clause_cleanup_protection\030: \001(\01627." +
57 "operations_research.sat.SatParameters.Cl" +
58 "auseProtection:\017PROTECTION_NONE\022#\n\030claus" +
59 "e_cleanup_lbd_bound\030; \001(\005:\0015\022g\n\027clause_c" +
60 "leanup_ordering\030< \001(\01625.operations_resea" +
61 "rch.sat.SatParameters.ClauseOrdering:\017CL" +
62 "AUSE_ACTIVITY\022!\n\024pb_cleanup_increment\030. " +
63 "\001(\005:\003200\022\035\n\020pb_cleanup_ratio\030/ \001(\001:\0030.5\022" +
64 "$\n\027variable_activity_decay\030\017 \001(\001:\0030.8\022+\n" +
65 "\033max_variable_activity_value\030\020 \001(\001:\0061e+1" +
66 "00\022\037\n\021glucose_max_decay\030\026 \001(\001:\0040.95\022%\n\027g" +
67 "lucose_decay_increment\030\027 \001(\001:\0040.01\022,\n\036gl" +
68 "ucose_decay_increment_period\030\030 \001(\005:\0045000" +
69 "\022$\n\025clause_activity_decay\030\021 \001(\001:\0050.999\022(" +
70 "\n\031max_clause_activity_value\030\022 \001(\001:\0051e+20" +
71 "\022S\n\022restart_algorithms\030= \003(\01627.operation" +
72 "s_research.sat.SatParameters.RestartAlgo" +
73 "rithm\022e\n\032default_restart_algorithms\030F \001(" +
74 "\t:ALUBY_RESTART,LBD_MOVING_AVERAGE_RESTA" +
75 "RT,DL_MOVING_AVERAGE_RESTART\022\032\n\016restart_" +
76 "period\030\036 \001(\005:\00250\022\'\n\033restart_running_wind" +
77 "ow_size\030> \001(\005:\00250\022#\n\030restart_dl_average_" +
78 "ratio\030? \001(\001:\0011\022$\n\031restart_lbd_average_ra" +
79 "tio\030G \001(\001:\0011\022#\n\024use_blocking_restart\030@ \001" +
80 "(\010:\005false\022*\n\034blocking_restart_window_siz" +
81 "e\030A \001(\005:\0045000\022(\n\033blocking_restart_multip" +
82 "lier\030B \001(\001:\0031.4\0220\n%num_conflicts_before_" +
83 "strategy_changes\030D \001(\005:\0010\022)\n\036strategy_ch" +
84 "ange_increase_ratio\030E \001(\001:\0010\022 \n\023max_time" +
85 "_in_seconds\030$ \001(\001:\003inf\022#\n\026max_determinis" +
86 "tic_time\030C \001(\001:\003inf\0224\n\027max_number_of_con" +
87 "flicts\030% \001(\003:\0239223372036854775807\022\037\n\020max" +
88 "_memory_in_mb\030( \001(\003:\00510000\022#\n\022absolute_g" +
89 "ap_limit\030\237\001 \001(\001:\0060.0001\022\036\n\022relative_gap_" +
90 "limit\030\240\001 \001(\001:\0010\022\026\n\013random_seed\030\037 \001(\005:\0011\022" +
91 ")\n\031permute_variable_randomly\030\262\001 \001(\010:\005fal" +
92 "se\0221\n!permute_presolve_constraint_order\030" +
93 "\263\001 \001(\010:\005false\022\037\n\017use_absl_random\030\264\001 \001(\010:" +
94 "\005false\022\"\n\023log_search_progress\030) \001(\010:\005fal" +
95 "se\022(\n\030log_subsolver_statistics\030\275\001 \001(\010:\005f" +
96 "alse\022\025\n\nlog_prefix\030\271\001 \001(\t:\000\022\034\n\rlog_to_st" +
97 "dout\030\272\001 \001(\010:\004true\022\037\n\017log_to_response\030\273\001 " +
98 "\001(\010:\005false\022 \n\021use_pb_resolution\030+ \001(\010:\005f" +
99 "alse\0226\n\'minimize_reduction_during_pb_res" +
100 "olution\0300 \001(\010:\005false\022,\n\036count_assumption" +
101 "_levels_in_lbd\0301 \001(\010:\004true\022#\n\026presolve_b" +
102 "ve_threshold\0306 \001(\005:\003500\022%\n\032presolve_bve_" +
103 "clause_weight\0307 \001(\005:\0013\022,\n probing_determ" +
104 "inistic_time_limit\030\342\001 \001(\001:\0011\0225\n)presolve" +
105 "_probing_deterministic_time_limit\0309 \001(\001:" +
106 "\00230\022%\n\027presolve_blocked_clause\030X \001(\010:\004tr" +
107 "ue\022\036\n\020presolve_use_bva\030H \001(\010:\004true\022!\n\026pr" +
108 "esolve_bva_threshold\030I \001(\005:\0011\022#\n\027max_pre" +
109 "solve_iterations\030\212\001 \001(\005:\0013\022\037\n\021cp_model_p" +
110 "resolve\030V \001(\010:\004true\022!\n\026cp_model_probing_" +
111 "level\030n \001(\005:\0012\022\'\n\031cp_model_use_sat_preso" +
112 "lve\030] \001(\010:\004true\022&\n\026detect_table_with_cos" +
113 "t\030\330\001 \001(\010:\005false\022#\n\027table_compression_lev" +
114 "el\030\331\001 \001(\005:\0012\022*\n\032expand_alldiff_constrain" +
115 "ts\030\252\001 \001(\010:\005false\022+\n\034expand_reservoir_con" +
116 "straints\030\266\001 \001(\010:\004true\022,\n\034disable_constra" +
117 "int_expansion\030\265\001 \001(\010:\005false\022=\n-encode_co" +
118 "mplex_linear_constraint_with_integer\030\337\001 " +
119 "\001(\010:\005false\0223\n\033merge_no_overlap_work_limi" +
120 "t\030\221\001 \001(\001:\r1000000000000\0220\n\034merge_at_most" +
121 "_one_work_limit\030\222\001 \001(\001:\t100000000\022\'\n\033pre" +
122 "solve_substitution_level\030\223\001 \001(\005:\0011\0224\n$pr" +
123 "esolve_extract_integer_enforcement\030\256\001 \001(" +
124 "\010:\005false\0221\n\035presolve_inclusion_work_limi" +
125 "t\030\311\001 \001(\003:\t100000000\022\033\n\014ignore_names\030\312\001 \001" +
126 "(\010:\004true\022\036\n\017infer_all_diffs\030\351\001 \001(\010:\004true" +
127 "\022&\n\027find_big_linear_overlap\030\352\001 \001(\010:\004true" +
128 "\022#\n\024use_sat_inprocessing\030\243\001 \001(\010:\004true\022&\n" +
129 "\030inprocessing_dtime_ratio\030\221\002 \001(\001:\0030.2\022&\n" +
130 "\032inprocessing_probing_dtime\030\222\002 \001(\001:\0011\022+\n" +
131 "\037inprocessing_minimization_dtime\030\223\002 \001(\001:" +
132 "\0011\022\027\n\013num_workers\030\316\001 \001(\005:\0010\022\035\n\022num_searc" +
133 "h_workers\030d \001(\005:\0010\022\037\n\023min_num_lns_worker" +
134 "s\030\323\001 \001(\005:\0012\022\023\n\nsubsolvers\030\317\001 \003(\t\022\031\n\020extr" +
135 "a_subsolvers\030\333\001 \003(\t\022\032\n\021ignore_subsolvers" +
136 "\030\321\001 \003(\t\022A\n\020subsolver_params\030\322\001 \003(\0132&.ope" +
137 "rations_research.sat.SatParameters\022!\n\021in" +
138 "terleave_search\030\210\001 \001(\010:\005false\022!\n\025interle" +
139 "ave_batch_size\030\206\001 \001(\005:\0010\022$\n\026share_object" +
140 "ive_bounds\030q \001(\010:\004true\022%\n\027share_level_ze" +
141 "ro_bounds\030r \001(\010:\004true\022#\n\024share_binary_cl" +
142 "auses\030\313\001 \001(\010:\004true\0220\n debug_postsolve_wi" +
143 "th_full_solver\030\242\001 \001(\010:\005false\022-\n!debug_ma" +
144 "x_num_presolve_operations\030\227\001 \001(\005:\0010\022\'\n\027d" +
145 "ebug_crash_on_bad_hint\030\303\001 \001(\010:\005false\022$\n\026" +
146 "use_optimization_hints\030# \001(\010:\004true\022\"\n\027co" +
147 "re_minimization_level\0302 \001(\005:\0012\022!\n\023find_m" +
148 "ultiple_cores\030T \001(\010:\004true\022 \n\022cover_optim" +
149 "ization\030Y \001(\010:\004true\022x\n\030max_sat_assumptio" +
150 "n_order\0303 \001(\0162<.operations_research.sat." +
151 "SatParameters.MaxSatAssumptionOrder:\030DEF" +
152 "AULT_ASSUMPTION_ORDER\022/\n max_sat_reverse" +
153 "_assumption_order\0304 \001(\010:\005false\022|\n\026max_sa" +
154 "t_stratification\0305 \001(\0162D.operations_rese" +
155 "arch.sat.SatParameters.MaxSatStratificat" +
156 "ionAlgorithm:\026STRATIFICATION_DESCENT\022.\n!" +
157 "propagation_loop_detection_factor\030\335\001 \001(\001" +
158 ":\00210\0227\n)use_precedences_in_disjunctive_c" +
159 "onstraint\030J \001(\010:\004true\022B\n5max_size_to_cre" +
160 "ate_precedence_literals_in_disjunctive\030\345" +
161 "\001 \001(\005:\00260\0225\n%use_strong_propagation_in_d" +
162 "isjunctive\030\346\001 \001(\010:\005false\0225\n%use_dynamic_" +
163 "precedence_in_disjunctive\030\207\002 \001(\010:\005false\022" +
164 "4\n$use_dynamic_precedence_in_cumulative\030" +
165 "\214\002 \001(\010:\005false\0221\n\"use_overload_checker_in" +
166 "_cumulative\030N \001(\010:\005false\0227\n(use_timetabl" +
167 "e_edge_finding_in_cumulative\030O \001(\010:\005fals" +
168 "e\022:\n,max_num_intervals_for_timetable_edg" +
169 "e_finding\030\204\002 \001(\005:\003100\0222\n\"use_hard_preced" +
170 "ences_in_cumulative\030\327\001 \001(\010:\005false\022\'\n\027exp" +
171 "loit_all_precedences\030\334\001 \001(\010:\005false\0226\n(us" +
172 "e_disjunctive_constraint_in_cumulative\030P" +
173 " \001(\010:\004true\0220\n use_timetabling_in_no_over" +
174 "lap_2d\030\310\001 \001(\010:\005false\0228\n(use_energetic_re" +
175 "asoning_in_no_overlap_2d\030\325\001 \001(\010:\005false\022=" +
176 "\n-use_area_energetic_reasoning_in_no_ove" +
177 "rlap_2d\030\217\002 \001(\010:\005false\022<\n-max_pairs_pairw" +
178 "ise_reasoning_in_no_overlap_2d\030\224\002 \001(\005:\0041" +
179 "250\022-\n\036use_dual_scheduling_heuristics\030\326\001" +
180 " \001(\010:\004true\022b\n\020search_branching\030R \001(\01626.o" +
181 "perations_research.sat.SatParameters.Sea" +
182 "rchBranching:\020AUTOMATIC_SEARCH\022 \n\023hint_c" +
183 "onflict_limit\030\231\001 \001(\005:\00210\022\033\n\013repair_hint\030" +
184 "\247\001 \001(\010:\005false\0223\n#fix_variables_to_their_" +
185 "hinted_value\030\300\001 \001(\010:\005false\022\"\n\022use_probin" +
186 "g_search\030\260\001 \001(\010:\005false\022#\n\024use_extended_p" +
187 "robing\030\215\002 \001(\010:\004true\022.\n\036probing_num_combi" +
188 "nations_limit\030\220\002 \001(\005:\00520000\022,\n\035use_shavi" +
189 "ng_in_probing_search\030\314\001 \001(\010:\004true\0221\n!sha" +
190 "ving_search_deterministic_time\030\315\001 \001(\001:\0050" +
191 ".001\022\'\n\027use_objective_lb_search\030\344\001 \001(\010:\005" +
192 "false\022,\n\034use_objective_shaving_search\030\375\001" +
193 " \001(\010:\005false\022.\n!pseudo_cost_reliability_t" +
194 "hreshold\030{ \001(\003:\003100\022!\n\022optimize_with_cor" +
195 "e\030S \001(\010:\005false\022,\n\034optimize_with_lb_tree_" +
196 "search\030\274\001 \001(\010:\005false\022\'\n\033binary_search_nu" +
197 "m_conflicts\030c \001(\005:\002-1\022#\n\024optimize_with_m" +
198 "ax_hs\030U \001(\010:\005false\022#\n\024use_feasibility_ju" +
199 "mp\030\211\002 \001(\010:\004true\022%\n\025test_feasibility_jump" +
200 "\030\360\001 \001(\010:\005false\022%\n\026feasibility_jump_decay" +
201 "\030\362\001 \001(\001:\0040.95\0220\n$feasibility_jump_linear" +
202 "ization_level\030\201\002 \001(\005:\0012\022+\n\037feasibility_j" +
203 "ump_restart_factor\030\202\002 \001(\005:\0011\022:\n.feasibil" +
204 "ity_jump_var_randomization_probability\030\367" +
205 "\001 \001(\001:\0010\022;\n-feasibility_jump_var_perburb" +
206 "ation_range_ratio\030\370\001 \001(\001:\0030.2\022/\n feasibi" +
207 "lity_jump_enable_restarts\030\372\001 \001(\010:\004true\022;" +
208 "\n-feasibility_jump_max_expanded_constrai" +
209 "nt_size\030\210\002 \001(\005:\003100\022\034\n\020num_violation_ls\030" +
210 "\364\001 \001(\005:\0010\022.\n violation_ls_perturbation_p" +
211 "eriod\030\371\001 \001(\005:\003100\0224\n&violation_ls_compou" +
212 "nd_move_probability\030\203\002 \001(\001:\0030.5\022#\n\027share" +
213 "d_tree_num_workers\030\353\001 \001(\005:\0010\022&\n\026use_shar" +
214 "ed_tree_search\030\354\001 \001(\010:\005false\022<\n.shared_t" +
215 "ree_worker_objective_split_probability\030\355" +
216 "\001 \001(\001:\0030.5\022.\n shared_tree_max_nodes_per_" +
217 "worker\030\356\001 \001(\005:\003128\022x\n\032shared_tree_split_" +
218 "strategy\030\357\001 \001(\0162>.operations_research.sa" +
219 "t.SatParameters.SharedTreeSplitStrategy:" +
220 "\023SPLIT_STRATEGY_AUTO\022&\n\027enumerate_all_so" +
221 "lutions\030W \001(\010:\005false\0227\n\'keep_all_feasibl" +
222 "e_solutions_in_presolve\030\255\001 \001(\010:\005false\0222\n" +
223 "\"fill_tightened_domains_in_response\030\204\001 \001" +
224 "(\010:\005false\0225\n%fill_additional_solutions_i" +
225 "n_response\030\302\001 \001(\010:\005false\022\'\n\031instantiate_" +
226 "all_variables\030j \001(\010:\004true\0226\n(auto_detect" +
227 "_greater_than_at_least_one_of\030_ \001(\010:\004tru" +
228 "e\022(\n\031stop_after_first_solution\030b \001(\010:\005fa" +
229 "lse\022#\n\023stop_after_presolve\030\225\001 \001(\010:\005false" +
230 "\022+\n\033stop_after_root_propagation\030\374\001 \001(\010:\005" +
231 "false\022\033\n\014use_lns_only\030e \001(\010:\005false\022\036\n\022so" +
232 "lution_pool_size\030\301\001 \001(\005:\0013\022\033\n\014use_rins_l" +
233 "ns\030\201\001 \001(\010:\004true\022#\n\024use_feasibility_pump\030" +
234 "\244\001 \001(\010:\004true\022 \n\020use_lb_relax_lns\030\377\001 \001(\010:" +
235 "\005false\022c\n\013fp_rounding\030\245\001 \001(\01627.operation" +
236 "s_research.sat.SatParameters.FPRoundingM" +
237 "ethod:\024PROPAGATION_ASSISTED\022$\n\024diversify" +
238 "_lns_params\030\211\001 \001(\010:\005false\022\037\n\020randomize_s" +
239 "earch\030g \001(\010:\005false\022+\n search_random_vari" +
240 "able_pool_size\030h \001(\003:\0010\022+\n\033push_all_task" +
241 "s_toward_start\030\206\002 \001(\010:\005false\022%\n\026use_opti" +
242 "onal_variables\030l \001(\010:\005false\022!\n\023use_exact" +
243 "_lp_reason\030m \001(\010:\004true\022\'\n\027use_combined_n" +
244 "o_overlap\030\205\001 \001(\010:\005false\022*\n\036at_most_one_m" +
245 "ax_expansion_size\030\216\002 \001(\005:\0013\022\"\n\023catch_sig" +
246 "int_signal\030\207\001 \001(\010:\004true\022!\n\022use_implied_b" +
247 "ounds\030\220\001 \001(\010:\004true\022\"\n\022polish_lp_solution" +
248 "\030\257\001 \001(\010:\005false\022#\n\023lp_primal_tolerance\030\212\002" +
249 " \001(\001:\0051e-07\022!\n\021lp_dual_tolerance\030\213\002 \001(\001:" +
250 "\0051e-07\022 \n\021convert_intervals\030\261\001 \001(\010:\004true" +
251 "\022\032\n\016symmetry_level\030\267\001 \001(\005:\0012\022&\n\026new_line" +
252 "ar_propagation\030\340\001 \001(\010:\005false\022\037\n\021linear_s" +
253 "plit_size\030\200\002 \001(\005:\003100\022\036\n\023linearization_l" +
254 "evel\030Z \001(\005:\0011\022!\n\026boolean_encoding_level\030" +
255 "k \001(\005:\0011\022=\n0max_domain_size_when_encodin" +
256 "g_eq_neq_constraints\030\277\001 \001(\005:\00216\022\033\n\014max_n" +
257 "um_cuts\030[ \001(\005:\00510000\022\025\n\tcut_level\030\304\001 \001(\005" +
258 ":\0011\022*\n\033only_add_cuts_at_level_zero\030\\ \001(\010" +
259 ":\005false\022!\n\021add_objective_cut\030\305\001 \001(\010:\005fal" +
260 "se\022\031\n\013add_cg_cuts\030u \001(\010:\004true\022\032\n\014add_mir" +
261 "_cuts\030x \001(\010:\004true\022!\n\022add_zero_half_cuts\030" +
262 "\251\001 \001(\010:\004true\022\036\n\017add_clique_cuts\030\254\001 \001(\010:\004" +
263 "true\022\033\n\014add_rlt_cuts\030\227\002 \001(\010:\004true\022\"\n\025max" +
264 "_all_diff_cut_size\030\224\001 \001(\005:\00264\022\037\n\020add_lin" +
265 "_max_cuts\030\230\001 \001(\010:\004true\022)\n\034max_integer_ro" +
266 "unding_scaling\030w \001(\005:\003600\022\'\n\031add_lp_cons" +
267 "traints_lazily\030p \001(\010:\004true\022!\n\022root_lp_it" +
268 "erations\030\343\001 \001(\005:\0042000\0222\n$min_orthogonali" +
269 "ty_for_lp_constraints\030s \001(\001:\0040.05\022(\n\034max" +
270 "_cut_rounds_at_level_zero\030\232\001 \001(\005:\0011\022+\n\036m" +
271 "ax_consecutive_inactive_count\030y \001(\005:\003100" +
272 "\0220\n\032cut_max_active_count_value\030\233\001 \001(\001:\0131" +
273 "0000000000\022$\n\026cut_active_count_decay\030\234\001 " +
274 "\001(\001:\0030.8\022!\n\022cut_cleanup_target\030\235\001 \001(\005:\0041" +
275 "000\022&\n\032new_constraints_batch_size\030z \001(\005:" +
276 "\00250\022)\n\033exploit_integer_lp_solution\030^ \001(\010" +
277 ":\004true\022%\n\027exploit_all_lp_solution\030t \001(\010:" +
278 "\004true\022%\n\025exploit_best_solution\030\202\001 \001(\010:\005f" +
279 "alse\022+\n\033exploit_relaxation_solution\030\241\001 \001" +
280 "(\010:\005false\022 \n\021exploit_objective\030\203\001 \001(\010:\004t" +
281 "rue\022)\n\031detect_linearized_product\030\225\002 \001(\010:" +
282 "\005false\022\037\n\rmip_max_bound\030| \001(\001:\01010000000\022" +
283 "\032\n\017mip_var_scaling\030} \001(\001:\0011\022&\n\026mip_scale" +
284 "_large_domain\030\341\001 \001(\010:\005false\0220\n!mip_autom" +
285 "atically_scale_variables\030\246\001 \001(\010:\004true\022\035\n" +
286 "\ronly_solve_ip\030\336\001 \001(\010:\005false\022#\n\024mip_want" +
287 "ed_precision\030~ \001(\001:\0051e-06\022%\n\031mip_max_act" +
288 "ivity_exponent\030\177 \001(\005:\00253\022$\n\023mip_check_pr" +
289 "ecision\030\200\001 \001(\001:\0060.0001\022/\n mip_compute_tr" +
290 "ue_objective_bound\030\306\001 \001(\010:\004true\022\'\n\027mip_m" +
291 "ax_valid_magnitude\030\307\001 \001(\001:\0051e+20\022;\n+mip_" +
292 "treat_high_magnitude_bounds_as_infinity\030" +
293 "\226\002 \001(\010:\005false\022\"\n\022mip_drop_tolerance\030\350\001 \001" +
294 "(\001:\0051e-16\022\036\n\022mip_presolve_level\030\205\002 \001(\005:\001" +
295 "2\"H\n\rVariableOrder\022\014\n\010IN_ORDER\020\000\022\024\n\020IN_R" +
296 "EVERSE_ORDER\020\001\022\023\n\017IN_RANDOM_ORDER\020\002\"F\n\010P" +
297 "olarity\022\021\n\rPOLARITY_TRUE\020\000\022\022\n\016POLARITY_F" +
298 "ALSE\020\001\022\023\n\017POLARITY_RANDOM\020\002\"V\n\035ConflictM" +
299 "inimizationAlgorithm\022\010\n\004NONE\020\000\022\n\n\006SIMPLE" +
300 "\020\001\022\r\n\tRECURSIVE\020\002\022\020\n\014EXPERIMENTAL\020\003\"\340\001\n\031" +
301 "BinaryMinizationAlgorithm\022\032\n\026NO_BINARY_M" +
302 "INIMIZATION\020\000\022\035\n\031BINARY_MINIMIZATION_FIR" +
303 "ST\020\001\0227\n3BINARY_MINIMIZATION_FIRST_WITH_T" +
304 "RANSITIVE_REDUCTION\020\004\022)\n%BINARY_MINIMIZA" +
305 "TION_WITH_REACHABILITY\020\002\022$\n EXPERIMENTAL" +
306 "_BINARY_MINIMIZATION\020\003\"R\n\020ClauseProtecti" +
307 "on\022\023\n\017PROTECTION_NONE\020\000\022\025\n\021PROTECTION_AL" +
308 "WAYS\020\001\022\022\n\016PROTECTION_LBD\020\002\"5\n\016ClauseOrde" +
309 "ring\022\023\n\017CLAUSE_ACTIVITY\020\000\022\016\n\nCLAUSE_LBD\020" +
310 "\001\"\206\001\n\020RestartAlgorithm\022\016\n\nNO_RESTART\020\000\022\020" +
311 "\n\014LUBY_RESTART\020\001\022\035\n\031DL_MOVING_AVERAGE_RE" +
312 "START\020\002\022\036\n\032LBD_MOVING_AVERAGE_RESTART\020\003\022" +
313 "\021\n\rFIXED_RESTART\020\004\"t\n\025MaxSatAssumptionOr" +
314 "der\022\034\n\030DEFAULT_ASSUMPTION_ORDER\020\000\022\035\n\031ORD" +
315 "ER_ASSUMPTION_BY_DEPTH\020\001\022\036\n\032ORDER_ASSUMP" +
316 "TION_BY_WEIGHT\020\002\"o\n\035MaxSatStratification" +
317 "Algorithm\022\027\n\023STRATIFICATION_NONE\020\000\022\032\n\026ST" +
318 "RATIFICATION_DESCENT\020\001\022\031\n\025STRATIFICATION" +
319 "_ASCENT\020\002\"\341\001\n\017SearchBranching\022\024\n\020AUTOMAT" +
320 "IC_SEARCH\020\000\022\020\n\014FIXED_SEARCH\020\001\022\024\n\020PORTFOL" +
321 "IO_SEARCH\020\002\022\r\n\tLP_SEARCH\020\003\022\026\n\022PSEUDO_COS" +
322 "T_SEARCH\020\004\022\'\n#PORTFOLIO_WITH_QUICK_RESTA" +
323 "RT_SEARCH\020\005\022\017\n\013HINT_SEARCH\020\006\022\030\n\024PARTIAL_" +
324 "FIXED_SEARCH\020\007\022\025\n\021RANDOMIZED_SEARCH\020\010\"\270\001" +
325 "\n\027SharedTreeSplitStrategy\022\027\n\023SPLIT_STRAT" +
326 "EGY_AUTO\020\000\022\036\n\032SPLIT_STRATEGY_DISCREPANCY" +
327 "\020\001\022\037\n\033SPLIT_STRATEGY_OBJECTIVE_LB\020\002\022 \n\034S" +
328 "PLIT_STRATEGY_BALANCED_TREE\020\003\022!\n\035SPLIT_S" +
329 "TRATEGY_FIRST_PROPOSAL\020\004\"h\n\020FPRoundingMe" +
330 "thod\022\023\n\017NEAREST_INTEGER\020\000\022\016\n\nLOCK_BASED\020" +
331 "\001\022\025\n\021ACTIVE_LOCK_BASED\020\003\022\030\n\024PROPAGATION_" +
332 "ASSISTED\020\002B/\n\026com.google.ortools.satP\001\252\002" +
333 "\022Google.OrTools.Sat"
334 };
335 descriptor = com.google.protobuf.Descriptors.FileDescriptor
336 .internalBuildGeneratedFileFrom(descriptorData,
337 new com.google.protobuf.Descriptors.FileDescriptor[] {
338 });
339 internal_static_operations_research_sat_SatParameters_descriptor =
340 getDescriptor().getMessageTypes().get(0);
341 internal_static_operations_research_sat_SatParameters_fieldAccessorTable = new
342 com.google.protobuf.GeneratedMessageV3.FieldAccessorTable(
343 internal_static_operations_research_sat_SatParameters_descriptor,
344 new java.lang.String[] { "Name", "PreferredVariableOrder", "InitialPolarity", "UsePhaseSaving", "PolarityRephaseIncrement", "RandomPolarityRatio", "RandomBranchesRatio", "UseErwaHeuristic", "InitialVariablesActivity", "AlsoBumpVariablesInConflictReasons", "MinimizationAlgorithm", "BinaryMinimizationAlgorithm", "SubsumptionDuringConflictAnalysis", "ClauseCleanupPeriod", "ClauseCleanupTarget", "ClauseCleanupRatio", "ClauseCleanupProtection", "ClauseCleanupLbdBound", "ClauseCleanupOrdering", "PbCleanupIncrement", "PbCleanupRatio", "VariableActivityDecay", "MaxVariableActivityValue", "GlucoseMaxDecay", "GlucoseDecayIncrement", "GlucoseDecayIncrementPeriod", "ClauseActivityDecay", "MaxClauseActivityValue", "RestartAlgorithms", "DefaultRestartAlgorithms", "RestartPeriod", "RestartRunningWindowSize", "RestartDlAverageRatio", "RestartLbdAverageRatio", "UseBlockingRestart", "BlockingRestartWindowSize", "BlockingRestartMultiplier", "NumConflictsBeforeStrategyChanges", "StrategyChangeIncreaseRatio", "MaxTimeInSeconds", "MaxDeterministicTime", "MaxNumberOfConflicts", "MaxMemoryInMb", "AbsoluteGapLimit", "RelativeGapLimit", "RandomSeed", "PermuteVariableRandomly", "PermutePresolveConstraintOrder", "UseAbslRandom", "LogSearchProgress", "LogSubsolverStatistics", "LogPrefix", "LogToStdout", "LogToResponse", "UsePbResolution", "MinimizeReductionDuringPbResolution", "CountAssumptionLevelsInLbd", "PresolveBveThreshold", "PresolveBveClauseWeight", "ProbingDeterministicTimeLimit", "PresolveProbingDeterministicTimeLimit", "PresolveBlockedClause", "PresolveUseBva", "PresolveBvaThreshold", "MaxPresolveIterations", "CpModelPresolve", "CpModelProbingLevel", "CpModelUseSatPresolve", "DetectTableWithCost", "TableCompressionLevel", "ExpandAlldiffConstraints", "ExpandReservoirConstraints", "DisableConstraintExpansion", "EncodeComplexLinearConstraintWithInteger", "MergeNoOverlapWorkLimit", "MergeAtMostOneWorkLimit", "PresolveSubstitutionLevel", "PresolveExtractIntegerEnforcement", "PresolveInclusionWorkLimit", "IgnoreNames", "InferAllDiffs", "FindBigLinearOverlap", "UseSatInprocessing", "InprocessingDtimeRatio", "InprocessingProbingDtime", "InprocessingMinimizationDtime", "NumWorkers", "NumSearchWorkers", "MinNumLnsWorkers", "Subsolvers", "ExtraSubsolvers", "IgnoreSubsolvers", "SubsolverParams", "InterleaveSearch", "InterleaveBatchSize", "ShareObjectiveBounds", "ShareLevelZeroBounds", "ShareBinaryClauses", "DebugPostsolveWithFullSolver", "DebugMaxNumPresolveOperations", "DebugCrashOnBadHint", "UseOptimizationHints", "CoreMinimizationLevel", "FindMultipleCores", "CoverOptimization", "MaxSatAssumptionOrder", "MaxSatReverseAssumptionOrder", "MaxSatStratification", "PropagationLoopDetectionFactor", "UsePrecedencesInDisjunctiveConstraint", "MaxSizeToCreatePrecedenceLiteralsInDisjunctive", "UseStrongPropagationInDisjunctive", "UseDynamicPrecedenceInDisjunctive", "UseDynamicPrecedenceInCumulative", "UseOverloadCheckerInCumulative", "UseTimetableEdgeFindingInCumulative", "MaxNumIntervalsForTimetableEdgeFinding", "UseHardPrecedencesInCumulative", "ExploitAllPrecedences", "UseDisjunctiveConstraintInCumulative", "UseTimetablingInNoOverlap2D", "UseEnergeticReasoningInNoOverlap2D", "UseAreaEnergeticReasoningInNoOverlap2D", "MaxPairsPairwiseReasoningInNoOverlap2D", "UseDualSchedulingHeuristics", "SearchBranching", "HintConflictLimit", "RepairHint", "FixVariablesToTheirHintedValue", "UseProbingSearch", "UseExtendedProbing", "ProbingNumCombinationsLimit", "UseShavingInProbingSearch", "ShavingSearchDeterministicTime", "UseObjectiveLbSearch", "UseObjectiveShavingSearch", "PseudoCostReliabilityThreshold", "OptimizeWithCore", "OptimizeWithLbTreeSearch", "BinarySearchNumConflicts", "OptimizeWithMaxHs", "UseFeasibilityJump", "TestFeasibilityJump", "FeasibilityJumpDecay", "FeasibilityJumpLinearizationLevel", "FeasibilityJumpRestartFactor", "FeasibilityJumpVarRandomizationProbability", "FeasibilityJumpVarPerburbationRangeRatio", "FeasibilityJumpEnableRestarts", "FeasibilityJumpMaxExpandedConstraintSize", "NumViolationLs", "ViolationLsPerturbationPeriod", "ViolationLsCompoundMoveProbability", "SharedTreeNumWorkers", "UseSharedTreeSearch", "SharedTreeWorkerObjectiveSplitProbability", "SharedTreeMaxNodesPerWorker", "SharedTreeSplitStrategy", "EnumerateAllSolutions", "KeepAllFeasibleSolutionsInPresolve", "FillTightenedDomainsInResponse", "FillAdditionalSolutionsInResponse", "InstantiateAllVariables", "AutoDetectGreaterThanAtLeastOneOf", "StopAfterFirstSolution", "StopAfterPresolve", "StopAfterRootPropagation", "UseLnsOnly", "SolutionPoolSize", "UseRinsLns", "UseFeasibilityPump", "UseLbRelaxLns", "FpRounding", "DiversifyLnsParams", "RandomizeSearch", "SearchRandomVariablePoolSize", "PushAllTasksTowardStart", "UseOptionalVariables", "UseExactLpReason", "UseCombinedNoOverlap", "AtMostOneMaxExpansionSize", "CatchSigintSignal", "UseImpliedBounds", "PolishLpSolution", "LpPrimalTolerance", "LpDualTolerance", "ConvertIntervals", "SymmetryLevel", "NewLinearPropagation", "LinearSplitSize", "LinearizationLevel", "BooleanEncodingLevel", "MaxDomainSizeWhenEncodingEqNeqConstraints", "MaxNumCuts", "CutLevel", "OnlyAddCutsAtLevelZero", "AddObjectiveCut", "AddCgCuts", "AddMirCuts", "AddZeroHalfCuts", "AddCliqueCuts", "AddRltCuts", "MaxAllDiffCutSize", "AddLinMaxCuts", "MaxIntegerRoundingScaling", "AddLpConstraintsLazily", "RootLpIterations", "MinOrthogonalityForLpConstraints", "MaxCutRoundsAtLevelZero", "MaxConsecutiveInactiveCount", "CutMaxActiveCountValue", "CutActiveCountDecay", "CutCleanupTarget", "NewConstraintsBatchSize", "ExploitIntegerLpSolution", "ExploitAllLpSolution", "ExploitBestSolution", "ExploitRelaxationSolution", "ExploitObjective", "DetectLinearizedProduct", "MipMaxBound", "MipVarScaling", "MipScaleLargeDomain", "MipAutomaticallyScaleVariables", "OnlySolveIp", "MipWantedPrecision", "MipMaxActivityExponent", "MipCheckPrecision", "MipComputeTrueObjectiveBound", "MipMaxValidMagnitude", "MipTreatHighMagnitudeBoundsAsInfinity", "MipDropTolerance", "MipPresolveLevel", });
345 }
346
347 // @@protoc_insertion_point(outer_class_scope)
348}
static void registerAllExtensions(com.google.protobuf.ExtensionRegistryLite registry)
static void registerAllExtensions(com.google.protobuf.ExtensionRegistry registry)
static com.google.protobuf.Descriptors.FileDescriptor getDescriptor()