Google OR-Tools v9.15
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// NO CHECKED-IN PROTOBUF GENCODE
3// source: ortools/sat/sat_parameters.proto
4// Protobuf Java Version: 4.33.1
5
6package com.google.ortools.sat;
7
8@com.google.protobuf.Generated
9public final class SatParametersOuterClass extends com.google.protobuf.GeneratedFile {
10 private SatParametersOuterClass() {}
11 static {
12 com.google.protobuf.RuntimeVersion.validateProtobufGencodeVersion(
13 com.google.protobuf.RuntimeVersion.RuntimeDomain.PUBLIC,
14 /* major= */ 4,
15 /* minor= */ 33,
16 /* patch= */ 1,
17 /* suffix= */ "",
18 "SatParametersOuterClass");
19 }
20 public static void registerAllExtensions(
21 com.google.protobuf.ExtensionRegistryLite registry) {
22 }
23
24 public static void registerAllExtensions(
25 com.google.protobuf.ExtensionRegistry registry) {
27 (com.google.protobuf.ExtensionRegistryLite) registry);
28 }
29 static final com.google.protobuf.Descriptors.Descriptor
30 internal_static_operations_research_sat_SatParameters_descriptor;
31 static final
32 com.google.protobuf.GeneratedMessage.FieldAccessorTable
33 internal_static_operations_research_sat_SatParameters_fieldAccessorTable;
34
35 public static com.google.protobuf.Descriptors.FileDescriptor
37 return descriptor;
38 }
39 private static com.google.protobuf.Descriptors.FileDescriptor
40 descriptor;
41 static {
42 java.lang.String[] descriptorData = {
43 "\n ortools/sat/sat_parameters.proto\022\027oper" +
44 "ations_research.sat\"\264u\n\rSatParameters\022\017\n" +
45 "\004name\030\253\001 \001(\t:\000\022`\n\030preferred_variable_ord" +
46 "er\030\001 \001(\01624.operations_research.sat.SatPa" +
47 "rameters.VariableOrder:\010IN_ORDER\022Y\n\020init" +
48 "ial_polarity\030\002 \001(\0162/.operations_research" +
49 ".sat.SatParameters.Polarity:\016POLARITY_FA" +
50 "LSE\022\036\n\020use_phase_saving\030, \001(\010:\004true\022)\n\032p" +
51 "olarity_rephase_increment\030\250\001 \001(\005:\0041000\022)" +
52 "\n\031polarity_exploit_ls_hints\030\265\002 \001(\010:\005fals" +
53 "e\022 \n\025random_polarity_ratio\030- \001(\001:\0010\022 \n\025r" +
54 "andom_branches_ratio\030 \001(\001:\0010\022!\n\022use_erw" +
55 "a_heuristic\030K \001(\010:\005false\022%\n\032initial_vari" +
56 "ables_activity\030L \001(\001:\0010\0226\n\'also_bump_var" +
57 "iables_in_conflict_reasons\030M \001(\010:\005false\022" +
58 "o\n\026minimization_algorithm\030\004 \001(\0162D.operat" +
59 "ions_research.sat.SatParameters.Conflict" +
60 "MinimizationAlgorithm:\tRECURSIVE\022\223\001\n\035bin" +
61 "ary_minimization_algorithm\030\" \001(\0162@.opera" +
62 "tions_research.sat.SatParameters.BinaryM" +
63 "inizationAlgorithm:*BINARY_MINIMIZATION_" +
64 "FROM_UIP_AND_DECISIONS\0222\n$subsumption_du" +
65 "ring_conflict_analysis\0308 \001(\010:\004true\0229\n*ex" +
66 "tra_subsumption_during_conflict_analysis" +
67 "\030\337\002 \001(\010:\004true\022<\n-decision_subsumption_du" +
68 "ring_conflict_analysis\030\341\002 \001(\010:\004true\022,\n e" +
69 "agerly_subsume_last_n_conflicts\030\327\002 \001(\005:\001" +
70 "4\022*\n\033subsume_during_vivification\030\343\002 \001(\010:" +
71 "\004true\022.\n\036use_chronological_backtracking\030" +
72 "\312\002 \001(\010:\005false\022 \n\023max_backjump_levels\030\313\002 " +
73 "\001(\005:\00250\0224\n%chronological_backtrack_min_c" +
74 "onflicts\030\314\002 \001(\005:\0041000\022$\n\025clause_cleanup_" +
75 "period\030\013 \001(\005:\00510000\022+\n\037clause_cleanup_pe" +
76 "riod_increment\030\321\002 \001(\005:\0010\022 \n\025clause_clean" +
77 "up_target\030\r \001(\005:\0010\022\"\n\024clause_cleanup_rat" +
78 "io\030\276\001 \001(\001:\0030.5\022#\n\030clause_cleanup_lbd_bou" +
79 "nd\030; \001(\005:\0015\022$\n\030clause_cleanup_lbd_tier1\030" +
80 "\335\002 \001(\005:\0010\022$\n\030clause_cleanup_lbd_tier2\030\336\002" +
81 " \001(\005:\0010\022g\n\027clause_cleanup_ordering\030< \001(\016" +
82 "25.operations_research.sat.SatParameters" +
83 ".ClauseOrdering:\017CLAUSE_ACTIVITY\022!\n\024pb_c" +
84 "leanup_increment\030. \001(\005:\003200\022\035\n\020pb_cleanu" +
85 "p_ratio\030/ \001(\001:\0030.5\022$\n\027variable_activity_" +
86 "decay\030\017 \001(\001:\0030.8\022+\n\033max_variable_activit" +
87 "y_value\030\020 \001(\001:\0061e+100\022\037\n\021glucose_max_dec" +
88 "ay\030\026 \001(\001:\0040.95\022%\n\027glucose_decay_incremen" +
89 "t\030\027 \001(\001:\0040.01\022,\n\036glucose_decay_increment" +
90 "_period\030\030 \001(\005:\0045000\022$\n\025clause_activity_d" +
91 "ecay\030\021 \001(\001:\0050.999\022(\n\031max_clause_activity" +
92 "_value\030\022 \001(\001:\0051e+20\022S\n\022restart_algorithm" +
93 "s\030= \003(\01627.operations_research.sat.SatPar" +
94 "ameters.RestartAlgorithm\022e\n\032default_rest" +
95 "art_algorithms\030F \001(\t:ALUBY_RESTART,LBD_M" +
96 "OVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_" +
97 "RESTART\022\032\n\016restart_period\030\036 \001(\005:\00250\022\'\n\033r" +
98 "estart_running_window_size\030> \001(\005:\00250\022#\n\030" +
99 "restart_dl_average_ratio\030? \001(\001:\0011\022$\n\031res" +
100 "tart_lbd_average_ratio\030G \001(\001:\0011\022#\n\024use_b" +
101 "locking_restart\030@ \001(\010:\005false\022*\n\034blocking" +
102 "_restart_window_size\030A \001(\005:\0045000\022(\n\033bloc" +
103 "king_restart_multiplier\030B \001(\001:\0031.4\0220\n%nu" +
104 "m_conflicts_before_strategy_changes\030D \001(" +
105 "\005:\0010\022)\n\036strategy_change_increase_ratio\030E" +
106 " \001(\001:\0010\022 \n\023max_time_in_seconds\030$ \001(\001:\003in" +
107 "f\022#\n\026max_deterministic_time\030C \001(\001:\003inf\022)" +
108 "\n\035max_num_deterministic_batches\030\243\002 \001(\005:\001" +
109 "0\0224\n\027max_number_of_conflicts\030% \001(\003:\0239223" +
110 "372036854775807\022\037\n\020max_memory_in_mb\030( \001(" +
111 "\003:\00510000\022#\n\022absolute_gap_limit\030\237\001 \001(\001:\0060" +
112 ".0001\022\036\n\022relative_gap_limit\030\240\001 \001(\001:\0010\022\026\n" +
113 "\013random_seed\030\037 \001(\005:\0011\022)\n\031permute_variabl" +
114 "e_randomly\030\262\001 \001(\010:\005false\0221\n!permute_pres" +
115 "olve_constraint_order\030\263\001 \001(\010:\005false\022\037\n\017u" +
116 "se_absl_random\030\264\001 \001(\010:\005false\022\"\n\023log_sear" +
117 "ch_progress\030) \001(\010:\005false\022(\n\030log_subsolve" +
118 "r_statistics\030\275\001 \001(\010:\005false\022\025\n\nlog_prefix" +
119 "\030\271\001 \001(\t:\000\022\034\n\rlog_to_stdout\030\272\001 \001(\010:\004true\022" +
120 "\037\n\017log_to_response\030\273\001 \001(\010:\005false\022 \n\021use_" +
121 "pb_resolution\030+ \001(\010:\005false\0226\n\'minimize_r" +
122 "eduction_during_pb_resolution\0300 \001(\010:\005fal" +
123 "se\022,\n\036count_assumption_levels_in_lbd\0301 \001" +
124 "(\010:\004true\022#\n\026presolve_bve_threshold\0306 \001(\005" +
125 ":\003500\022,\n\034filter_sat_postsolve_clauses\030\304\002" +
126 " \001(\010:\005false\022%\n\032presolve_bve_clause_weigh" +
127 "t\0307 \001(\005:\0013\022,\n probing_deterministic_time" +
128 "_limit\030\342\001 \001(\001:\0011\0225\n)presolve_probing_det" +
129 "erministic_time_limit\0309 \001(\001:\00230\022%\n\027preso" +
130 "lve_blocked_clause\030X \001(\010:\004true\022\036\n\020presol" +
131 "ve_use_bva\030H \001(\010:\004true\022!\n\026presolve_bva_t" +
132 "hreshold\030I \001(\005:\0011\022#\n\027max_presolve_iterat" +
133 "ions\030\212\001 \001(\005:\0013\022\037\n\021cp_model_presolve\030V \001(" +
134 "\010:\004true\022!\n\026cp_model_probing_level\030n \001(\005:" +
135 "\0012\022\'\n\031cp_model_use_sat_presolve\030] \001(\010:\004t" +
136 "rue\0221\n!load_at_most_ones_in_sat_presolve" +
137 "\030\317\002 \001(\010:\005false\022+\n\034remove_fixed_variables" +
138 "_early\030\266\002 \001(\010:\004true\022&\n\026detect_table_with" +
139 "_cost\030\330\001 \001(\010:\005false\022#\n\027table_compression" +
140 "_level\030\331\001 \001(\005:\0012\022*\n\032expand_alldiff_const" +
141 "raints\030\252\001 \001(\010:\005false\022%\n\027max_alldiff_doma" +
142 "in_size\030\300\002 \001(\005:\003256\022+\n\034expand_reservoir_" +
143 "constraints\030\266\001 \001(\010:\004true\0221\n%max_domain_s" +
144 "ize_for_linear2_expansion\030\324\002 \001(\005:\0018\022.\n\036e" +
145 "xpand_reservoir_using_circuit\030\240\002 \001(\010:\005fa" +
146 "lse\022.\n\036encode_cumulative_as_reservoir\030\237\002" +
147 " \001(\010:\005false\022*\n\036max_lin_max_size_for_expa" +
148 "nsion\030\230\002 \001(\005:\0010\022,\n\034disable_constraint_ex" +
149 "pansion\030\265\001 \001(\010:\005false\022=\n-encode_complex_" +
150 "linear_constraint_with_integer\030\337\001 \001(\010:\005f" +
151 "alse\0223\n\033merge_no_overlap_work_limit\030\221\001 \001" +
152 "(\001:\r1000000000000\0220\n\034merge_at_most_one_w" +
153 "ork_limit\030\222\001 \001(\001:\t100000000\022\'\n\033presolve_" +
154 "substitution_level\030\223\001 \001(\005:\0011\0224\n$presolve" +
155 "_extract_integer_enforcement\030\256\001 \001(\010:\005fal" +
156 "se\0221\n\035presolve_inclusion_work_limit\030\311\001 \001" +
157 "(\003:\t100000000\022\033\n\014ignore_names\030\312\001 \001(\010:\004tr" +
158 "ue\022\036\n\017infer_all_diffs\030\351\001 \001(\010:\004true\022&\n\027fi" +
159 "nd_big_linear_overlap\030\352\001 \001(\010:\004true\0220\n!fi" +
160 "nd_clauses_that_are_exactly_one\030\315\002 \001(\010:\004" +
161 "true\022#\n\024use_sat_inprocessing\030\243\001 \001(\010:\004tru" +
162 "e\022&\n\030inprocessing_dtime_ratio\030\221\002 \001(\001:\0030." +
163 "2\022&\n\032inprocessing_probing_dtime\030\222\002 \001(\001:\001" +
164 "1\022+\n\037inprocessing_minimization_dtime\030\223\002 " +
165 "\001(\001:\0011\022>\n/inprocessing_minimization_use_" +
166 "conflict_analysis\030\251\002 \001(\010:\004true\022;\n+inproc" +
167 "essing_minimization_use_all_orderings\030\252\002" +
168 " \001(\010:\005false\0222\n#inprocessing_use_congruen" +
169 "ce_closure\030\326\002 \001(\010:\004true\022-\n\035inprocessing_" +
170 "use_sat_sweeping\030\342\002 \001(\010:\005false\022\027\n\013num_wo" +
171 "rkers\030\316\001 \001(\005:\0010\022\035\n\022num_search_workers\030d " +
172 "\001(\005:\0010\022\037\n\023num_full_subsolvers\030\246\002 \001(\005:\0010\022" +
173 "\023\n\nsubsolvers\030\317\001 \003(\t\022\031\n\020extra_subsolvers" +
174 "\030\333\001 \003(\t\022\032\n\021ignore_subsolvers\030\321\001 \003(\t\022\032\n\021f" +
175 "ilter_subsolvers\030\245\002 \003(\t\022A\n\020subsolver_par" +
176 "ams\030\322\001 \003(\0132&.operations_research.sat.Sat" +
177 "Parameters\022!\n\021interleave_search\030\210\001 \001(\010:\005" +
178 "false\022!\n\025interleave_batch_size\030\206\001 \001(\005:\0010" +
179 "\022$\n\026share_objective_bounds\030q \001(\010:\004true\022%" +
180 "\n\027share_level_zero_bounds\030r \001(\010:\004true\022$\n" +
181 "\024share_linear2_bounds\030\306\002 \001(\010:\005false\022#\n\024s" +
182 "hare_binary_clauses\030\313\001 \001(\010:\004true\022!\n\022shar" +
183 "e_glue_clauses\030\235\002 \001(\010:\004true\022&\n\027minimize_" +
184 "shared_clauses\030\254\002 \001(\010:\004true\022$\n\030share_glu" +
185 "e_clauses_dtime\030\302\002 \001(\001:\0011\022 \n\020check_lrat_" +
186 "proof\030\330\002 \001(\010:\005false\022\'\n\027check_merged_lrat" +
187 "_proof\030\340\002 \001(\010:\005false\022!\n\021output_lrat_proo" +
188 "f\030\331\002 \001(\010:\005false\022 \n\020check_drat_proof\030\332\002 \001" +
189 "(\010:\005false\022!\n\021output_drat_proof\030\333\002 \001(\010:\005f" +
190 "alse\022&\n\030max_drat_time_in_seconds\030\334\002 \001(\001:" +
191 "\003inf\0220\n debug_postsolve_with_full_solver" +
192 "\030\242\001 \001(\010:\005false\022-\n!debug_max_num_presolve" +
193 "_operations\030\227\001 \001(\005:\0010\022\'\n\027debug_crash_on_" +
194 "bad_hint\030\303\001 \001(\010:\005false\0223\n#debug_crash_if" +
195 "_presolve_breaks_hint\030\262\002 \001(\010:\005false\022/\n\037d" +
196 "ebug_crash_if_lrat_check_fails\030\323\002 \001(\010:\005f" +
197 "alse\022$\n\026use_optimization_hints\030# \001(\010:\004tr" +
198 "ue\022\"\n\027core_minimization_level\0302 \001(\005:\0012\022!" +
199 "\n\023find_multiple_cores\030T \001(\010:\004true\022 \n\022cov" +
200 "er_optimization\030Y \001(\010:\004true\022x\n\030max_sat_a" +
201 "ssumption_order\0303 \001(\0162<.operations_resea" +
202 "rch.sat.SatParameters.MaxSatAssumptionOr" +
203 "der:\030DEFAULT_ASSUMPTION_ORDER\022/\n max_sat" +
204 "_reverse_assumption_order\0304 \001(\010:\005false\022|" +
205 "\n\026max_sat_stratification\0305 \001(\0162D.operati" +
206 "ons_research.sat.SatParameters.MaxSatStr" +
207 "atificationAlgorithm:\026STRATIFICATION_DES" +
208 "CENT\022.\n!propagation_loop_detection_facto" +
209 "r\030\335\001 \001(\001:\00210\0227\n)use_precedences_in_disju" +
210 "nctive_constraint\030J \001(\010:\004true\0223\n!transit" +
211 "ive_precedences_work_limit\030\307\002 \001(\005:\00710000" +
212 "00\022B\n5max_size_to_create_precedence_lite" +
213 "rals_in_disjunctive\030\345\001 \001(\005:\00260\0225\n%use_st" +
214 "rong_propagation_in_disjunctive\030\346\001 \001(\010:\005" +
215 "false\0225\n%use_dynamic_precedence_in_disju" +
216 "nctive\030\207\002 \001(\010:\005false\0224\n$use_dynamic_prec" +
217 "edence_in_cumulative\030\214\002 \001(\010:\005false\0221\n\"us" +
218 "e_overload_checker_in_cumulative\030N \001(\010:\005" +
219 "false\0227\n\'use_conservative_scale_overload" +
220 "_checker\030\236\002 \001(\010:\005false\0227\n(use_timetable_" +
221 "edge_finding_in_cumulative\030O \001(\010:\005false\022" +
222 ":\n,max_num_intervals_for_timetable_edge_" +
223 "finding\030\204\002 \001(\005:\003100\0222\n\"use_hard_preceden" +
224 "ces_in_cumulative\030\327\001 \001(\010:\005false\022\'\n\027explo" +
225 "it_all_precedences\030\334\001 \001(\010:\005false\0226\n(use_" +
226 "disjunctive_constraint_in_cumulative\030P \001" +
227 "(\010:\004true\0222\n%no_overlap_2d_boolean_relati" +
228 "ons_limit\030\301\002 \001(\005:\00210\0220\n use_timetabling_" +
229 "in_no_overlap_2d\030\310\001 \001(\010:\005false\0228\n(use_en" +
230 "ergetic_reasoning_in_no_overlap_2d\030\325\001 \001(" +
231 "\010:\005false\022=\n-use_area_energetic_reasoning" +
232 "_in_no_overlap_2d\030\217\002 \001(\010:\005false\0227\n\'use_t" +
233 "ry_edge_reasoning_in_no_overlap_2d\030\253\002 \001(" +
234 "\010:\005false\022<\n-max_pairs_pairwise_reasoning" +
235 "_in_no_overlap_2d\030\224\002 \001(\005:\0041250\022B\n6maximu" +
236 "m_regions_to_split_in_disconnected_no_ov" +
237 "erlap_2d\030\273\002 \001(\005:\0010\0228\n)use_linear3_for_no" +
238 "_overlap_2d_precedences\030\303\002 \001(\010:\004true\022-\n\036" +
239 "use_dual_scheduling_heuristics\030\326\001 \001(\010:\004t" +
240 "rue\022-\n\035use_all_different_for_circuit\030\267\002 " +
241 "\001(\010:\005false\022=\n1routing_cut_subset_size_fo" +
242 "r_binary_relation_bound\030\270\002 \001(\005:\0010\022C\n7rou" +
243 "ting_cut_subset_size_for_tight_binary_re" +
244 "lation_bound\030\271\002 \001(\005:\0010\022C\n7routing_cut_su" +
245 "bset_size_for_exact_binary_relation_boun" +
246 "d\030\274\002 \001(\005:\0018\022<\n0routing_cut_subset_size_f" +
247 "or_shortest_paths_bound\030\276\002 \001(\005:\0018\022(\n\025rou" +
248 "ting_cut_dp_effort\030\272\002 \001(\001:\01010000000\0222\n&r" +
249 "outing_cut_max_infeasible_path_length\030\275\002" +
250 " \001(\005:\0016\022b\n\020search_branching\030R \001(\01626.oper" +
251 "ations_research.sat.SatParameters.Search" +
252 "Branching:\020AUTOMATIC_SEARCH\022 \n\023hint_conf" +
253 "lict_limit\030\231\001 \001(\005:\00210\022\033\n\013repair_hint\030\247\001 " +
254 "\001(\010:\005false\0223\n#fix_variables_to_their_hin" +
255 "ted_value\030\300\001 \001(\010:\005false\022\"\n\022use_probing_s" +
256 "earch\030\260\001 \001(\010:\005false\022#\n\024use_extended_prob" +
257 "ing\030\215\002 \001(\010:\004true\022.\n\036probing_num_combinat" +
258 "ions_limit\030\220\002 \001(\005:\00520000\022<\n,shaving_dete" +
259 "rministic_time_in_probing_search\030\314\001 \001(\001:" +
260 "\0050.001\022/\n!shaving_search_deterministic_t" +
261 "ime\030\315\001 \001(\001:\0030.1\022%\n\030shaving_search_thresh" +
262 "old\030\242\002 \001(\003:\00264\022\'\n\027use_objective_lb_searc" +
263 "h\030\344\001 \001(\010:\005false\022,\n\034use_objective_shaving" +
264 "_search\030\375\001 \001(\010:\005false\022$\n\027variables_shavi" +
265 "ng_level\030\241\002 \001(\005:\002-1\022.\n!pseudo_cost_relia" +
266 "bility_threshold\030{ \001(\003:\003100\022!\n\022optimize_" +
267 "with_core\030S \001(\010:\005false\022,\n\034optimize_with_" +
268 "lb_tree_search\030\274\001 \001(\010:\005false\022/\n\037save_lp_" +
269 "basis_in_lb_tree_search\030\234\002 \001(\010:\005false\022\'\n" +
270 "\033binary_search_num_conflicts\030c \001(\005:\002-1\022#" +
271 "\n\024optimize_with_max_hs\030U \001(\010:\005false\022#\n\024u" +
272 "se_feasibility_jump\030\211\002 \001(\010:\004true\022\033\n\013use_" +
273 "ls_only\030\360\001 \001(\010:\005false\022%\n\026feasibility_jum" +
274 "p_decay\030\362\001 \001(\001:\0040.95\0220\n$feasibility_jump" +
275 "_linearization_level\030\201\002 \001(\005:\0012\022+\n\037feasib" +
276 "ility_jump_restart_factor\030\202\002 \001(\005:\0011\022*\n\034f" +
277 "easibility_jump_batch_dtime\030\244\002 \001(\001:\0030.1\022" +
278 "=\n.feasibility_jump_var_randomization_pr" +
279 "obability\030\367\001 \001(\001:\0040.05\022;\n-feasibility_ju" +
280 "mp_var_perburbation_range_ratio\030\370\001 \001(\001:\003" +
281 "0.2\022/\n feasibility_jump_enable_restarts\030" +
282 "\372\001 \001(\010:\004true\022;\n-feasibility_jump_max_exp" +
283 "anded_constraint_size\030\210\002 \001(\005:\003500\022\034\n\020num" +
284 "_violation_ls\030\364\001 \001(\005:\0010\022.\n violation_ls_" +
285 "perturbation_period\030\371\001 \001(\005:\003100\0224\n&viola" +
286 "tion_ls_compound_move_probability\030\203\002 \001(\001" +
287 ":\0030.5\022$\n\027shared_tree_num_workers\030\353\001 \001(\005:" +
288 "\002-1\022&\n\026use_shared_tree_search\030\354\001 \001(\010:\005fa" +
289 "lse\0227\n+shared_tree_worker_min_restarts_p" +
290 "er_subtree\030\232\002 \001(\005:\0011\0226\n\'shared_tree_work" +
291 "er_enable_trail_sharing\030\247\002 \001(\010:\004true\0226\n\'" +
292 "shared_tree_worker_enable_phase_sharing\030" +
293 "\260\002 \001(\010:\004true\022.\n\"shared_tree_open_leaves_" +
294 "per_worker\030\231\002 \001(\001:\0012\0220\n shared_tree_max_" +
295 "nodes_per_worker\030\356\001 \001(\005:\00510000\022x\n\032shared" +
296 "_tree_split_strategy\030\357\001 \001(\0162>.operations" +
297 "_research.sat.SatParameters.SharedTreeSp" +
298 "litStrategy:\023SPLIT_STRATEGY_AUTO\022)\n\035shar" +
299 "ed_tree_balance_tolerance\030\261\002 \001(\005:\0011\022)\n\033s" +
300 "hared_tree_split_min_dtime\030\310\002 \001(\001:\0030.1\022&" +
301 "\n\027enumerate_all_solutions\030W \001(\010:\005false\0227" +
302 "\n\'keep_all_feasible_solutions_in_presolv" +
303 "e\030\255\001 \001(\010:\005false\0222\n\"fill_tightened_domain" +
304 "s_in_response\030\204\001 \001(\010:\005false\0225\n%fill_addi" +
305 "tional_solutions_in_response\030\302\001 \001(\010:\005fal" +
306 "se\022\'\n\031instantiate_all_variables\030j \001(\010:\004t" +
307 "rue\0226\n(auto_detect_greater_than_at_least" +
308 "_one_of\030_ \001(\010:\004true\022(\n\031stop_after_first_" +
309 "solution\030b \001(\010:\005false\022#\n\023stop_after_pres" +
310 "olve\030\225\001 \001(\010:\005false\022+\n\033stop_after_root_pr" +
311 "opagation\030\374\001 \001(\010:\005false\022$\n\026lns_initial_d" +
312 "ifficulty\030\263\002 \001(\001:\0030.5\022-\n\037lns_initial_det" +
313 "erministic_limit\030\264\002 \001(\001:\0030.1\022\026\n\007use_lns\030" +
314 "\233\002 \001(\010:\004true\022\033\n\014use_lns_only\030e \001(\010:\005fals" +
315 "e\022\036\n\022solution_pool_size\030\301\001 \001(\005:\0013\022*\n\035sol" +
316 "ution_pool_diversity_limit\030\311\002 \001(\005:\00210\022!\n" +
317 "\025alternative_pool_size\030\305\002 \001(\005:\0011\022\033\n\014use_" +
318 "rins_lns\030\201\001 \001(\010:\004true\022#\n\024use_feasibility" +
319 "_pump\030\244\001 \001(\010:\004true\022\037\n\020use_lb_relax_lns\030\377" +
320 "\001 \001(\010:\004true\022+\n\036lb_relax_num_workers_thre" +
321 "shold\030\250\002 \001(\005:\00216\022c\n\013fp_rounding\030\245\001 \001(\01627" +
322 ".operations_research.sat.SatParameters.F" +
323 "PRoundingMethod:\024PROPAGATION_ASSISTED\022$\n" +
324 "\024diversify_lns_params\030\211\001 \001(\010:\005false\022\037\n\020r" +
325 "andomize_search\030g \001(\010:\005false\022+\n search_r" +
326 "andom_variable_pool_size\030h \001(\003:\0010\022+\n\033pus" +
327 "h_all_tasks_toward_start\030\206\002 \001(\010:\005false\022%" +
328 "\n\026use_optional_variables\030l \001(\010:\005false\022!\n" +
329 "\023use_exact_lp_reason\030m \001(\010:\004true\022\'\n\027use_" +
330 "combined_no_overlap\030\205\001 \001(\010:\005false\022*\n\036at_" +
331 "most_one_max_expansion_size\030\216\002 \001(\005:\0013\022\"\n" +
332 "\023catch_sigint_signal\030\207\001 \001(\010:\004true\022!\n\022use" +
333 "_implied_bounds\030\220\001 \001(\010:\004true\022\"\n\022polish_l" +
334 "p_solution\030\257\001 \001(\010:\005false\022#\n\023lp_primal_to" +
335 "lerance\030\212\002 \001(\001:\0051e-07\022!\n\021lp_dual_toleran" +
336 "ce\030\213\002 \001(\001:\0051e-07\022 \n\021convert_intervals\030\261\001" +
337 " \001(\010:\004true\022\032\n\016symmetry_level\030\267\001 \001(\005:\0012\022\"" +
338 "\n\022use_symmetry_in_lp\030\255\002 \001(\010:\005false\022)\n\031ke" +
339 "ep_symmetry_in_presolve\030\257\002 \001(\010:\005false\0227\n" +
340 "+symmetry_detection_deterministic_time_l" +
341 "imit\030\256\002 \001(\001:\0011\022%\n\026new_linear_propagation" +
342 "\030\340\001 \001(\010:\004true\022\037\n\021linear_split_size\030\200\002 \001(" +
343 "\005:\003100\022\036\n\023linearization_level\030Z \001(\005:\0011\022!" +
344 "\n\026boolean_encoding_level\030k \001(\005:\0011\022=\n0max" +
345 "_domain_size_when_encoding_eq_neq_constr" +
346 "aints\030\277\001 \001(\005:\00216\022\033\n\014max_num_cuts\030[ \001(\005:\005" +
347 "10000\022\025\n\tcut_level\030\304\001 \001(\005:\0011\022*\n\033only_add" +
348 "_cuts_at_level_zero\030\\ \001(\010:\005false\022!\n\021add_" +
349 "objective_cut\030\305\001 \001(\010:\005false\022\031\n\013add_cg_cu" +
350 "ts\030u \001(\010:\004true\022\032\n\014add_mir_cuts\030x \001(\010:\004tr" +
351 "ue\022!\n\022add_zero_half_cuts\030\251\001 \001(\010:\004true\022\036\n" +
352 "\017add_clique_cuts\030\254\001 \001(\010:\004true\022\033\n\014add_rlt" +
353 "_cuts\030\227\002 \001(\010:\004true\022\"\n\025max_all_diff_cut_s" +
354 "ize\030\224\001 \001(\005:\00264\022\037\n\020add_lin_max_cuts\030\230\001 \001(" +
355 "\010:\004true\022)\n\034max_integer_rounding_scaling\030" +
356 "w \001(\005:\003600\022\'\n\031add_lp_constraints_lazily\030" +
357 "p \001(\010:\004true\022!\n\022root_lp_iterations\030\343\001 \001(\005" +
358 ":\0042000\0222\n$min_orthogonality_for_lp_const" +
359 "raints\030s \001(\001:\0040.05\022(\n\034max_cut_rounds_at_" +
360 "level_zero\030\232\001 \001(\005:\0011\022+\n\036max_consecutive_" +
361 "inactive_count\030y \001(\005:\003100\0220\n\032cut_max_act" +
362 "ive_count_value\030\233\001 \001(\001:\01310000000000\022$\n\026c" +
363 "ut_active_count_decay\030\234\001 \001(\001:\0030.8\022!\n\022cut" +
364 "_cleanup_target\030\235\001 \001(\005:\0041000\022&\n\032new_cons" +
365 "traints_batch_size\030z \001(\005:\00250\022)\n\033exploit_" +
366 "integer_lp_solution\030^ \001(\010:\004true\022%\n\027explo" +
367 "it_all_lp_solution\030t \001(\010:\004true\022%\n\025exploi" +
368 "t_best_solution\030\202\001 \001(\010:\005false\022+\n\033exploit" +
369 "_relaxation_solution\030\241\001 \001(\010:\005false\022 \n\021ex" +
370 "ploit_objective\030\203\001 \001(\010:\004true\022)\n\031detect_l" +
371 "inearized_product\030\225\002 \001(\010:\005false\0223\n#use_n" +
372 "ew_integer_conflict_resolution\030\320\002 \001(\010:\005f" +
373 "alse\022-\n\036create_1uip_boolean_during_icr\030\325" +
374 "\002 \001(\010:\004true\022\037\n\rmip_max_bound\030| \001(\001:\0101000" +
375 "0000\022\032\n\017mip_var_scaling\030} \001(\001:\0011\022&\n\026mip_" +
376 "scale_large_domain\030\341\001 \001(\010:\005false\0220\n!mip_" +
377 "automatically_scale_variables\030\246\001 \001(\010:\004tr" +
378 "ue\022\035\n\ronly_solve_ip\030\336\001 \001(\010:\005false\022#\n\024mip" +
379 "_wanted_precision\030~ \001(\001:\0051e-06\022%\n\031mip_ma" +
380 "x_activity_exponent\030\177 \001(\005:\00253\022$\n\023mip_che" +
381 "ck_precision\030\200\001 \001(\001:\0060.0001\022/\n mip_compu" +
382 "te_true_objective_bound\030\306\001 \001(\010:\004true\022\'\n\027" +
383 "mip_max_valid_magnitude\030\307\001 \001(\001:\0051e+20\022;\n" +
384 "+mip_treat_high_magnitude_bounds_as_infi" +
385 "nity\030\226\002 \001(\010:\005false\022\"\n\022mip_drop_tolerance" +
386 "\030\350\001 \001(\001:\0051e-16\022\036\n\022mip_presolve_level\030\205\002 " +
387 "\001(\005:\0012\"H\n\rVariableOrder\022\014\n\010IN_ORDER\020\000\022\024\n" +
388 "\020IN_REVERSE_ORDER\020\001\022\023\n\017IN_RANDOM_ORDER\020\002" +
389 "\"F\n\010Polarity\022\021\n\rPOLARITY_TRUE\020\000\022\022\n\016POLAR" +
390 "ITY_FALSE\020\001\022\023\n\017POLARITY_RANDOM\020\002\"J\n\035Conf" +
391 "lictMinimizationAlgorithm\022\010\n\004NONE\020\000\022\n\n\006S" +
392 "IMPLE\020\001\022\r\n\tRECURSIVE\020\002\"\004\010\003\020\003\"\233\001\n\031BinaryM" +
393 "inizationAlgorithm\022\032\n\026NO_BINARY_MINIMIZA" +
394 "TION\020\000\022 \n\034BINARY_MINIMIZATION_FROM_UIP\020\001" +
395 "\022.\n*BINARY_MINIMIZATION_FROM_UIP_AND_DEC" +
396 "ISIONS\020\005\"\004\010\002\020\002\"\004\010\003\020\003\"\004\010\004\020\004\"5\n\016ClauseOrde" +
397 "ring\022\023\n\017CLAUSE_ACTIVITY\020\000\022\016\n\nCLAUSE_LBD\020" +
398 "\001\"\206\001\n\020RestartAlgorithm\022\016\n\nNO_RESTART\020\000\022\020" +
399 "\n\014LUBY_RESTART\020\001\022\035\n\031DL_MOVING_AVERAGE_RE" +
400 "START\020\002\022\036\n\032LBD_MOVING_AVERAGE_RESTART\020\003\022" +
401 "\021\n\rFIXED_RESTART\020\004\"t\n\025MaxSatAssumptionOr" +
402 "der\022\034\n\030DEFAULT_ASSUMPTION_ORDER\020\000\022\035\n\031ORD" +
403 "ER_ASSUMPTION_BY_DEPTH\020\001\022\036\n\032ORDER_ASSUMP" +
404 "TION_BY_WEIGHT\020\002\"o\n\035MaxSatStratification" +
405 "Algorithm\022\027\n\023STRATIFICATION_NONE\020\000\022\032\n\026ST" +
406 "RATIFICATION_DESCENT\020\001\022\031\n\025STRATIFICATION" +
407 "_ASCENT\020\002\"\341\001\n\017SearchBranching\022\024\n\020AUTOMAT" +
408 "IC_SEARCH\020\000\022\020\n\014FIXED_SEARCH\020\001\022\024\n\020PORTFOL" +
409 "IO_SEARCH\020\002\022\r\n\tLP_SEARCH\020\003\022\026\n\022PSEUDO_COS" +
410 "T_SEARCH\020\004\022\'\n#PORTFOLIO_WITH_QUICK_RESTA" +
411 "RT_SEARCH\020\005\022\017\n\013HINT_SEARCH\020\006\022\030\n\024PARTIAL_" +
412 "FIXED_SEARCH\020\007\022\025\n\021RANDOMIZED_SEARCH\020\010\"\270\001" +
413 "\n\027SharedTreeSplitStrategy\022\027\n\023SPLIT_STRAT" +
414 "EGY_AUTO\020\000\022\036\n\032SPLIT_STRATEGY_DISCREPANCY" +
415 "\020\001\022\037\n\033SPLIT_STRATEGY_OBJECTIVE_LB\020\002\022 \n\034S" +
416 "PLIT_STRATEGY_BALANCED_TREE\020\003\022!\n\035SPLIT_S" +
417 "TRATEGY_FIRST_PROPOSAL\020\004\"h\n\020FPRoundingMe" +
418 "thod\022\023\n\017NEAREST_INTEGER\020\000\022\016\n\nLOCK_BASED\020" +
419 "\001\022\025\n\021ACTIVE_LOCK_BASED\020\003\022\030\n\024PROPAGATION_" +
420 "ASSISTED\020\002Bk\n\026com.google.ortools.satP\001Z:" +
421 "github.com/google/or-tools/ortools/sat/p" +
422 "roto/satparameters\252\002\022Google.OrTools.Sat"
423 };
424 descriptor = com.google.protobuf.Descriptors.FileDescriptor
425 .internalBuildGeneratedFileFrom(descriptorData,
426 new com.google.protobuf.Descriptors.FileDescriptor[] {
427 });
428 internal_static_operations_research_sat_SatParameters_descriptor =
429 getDescriptor().getMessageType(0);
430 internal_static_operations_research_sat_SatParameters_fieldAccessorTable = new
431 com.google.protobuf.GeneratedMessage.FieldAccessorTable(
432 internal_static_operations_research_sat_SatParameters_descriptor,
433 new java.lang.String[] { "Name", "PreferredVariableOrder", "InitialPolarity", "UsePhaseSaving", "PolarityRephaseIncrement", "PolarityExploitLsHints", "RandomPolarityRatio", "RandomBranchesRatio", "UseErwaHeuristic", "InitialVariablesActivity", "AlsoBumpVariablesInConflictReasons", "MinimizationAlgorithm", "BinaryMinimizationAlgorithm", "SubsumptionDuringConflictAnalysis", "ExtraSubsumptionDuringConflictAnalysis", "DecisionSubsumptionDuringConflictAnalysis", "EagerlySubsumeLastNConflicts", "SubsumeDuringVivification", "UseChronologicalBacktracking", "MaxBackjumpLevels", "ChronologicalBacktrackMinConflicts", "ClauseCleanupPeriod", "ClauseCleanupPeriodIncrement", "ClauseCleanupTarget", "ClauseCleanupRatio", "ClauseCleanupLbdBound", "ClauseCleanupLbdTier1", "ClauseCleanupLbdTier2", "ClauseCleanupOrdering", "PbCleanupIncrement", "PbCleanupRatio", "VariableActivityDecay", "MaxVariableActivityValue", "GlucoseMaxDecay", "GlucoseDecayIncrement", "GlucoseDecayIncrementPeriod", "ClauseActivityDecay", "MaxClauseActivityValue", "RestartAlgorithms", "DefaultRestartAlgorithms", "RestartPeriod", "RestartRunningWindowSize", "RestartDlAverageRatio", "RestartLbdAverageRatio", "UseBlockingRestart", "BlockingRestartWindowSize", "BlockingRestartMultiplier", "NumConflictsBeforeStrategyChanges", "StrategyChangeIncreaseRatio", "MaxTimeInSeconds", "MaxDeterministicTime", "MaxNumDeterministicBatches", "MaxNumberOfConflicts", "MaxMemoryInMb", "AbsoluteGapLimit", "RelativeGapLimit", "RandomSeed", "PermuteVariableRandomly", "PermutePresolveConstraintOrder", "UseAbslRandom", "LogSearchProgress", "LogSubsolverStatistics", "LogPrefix", "LogToStdout", "LogToResponse", "UsePbResolution", "MinimizeReductionDuringPbResolution", "CountAssumptionLevelsInLbd", "PresolveBveThreshold", "FilterSatPostsolveClauses", "PresolveBveClauseWeight", "ProbingDeterministicTimeLimit", "PresolveProbingDeterministicTimeLimit", "PresolveBlockedClause", "PresolveUseBva", "PresolveBvaThreshold", "MaxPresolveIterations", "CpModelPresolve", "CpModelProbingLevel", "CpModelUseSatPresolve", "LoadAtMostOnesInSatPresolve", "RemoveFixedVariablesEarly", "DetectTableWithCost", "TableCompressionLevel", "ExpandAlldiffConstraints", "MaxAlldiffDomainSize", "ExpandReservoirConstraints", "MaxDomainSizeForLinear2Expansion", "ExpandReservoirUsingCircuit", "EncodeCumulativeAsReservoir", "MaxLinMaxSizeForExpansion", "DisableConstraintExpansion", "EncodeComplexLinearConstraintWithInteger", "MergeNoOverlapWorkLimit", "MergeAtMostOneWorkLimit", "PresolveSubstitutionLevel", "PresolveExtractIntegerEnforcement", "PresolveInclusionWorkLimit", "IgnoreNames", "InferAllDiffs", "FindBigLinearOverlap", "FindClausesThatAreExactlyOne", "UseSatInprocessing", "InprocessingDtimeRatio", "InprocessingProbingDtime", "InprocessingMinimizationDtime", "InprocessingMinimizationUseConflictAnalysis", "InprocessingMinimizationUseAllOrderings", "InprocessingUseCongruenceClosure", "InprocessingUseSatSweeping", "NumWorkers", "NumSearchWorkers", "NumFullSubsolvers", "Subsolvers", "ExtraSubsolvers", "IgnoreSubsolvers", "FilterSubsolvers", "SubsolverParams", "InterleaveSearch", "InterleaveBatchSize", "ShareObjectiveBounds", "ShareLevelZeroBounds", "ShareLinear2Bounds", "ShareBinaryClauses", "ShareGlueClauses", "MinimizeSharedClauses", "ShareGlueClausesDtime", "CheckLratProof", "CheckMergedLratProof", "OutputLratProof", "CheckDratProof", "OutputDratProof", "MaxDratTimeInSeconds", "DebugPostsolveWithFullSolver", "DebugMaxNumPresolveOperations", "DebugCrashOnBadHint", "DebugCrashIfPresolveBreaksHint", "DebugCrashIfLratCheckFails", "UseOptimizationHints", "CoreMinimizationLevel", "FindMultipleCores", "CoverOptimization", "MaxSatAssumptionOrder", "MaxSatReverseAssumptionOrder", "MaxSatStratification", "PropagationLoopDetectionFactor", "UsePrecedencesInDisjunctiveConstraint", "TransitivePrecedencesWorkLimit", "MaxSizeToCreatePrecedenceLiteralsInDisjunctive", "UseStrongPropagationInDisjunctive", "UseDynamicPrecedenceInDisjunctive", "UseDynamicPrecedenceInCumulative", "UseOverloadCheckerInCumulative", "UseConservativeScaleOverloadChecker", "UseTimetableEdgeFindingInCumulative", "MaxNumIntervalsForTimetableEdgeFinding", "UseHardPrecedencesInCumulative", "ExploitAllPrecedences", "UseDisjunctiveConstraintInCumulative", "NoOverlap2DBooleanRelationsLimit", "UseTimetablingInNoOverlap2D", "UseEnergeticReasoningInNoOverlap2D", "UseAreaEnergeticReasoningInNoOverlap2D", "UseTryEdgeReasoningInNoOverlap2D", "MaxPairsPairwiseReasoningInNoOverlap2D", "MaximumRegionsToSplitInDisconnectedNoOverlap2D", "UseLinear3ForNoOverlap2DPrecedences", "UseDualSchedulingHeuristics", "UseAllDifferentForCircuit", "RoutingCutSubsetSizeForBinaryRelationBound", "RoutingCutSubsetSizeForTightBinaryRelationBound", "RoutingCutSubsetSizeForExactBinaryRelationBound", "RoutingCutSubsetSizeForShortestPathsBound", "RoutingCutDpEffort", "RoutingCutMaxInfeasiblePathLength", "SearchBranching", "HintConflictLimit", "RepairHint", "FixVariablesToTheirHintedValue", "UseProbingSearch", "UseExtendedProbing", "ProbingNumCombinationsLimit", "ShavingDeterministicTimeInProbingSearch", "ShavingSearchDeterministicTime", "ShavingSearchThreshold", "UseObjectiveLbSearch", "UseObjectiveShavingSearch", "VariablesShavingLevel", "PseudoCostReliabilityThreshold", "OptimizeWithCore", "OptimizeWithLbTreeSearch", "SaveLpBasisInLbTreeSearch", "BinarySearchNumConflicts", "OptimizeWithMaxHs", "UseFeasibilityJump", "UseLsOnly", "FeasibilityJumpDecay", "FeasibilityJumpLinearizationLevel", "FeasibilityJumpRestartFactor", "FeasibilityJumpBatchDtime", "FeasibilityJumpVarRandomizationProbability", "FeasibilityJumpVarPerburbationRangeRatio", "FeasibilityJumpEnableRestarts", "FeasibilityJumpMaxExpandedConstraintSize", "NumViolationLs", "ViolationLsPerturbationPeriod", "ViolationLsCompoundMoveProbability", "SharedTreeNumWorkers", "UseSharedTreeSearch", "SharedTreeWorkerMinRestartsPerSubtree", "SharedTreeWorkerEnableTrailSharing", "SharedTreeWorkerEnablePhaseSharing", "SharedTreeOpenLeavesPerWorker", "SharedTreeMaxNodesPerWorker", "SharedTreeSplitStrategy", "SharedTreeBalanceTolerance", "SharedTreeSplitMinDtime", "EnumerateAllSolutions", "KeepAllFeasibleSolutionsInPresolve", "FillTightenedDomainsInResponse", "FillAdditionalSolutionsInResponse", "InstantiateAllVariables", "AutoDetectGreaterThanAtLeastOneOf", "StopAfterFirstSolution", "StopAfterPresolve", "StopAfterRootPropagation", "LnsInitialDifficulty", "LnsInitialDeterministicLimit", "UseLns", "UseLnsOnly", "SolutionPoolSize", "SolutionPoolDiversityLimit", "AlternativePoolSize", "UseRinsLns", "UseFeasibilityPump", "UseLbRelaxLns", "LbRelaxNumWorkersThreshold", "FpRounding", "DiversifyLnsParams", "RandomizeSearch", "SearchRandomVariablePoolSize", "PushAllTasksTowardStart", "UseOptionalVariables", "UseExactLpReason", "UseCombinedNoOverlap", "AtMostOneMaxExpansionSize", "CatchSigintSignal", "UseImpliedBounds", "PolishLpSolution", "LpPrimalTolerance", "LpDualTolerance", "ConvertIntervals", "SymmetryLevel", "UseSymmetryInLp", "KeepSymmetryInPresolve", "SymmetryDetectionDeterministicTimeLimit", "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", "UseNewIntegerConflictResolution", "Create1UipBooleanDuringIcr", "MipMaxBound", "MipVarScaling", "MipScaleLargeDomain", "MipAutomaticallyScaleVariables", "OnlySolveIp", "MipWantedPrecision", "MipMaxActivityExponent", "MipCheckPrecision", "MipComputeTrueObjectiveBound", "MipMaxValidMagnitude", "MipTreatHighMagnitudeBoundsAsInfinity", "MipDropTolerance", "MipPresolveLevel", });
434 descriptor.resolveAllFeaturesImmutable();
435 }
436
437 // @@protoc_insertion_point(outer_class_scope)
438}
static void registerAllExtensions(com.google.protobuf.ExtensionRegistryLite registry)
static void registerAllExtensions(com.google.protobuf.ExtensionRegistry registry)
static com.google.protobuf.Descriptors.FileDescriptor getDescriptor()