 |
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
|
Google OR-Tools v9.12
a fast and portable software suite for combinatorial optimization
|
Static Public Member Functions | |
| static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
| com.google.protobuf.GeneratedMessage.FieldAccessorTable | internalGetFieldAccessorTable () |
Contains the definitions for all the bop algorithm parameters and their default values. NEXT TAG: 42
Protobuf type operations_research.bop.BopParameters
Definition at line 2230 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.addAllSolverOptimizerSets | ( | java.lang.Iterable<? extends com.google.ortools.bop.BopSolverOptimizerSet > | values | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4893 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSets | ( | com.google.ortools.bop.BopSolverOptimizerSet | value | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4804 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSets | ( | com.google.ortools.bop.BopSolverOptimizerSet.Builder | builderForValue | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4851 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSets | ( | int | index, |
| com.google.ortools.bop.BopSolverOptimizerSet | value ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4827 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSets | ( | int | index, |
| com.google.ortools.bop.BopSolverOptimizerSet.Builder | builderForValue ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4872 of file BopParameters.java.
| com.google.ortools.bop.BopSolverOptimizerSet.Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSetsBuilder | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 5004 of file BopParameters.java.
| com.google.ortools.bop.BopSolverOptimizerSet.Builder com.google.ortools.bop.BopParameters.Builder.addSolverOptimizerSetsBuilder | ( | int | index | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 5018 of file BopParameters.java.
| com.google.ortools.bop.BopParameters com.google.ortools.bop.BopParameters.Builder.build | ( | ) |
Definition at line 2320 of file BopParameters.java.
| com.google.ortools.bop.BopParameters com.google.ortools.bop.BopParameters.Builder.buildPartial | ( | ) |
Definition at line 2329 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clear | ( | ) |
Definition at line 2258 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearComputeEstimatedImpact | ( | ) |
Compute estimated impact at each iteration when true; only once when false.
optional bool compute_estimated_impact = 3 [default = true];
Definition at line 3469 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearDecomposedProblemMinTimeInSeconds | ( | ) |
HACK. To avoid spending too little time on small problems, spend at least this time solving each of the decomposed sub-problem. This only make sense if num_bop_solvers_used_by_decomposition is greater than 1 so that the overhead can be "absorbed" by the other threads.
optional double decomposed_problem_min_time_in_seconds = 36 [default = 0];
Definition at line 5405 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearDecomposerNumVariablesThreshold | ( | ) |
Only try to decompose the problem when the number of variables is greater than the threshold.
optional int32 decomposer_num_variables_threshold = 30 [default = 50];
Definition at line 5273 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearDefaultSolverOptimizerSets | ( | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
Definition at line 5112 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearExploitSymmetryInSatFirstSolution | ( | ) |
If true, find and exploit symmetries in proving satisfiability in the first problem. This feature is experimental. On some problems, computing symmetries may run forever. You may also run into unforseen problems as this feature was not extensively tested.
optional bool exploit_symmetry_in_sat_first_solution = 40 [default = false];
Definition at line 4261 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearGuidedSatConflictsChunk | ( | ) |
The first solutions based on guided SAT will work in chunk of that many conflicts at the time. This allows to simulate parallelism between the different guiding strategy on a single core.
optional int32 guided_sat_conflicts_chunk = 34 [default = 1000];
Definition at line 5469 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearLogSearchProgress | ( | ) |
Whether the solver should log the search progress to LOG(INFO).
optional bool log_search_progress = 14 [default = false];
Definition at line 3413 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearLpMaxDeterministicTime | ( | ) |
The max deterministic time given to the LP solver each time it is called. If this is not enough to solve the LP at hand, it will simply be called again later (and the solve will resume from where it stopped).
optional double lp_max_deterministic_time = 37 [default = 1];
Definition at line 3089 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxDeterministicTime | ( | ) |
Maximum time allowed in deterministic time to solve a problem. The deterministic time should be correlated with the real time used by the solver, the time unit being roughly the order of magnitude of a second. The counter will starts as soon as SetParameters() or SolveWithTimeLimit() is called.
optional double max_deterministic_time = 27 [default = inf];
Definition at line 3025 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxLpSolveForFeasibilityProblems | ( | ) |
The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function). Set this to a small value, e.g., 1, if fractional solutions offer useful guidance to other solvers in the portfolio. A negative value means no limit.
optional int32 max_lp_solve_for_feasibility_problems = 41 [default = 0];
Definition at line 5537 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfBacktracksInLs | ( | ) |
Maximum number of backtracks times the number of variables in Local Search, ie. max num backtracks == max_number_of_backtracks_in_ls / num variables.
optional int64 max_number_of_backtracks_in_ls = 11 [default = 100000000];
Definition at line 3945 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfConflictsForQuickCheck | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
optional int32 max_number_of_conflicts_for_quick_check = 16 [default = 10];
Definition at line 4117 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfConflictsInRandomLns | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem.
optional int32 max_number_of_conflicts_in_random_lns = 9 [default = 2500];
Definition at line 3829 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfConflictsInRandomSolutionGeneration | ( | ) |
The number of conflicts the SAT solver has to generate a random solution.
optional int32 max_number_of_conflicts_in_random_solution_generation = 20 [default = 500];
Definition at line 4317 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfConsecutiveFailingOptimizerCalls | ( | ) |
Maximum number of consecutive optimizer calls without improving the current solution. If this number is reached, the search will be aborted. Note that this parameter only applies when an initial solution has been found or is provided. Also note that there is no limit to the number of calls, when the parameter is not set.
optional int32 max_number_of_consecutive_failing_optimizer_calls = 35;
Definition at line 3161 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumberOfExploredAssignmentsPerTryInLs | ( | ) |
The maximum number of assignments the Local Search iterates on during one try. Note that if the Local Search is called again on the same solution it will not restart from scratch but will iterate on the next max_number_of_explored_assignments_per_try_in_ls assignments.
optional int64 max_number_of_explored_assignments_per_try_in_ls = 21 [default = 10000];
Definition at line 4385 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumBrokenConstraintsInLs | ( | ) |
Abort the LS search tree as soon as strictly more than this number of constraints are broken. The default is a large value which basically disable this heuristic.
optional int32 max_num_broken_constraints_in_ls = 38 [default = 2147483647];
Definition at line 3357 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxNumDecisionsInLs | ( | ) |
Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
optional int32 max_num_decisions_in_ls = 2 [default = 4];
Definition at line 3293 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearMaxTimeInSeconds | ( | ) |
Maximum time allowed in seconds to solve a problem. The counter will starts as soon as Solve() is called.
optional double max_time_in_seconds = 1 [default = inf];
Definition at line 2953 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearNumberOfSolvers | ( | ) |
The number of solvers used to run Bop. Note that one thread will be created per solver. The type of communication between solvers is specified by the synchronization_type parameter.
optional int32 number_of_solvers = 24 [default = 1];
Definition at line 4637 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearNumBopSolversUsedByDecomposition | ( | ) |
The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem. TODO(user): Merge this with the number_of_solvers parameter.
optional int32 num_bop_solvers_used_by_decomposition = 31 [default = 1];
Definition at line 5337 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearNumRandomLnsTries | ( | ) |
Number of tries in the random lns.
optional int32 num_random_lns_tries = 10 [default = 1];
Definition at line 3885 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearNumRelaxedVars | ( | ) |
Number of variables to relax in the exhaustive Large Neighborhood Search.
optional int32 num_relaxed_vars = 8 [default = 10];
Definition at line 3769 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearPruneSearchTree | ( | ) |
Avoid exploring both branches (b, a, ...) and (a, b, ...).
optional bool prune_search_tree = 4 [default = false];
Definition at line 3525 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearRandomSeed | ( | ) |
The seed used to initialize the random generator. TODO(user): Some of our client test fail depending on this value! we need to fix them and ideally randomize our behavior from on test to the next so that this doesn't happen in the future.
optional int32 random_seed = 7 [default = 8];
Definition at line 3713 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearRelativeGapLimit | ( | ) |
Limit used to stop the optimization as soon as the relative gap is smaller than the given value. The relative gap is defined as: abs(solution_cost - best_bound) / max(abs(solution_cost), abs(best_bound)).
optional double relative_gap_limit = 28 [default = 0.0001];
Definition at line 3233 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearSolverOptimizerSets | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4915 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearSortConstraintsByNumTerms | ( | ) |
Sort constraints by increasing total number of terms instead of number of contributing terms.
optional bool sort_constraints_by_num_terms = 5 [default = false];
Definition at line 3585 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearSynchronizationType | ( | ) |
optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
Definition at line 4679 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseLearnedBinaryClausesInLp | ( | ) |
Whether we use the learned binary clauses in the Linear Relaxation.
optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
Definition at line 4573 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseLpLns | ( | ) |
Use Large Neighborhood Search based on the LP relaxation.
optional bool use_lp_lns = 12 [default = true];
Definition at line 4001 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseLpStrongBranching | ( | ) |
Use strong branching in the linear relaxation optimizer. The strong branching is a what-if analysis on each variable v, i.e. compute the best bound when v is assigned to true, compute the best bound when v is assigned to false, and then use those best bounds to improve the overall best bound. This is useful to improve the best_bound, but also to fix some variables during search. Note that using probing might be time consuming as it runs the LP solver 2 * num_variables times.
optional bool use_lp_strong_branching = 29 [default = false];
Definition at line 5213 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUsePotentialOneFlipRepairsInLs | ( | ) |
Whether we keep a list of variable that can potentially repair in one flip all the current infeasible constraints (such variable must at least appear in all the infeasible constraints for this to happen).
optional bool use_potential_one_flip_repairs_in_ls = 39 [default = false];
Definition at line 4517 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseRandomLns | ( | ) |
Use the random Large Neighborhood Search instead of the exhaustive one.
optional bool use_random_lns = 6 [default = true];
Definition at line 3641 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseSatToChooseLnsNeighbourhood | ( | ) |
Whether we use sat propagation to choose the lns neighbourhood.
optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
Definition at line 4057 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseSymmetry | ( | ) |
If true, find and exploit the eventual symmetries of the problem. TODO(user): turn this on by default once the symmetry finder becomes fast enough to be negligeable for most problem. Or at least support a time limit.
optional bool use_symmetry = 17 [default = false];
Definition at line 4189 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.clearUseTranspositionTableInLs | ( | ) |
Whether we use an hash set during the LS to avoid exploring more than once the "same" state. Note that because the underlying SAT solver may learn information in the middle of the LS, this may make the LS slightly less "complete", but it should be faster.
optional bool use_transposition_table_in_ls = 22 [default = true];
Definition at line 4453 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getComputeEstimatedImpact | ( | ) |
Compute estimated impact at each iteration when true; only once when false.
optional bool compute_estimated_impact = 3 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3442 of file BopParameters.java.
| double com.google.ortools.bop.BopParameters.Builder.getDecomposedProblemMinTimeInSeconds | ( | ) |
HACK. To avoid spending too little time on small problems, spend at least this time solving each of the decomposed sub-problem. This only make sense if num_bop_solvers_used_by_decomposition is greater than 1 so that the overhead can be "absorbed" by the other threads.
optional double decomposed_problem_min_time_in_seconds = 36 [default = 0];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5372 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getDecomposerNumVariablesThreshold | ( | ) |
Only try to decompose the problem when the number of variables is greater than the threshold.
optional int32 decomposer_num_variables_threshold = 30 [default = 50];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5244 of file BopParameters.java.
| com.google.ortools.bop.BopParameters com.google.ortools.bop.BopParameters.Builder.getDefaultInstanceForType | ( | ) |
Definition at line 2315 of file BopParameters.java.
| java.lang.String com.google.ortools.bop.BopParameters.Builder.getDefaultSolverOptimizerSets | ( | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5064 of file BopParameters.java.
| com.google.protobuf.ByteString com.google.ortools.bop.BopParameters.Builder.getDefaultSolverOptimizerSetsBytes | ( | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5083 of file BopParameters.java.
|
static |
Definition at line 2235 of file BopParameters.java.
| com.google.protobuf.Descriptors.Descriptor com.google.ortools.bop.BopParameters.Builder.getDescriptorForType | ( | ) |
Definition at line 2310 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getExploitSymmetryInSatFirstSolution | ( | ) |
If true, find and exploit symmetries in proving satisfiability in the first problem. This feature is experimental. On some problems, computing symmetries may run forever. You may also run into unforseen problems as this feature was not extensively tested.
optional bool exploit_symmetry_in_sat_first_solution = 40 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4226 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getGuidedSatConflictsChunk | ( | ) |
The first solutions based on guided SAT will work in chunk of that many conflicts at the time. This allows to simulate parallelism between the different guiding strategy on a single core.
optional int32 guided_sat_conflicts_chunk = 34 [default = 1000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5438 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getLogSearchProgress | ( | ) |
Whether the solver should log the search progress to LOG(INFO).
optional bool log_search_progress = 14 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3386 of file BopParameters.java.
| double com.google.ortools.bop.BopParameters.Builder.getLpMaxDeterministicTime | ( | ) |
The max deterministic time given to the LP solver each time it is called. If this is not enough to solve the LP at hand, it will simply be called again later (and the solve will resume from where it stopped).
optional double lp_max_deterministic_time = 37 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3058 of file BopParameters.java.
| double com.google.ortools.bop.BopParameters.Builder.getMaxDeterministicTime | ( | ) |
Maximum time allowed in deterministic time to solve a problem. The deterministic time should be correlated with the real time used by the solver, the time unit being roughly the order of magnitude of a second. The counter will starts as soon as SetParameters() or SolveWithTimeLimit() is called.
optional double max_deterministic_time = 27 [default = inf];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 2990 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxLpSolveForFeasibilityProblems | ( | ) |
The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function). Set this to a small value, e.g., 1, if fractional solutions offer useful guidance to other solvers in the portfolio. A negative value means no limit.
optional int32 max_lp_solve_for_feasibility_problems = 41 [default = 0];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5504 of file BopParameters.java.
| long com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfBacktracksInLs | ( | ) |
Maximum number of backtracks times the number of variables in Local Search, ie. max num backtracks == max_number_of_backtracks_in_ls / num variables.
optional int64 max_number_of_backtracks_in_ls = 11 [default = 100000000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3916 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfConflictsForQuickCheck | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
optional int32 max_number_of_conflicts_for_quick_check = 16 [default = 10];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4088 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfConflictsInRandomLns | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem.
optional int32 max_number_of_conflicts_in_random_lns = 9 [default = 2500];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3800 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfConflictsInRandomSolutionGeneration | ( | ) |
The number of conflicts the SAT solver has to generate a random solution.
optional int32 max_number_of_conflicts_in_random_solution_generation = 20 [default = 500];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4290 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfConsecutiveFailingOptimizerCalls | ( | ) |
Maximum number of consecutive optimizer calls without improving the current solution. If this number is reached, the search will be aborted. Note that this parameter only applies when an initial solution has been found or is provided. Also note that there is no limit to the number of calls, when the parameter is not set.
optional int32 max_number_of_consecutive_failing_optimizer_calls = 35;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3126 of file BopParameters.java.
| long com.google.ortools.bop.BopParameters.Builder.getMaxNumberOfExploredAssignmentsPerTryInLs | ( | ) |
The maximum number of assignments the Local Search iterates on during one try. Note that if the Local Search is called again on the same solution it will not restart from scratch but will iterate on the next max_number_of_explored_assignments_per_try_in_ls assignments.
optional int64 max_number_of_explored_assignments_per_try_in_ls = 21 [default = 10000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4352 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumBrokenConstraintsInLs | ( | ) |
Abort the LS search tree as soon as strictly more than this number of constraints are broken. The default is a large value which basically disable this heuristic.
optional int32 max_num_broken_constraints_in_ls = 38 [default = 2147483647];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3326 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getMaxNumDecisionsInLs | ( | ) |
Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
optional int32 max_num_decisions_in_ls = 2 [default = 4];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3264 of file BopParameters.java.
| double com.google.ortools.bop.BopParameters.Builder.getMaxTimeInSeconds | ( | ) |
Maximum time allowed in seconds to solve a problem. The counter will starts as soon as Solve() is called.
optional double max_time_in_seconds = 1 [default = inf];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 2924 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getNumberOfSolvers | ( | ) |
The number of solvers used to run Bop. Note that one thread will be created per solver. The type of communication between solvers is specified by the synchronization_type parameter.
optional int32 number_of_solvers = 24 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4606 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getNumBopSolversUsedByDecomposition | ( | ) |
The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem. TODO(user): Merge this with the number_of_solvers parameter.
optional int32 num_bop_solvers_used_by_decomposition = 31 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5306 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getNumRandomLnsTries | ( | ) |
Number of tries in the random lns.
optional int32 num_random_lns_tries = 10 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3858 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getNumRelaxedVars | ( | ) |
Number of variables to relax in the exhaustive Large Neighborhood Search.
optional int32 num_relaxed_vars = 8 [default = 10];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3742 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getPruneSearchTree | ( | ) |
Avoid exploring both branches (b, a, ...) and (a, b, ...).
optional bool prune_search_tree = 4 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3498 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getRandomSeed | ( | ) |
The seed used to initialize the random generator. TODO(user): Some of our client test fail depending on this value! we need to fix them and ideally randomize our behavior from on test to the next so that this doesn't happen in the future.
optional int32 random_seed = 7 [default = 8];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3678 of file BopParameters.java.
| double com.google.ortools.bop.BopParameters.Builder.getRelativeGapLimit | ( | ) |
Limit used to stop the optimization as soon as the relative gap is smaller than the given value. The relative gap is defined as: abs(solution_cost - best_bound) / max(abs(solution_cost), abs(best_bound)).
optional double relative_gap_limit = 28 [default = 0.0001];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3198 of file BopParameters.java.
| com.google.ortools.bop.BopSolverOptimizerSet com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSets | ( | int | index | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4742 of file BopParameters.java.
| com.google.ortools.bop.BopSolverOptimizerSet.Builder com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsBuilder | ( | int | index | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4955 of file BopParameters.java.
| java.util.List< com.google.ortools.bop.BopSolverOptimizerSet.Builder > com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsBuilderList | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 5034 of file BopParameters.java.
| int com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsCount | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4725 of file BopParameters.java.
| java.util.List< com.google.ortools.bop.BopSolverOptimizerSet > com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsList | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4708 of file BopParameters.java.
| com.google.ortools.bop.BopSolverOptimizerSetOrBuilder com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsOrBuilder | ( | int | index | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4969 of file BopParameters.java.
| java.util.List<? extends com.google.ortools.bop.BopSolverOptimizerSetOrBuilder > com.google.ortools.bop.BopParameters.Builder.getSolverOptimizerSetsOrBuilderList | ( | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4987 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getSortConstraintsByNumTerms | ( | ) |
Sort constraints by increasing total number of terms instead of number of contributing terms.
optional bool sort_constraints_by_num_terms = 5 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3556 of file BopParameters.java.
| com.google.ortools.bop.BopParameters.ThreadSynchronizationType com.google.ortools.bop.BopParameters.Builder.getSynchronizationType | ( | ) |
optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4657 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseLearnedBinaryClausesInLp | ( | ) |
Whether we use the learned binary clauses in the Linear Relaxation.
optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4546 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseLpLns | ( | ) |
Use Large Neighborhood Search based on the LP relaxation.
optional bool use_lp_lns = 12 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3974 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseLpStrongBranching | ( | ) |
Use strong branching in the linear relaxation optimizer. The strong branching is a what-if analysis on each variable v, i.e. compute the best bound when v is assigned to true, compute the best bound when v is assigned to false, and then use those best bounds to improve the overall best bound. This is useful to improve the best_bound, but also to fix some variables during search. Note that using probing might be time consuming as it runs the LP solver 2 * num_variables times.
optional bool use_lp_strong_branching = 29 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5170 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUsePotentialOneFlipRepairsInLs | ( | ) |
Whether we keep a list of variable that can potentially repair in one flip all the current infeasible constraints (such variable must at least appear in all the infeasible constraints for this to happen).
optional bool use_potential_one_flip_repairs_in_ls = 39 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4486 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseRandomLns | ( | ) |
Use the random Large Neighborhood Search instead of the exhaustive one.
optional bool use_random_lns = 6 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3614 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseSatToChooseLnsNeighbourhood | ( | ) |
Whether we use sat propagation to choose the lns neighbourhood.
optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4030 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseSymmetry | ( | ) |
If true, find and exploit the eventual symmetries of the problem. TODO(user): turn this on by default once the symmetry finder becomes fast enough to be negligeable for most problem. Or at least support a time limit.
optional bool use_symmetry = 17 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4154 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.getUseTranspositionTableInLs | ( | ) |
Whether we use an hash set during the LS to avoid exploring more than once the "same" state. Note that because the underlying SAT solver may learn information in the middle of the LS, this may make the LS slightly less "complete", but it should be faster.
optional bool use_transposition_table_in_ls = 22 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4420 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasComputeEstimatedImpact | ( | ) |
Compute estimated impact at each iteration when true; only once when false.
optional bool compute_estimated_impact = 3 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3430 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasDecomposedProblemMinTimeInSeconds | ( | ) |
HACK. To avoid spending too little time on small problems, spend at least this time solving each of the decomposed sub-problem. This only make sense if num_bop_solvers_used_by_decomposition is greater than 1 so that the overhead can be "absorbed" by the other threads.
optional double decomposed_problem_min_time_in_seconds = 36 [default = 0];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5357 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasDecomposerNumVariablesThreshold | ( | ) |
Only try to decompose the problem when the number of variables is greater than the threshold.
optional int32 decomposer_num_variables_threshold = 30 [default = 50];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5231 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasDefaultSolverOptimizerSets | ( | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5057 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasExploitSymmetryInSatFirstSolution | ( | ) |
If true, find and exploit symmetries in proving satisfiability in the first problem. This feature is experimental. On some problems, computing symmetries may run forever. You may also run into unforseen problems as this feature was not extensively tested.
optional bool exploit_symmetry_in_sat_first_solution = 40 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4210 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasGuidedSatConflictsChunk | ( | ) |
The first solutions based on guided SAT will work in chunk of that many conflicts at the time. This allows to simulate parallelism between the different guiding strategy on a single core.
optional int32 guided_sat_conflicts_chunk = 34 [default = 1000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5424 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasLogSearchProgress | ( | ) |
Whether the solver should log the search progress to LOG(INFO).
optional bool log_search_progress = 14 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3374 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasLpMaxDeterministicTime | ( | ) |
The max deterministic time given to the LP solver each time it is called. If this is not enough to solve the LP at hand, it will simply be called again later (and the solve will resume from where it stopped).
optional double lp_max_deterministic_time = 37 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3044 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxDeterministicTime | ( | ) |
Maximum time allowed in deterministic time to solve a problem. The deterministic time should be correlated with the real time used by the solver, the time unit being roughly the order of magnitude of a second. The counter will starts as soon as SetParameters() or SolveWithTimeLimit() is called.
optional double max_deterministic_time = 27 [default = inf];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 2974 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxLpSolveForFeasibilityProblems | ( | ) |
The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function). Set this to a small value, e.g., 1, if fractional solutions offer useful guidance to other solvers in the portfolio. A negative value means no limit.
optional int32 max_lp_solve_for_feasibility_problems = 41 [default = 0];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5489 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfBacktracksInLs | ( | ) |
Maximum number of backtracks times the number of variables in Local Search, ie. max num backtracks == max_number_of_backtracks_in_ls / num variables.
optional int64 max_number_of_backtracks_in_ls = 11 [default = 100000000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3903 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfConflictsForQuickCheck | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
optional int32 max_number_of_conflicts_for_quick_check = 16 [default = 10];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4075 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfConflictsInRandomLns | ( | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem.
optional int32 max_number_of_conflicts_in_random_lns = 9 [default = 2500];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3787 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfConflictsInRandomSolutionGeneration | ( | ) |
The number of conflicts the SAT solver has to generate a random solution.
optional int32 max_number_of_conflicts_in_random_solution_generation = 20 [default = 500];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4278 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfConsecutiveFailingOptimizerCalls | ( | ) |
Maximum number of consecutive optimizer calls without improving the current solution. If this number is reached, the search will be aborted. Note that this parameter only applies when an initial solution has been found or is provided. Also note that there is no limit to the number of calls, when the parameter is not set.
optional int32 max_number_of_consecutive_failing_optimizer_calls = 35;
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3110 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumberOfExploredAssignmentsPerTryInLs | ( | ) |
The maximum number of assignments the Local Search iterates on during one try. Note that if the Local Search is called again on the same solution it will not restart from scratch but will iterate on the next max_number_of_explored_assignments_per_try_in_ls assignments.
optional int64 max_number_of_explored_assignments_per_try_in_ls = 21 [default = 10000];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4337 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumBrokenConstraintsInLs | ( | ) |
Abort the LS search tree as soon as strictly more than this number of constraints are broken. The default is a large value which basically disable this heuristic.
optional int32 max_num_broken_constraints_in_ls = 38 [default = 2147483647];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3312 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxNumDecisionsInLs | ( | ) |
Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
optional int32 max_num_decisions_in_ls = 2 [default = 4];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3251 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasMaxTimeInSeconds | ( | ) |
Maximum time allowed in seconds to solve a problem. The counter will starts as soon as Solve() is called.
optional double max_time_in_seconds = 1 [default = inf];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 2911 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasNumberOfSolvers | ( | ) |
The number of solvers used to run Bop. Note that one thread will be created per solver. The type of communication between solvers is specified by the synchronization_type parameter.
optional int32 number_of_solvers = 24 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4592 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasNumBopSolversUsedByDecomposition | ( | ) |
The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem. TODO(user): Merge this with the number_of_solvers parameter.
optional int32 num_bop_solvers_used_by_decomposition = 31 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5292 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasNumRandomLnsTries | ( | ) |
Number of tries in the random lns.
optional int32 num_random_lns_tries = 10 [default = 1];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3846 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasNumRelaxedVars | ( | ) |
Number of variables to relax in the exhaustive Large Neighborhood Search.
optional int32 num_relaxed_vars = 8 [default = 10];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3730 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasPruneSearchTree | ( | ) |
Avoid exploring both branches (b, a, ...) and (a, b, ...).
optional bool prune_search_tree = 4 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3486 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasRandomSeed | ( | ) |
The seed used to initialize the random generator. TODO(user): Some of our client test fail depending on this value! we need to fix them and ideally randomize our behavior from on test to the next so that this doesn't happen in the future.
optional int32 random_seed = 7 [default = 8];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3662 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasRelativeGapLimit | ( | ) |
Limit used to stop the optimization as soon as the relative gap is smaller than the given value. The relative gap is defined as: abs(solution_cost - best_bound) / max(abs(solution_cost), abs(best_bound)).
optional double relative_gap_limit = 28 [default = 0.0001];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3182 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasSortConstraintsByNumTerms | ( | ) |
Sort constraints by increasing total number of terms instead of number of contributing terms.
optional bool sort_constraints_by_num_terms = 5 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3543 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasSynchronizationType | ( | ) |
optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4649 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseLearnedBinaryClausesInLp | ( | ) |
Whether we use the learned binary clauses in the Linear Relaxation.
optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4534 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseLpLns | ( | ) |
Use Large Neighborhood Search based on the LP relaxation.
optional bool use_lp_lns = 12 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3962 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseLpStrongBranching | ( | ) |
Use strong branching in the linear relaxation optimizer. The strong branching is a what-if analysis on each variable v, i.e. compute the best bound when v is assigned to true, compute the best bound when v is assigned to false, and then use those best bounds to improve the overall best bound. This is useful to improve the best_bound, but also to fix some variables during search. Note that using probing might be time consuming as it runs the LP solver 2 * num_variables times.
optional bool use_lp_strong_branching = 29 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 5150 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUsePotentialOneFlipRepairsInLs | ( | ) |
Whether we keep a list of variable that can potentially repair in one flip all the current infeasible constraints (such variable must at least appear in all the infeasible constraints for this to happen).
optional bool use_potential_one_flip_repairs_in_ls = 39 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4472 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseRandomLns | ( | ) |
Use the random Large Neighborhood Search instead of the exhaustive one.
optional bool use_random_lns = 6 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 3602 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseSatToChooseLnsNeighbourhood | ( | ) |
Whether we use sat propagation to choose the lns neighbourhood.
optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4018 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseSymmetry | ( | ) |
If true, find and exploit the eventual symmetries of the problem. TODO(user): turn this on by default once the symmetry finder becomes fast enough to be negligeable for most problem. Or at least support a time limit.
optional bool use_symmetry = 17 [default = false];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4138 of file BopParameters.java.
| boolean com.google.ortools.bop.BopParameters.Builder.hasUseTranspositionTableInLs | ( | ) |
Whether we use an hash set during the LS to avoid exploring more than once the "same" state. Note that because the underlying SAT solver may learn information in the middle of the LS, this may make the LS slightly less "complete", but it should be faster.
optional bool use_transposition_table_in_ls = 22 [default = true];
Implements com.google.ortools.bop.BopParametersOrBuilder.
Definition at line 4405 of file BopParameters.java.
|
protected |
Definition at line 2241 of file BopParameters.java.
| final boolean com.google.ortools.bop.BopParameters.Builder.isInitialized | ( | ) |
Definition at line 2662 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.mergeFrom | ( | com.google.ortools.bop.BopParameters | other | ) |
Definition at line 2518 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.mergeFrom | ( | com.google.protobuf.CodedInputStream | input, |
| com.google.protobuf.ExtensionRegistryLite | extensionRegistry ) throws java.io.IOException |
Definition at line 2667 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.mergeFrom | ( | com.google.protobuf.Message | other | ) |
Definition at line 2509 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.removeSolverOptimizerSets | ( | int | index | ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4935 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setComputeEstimatedImpact | ( | boolean | value | ) |
Compute estimated impact at each iteration when true; only once when false.
optional bool compute_estimated_impact = 3 [default = true];
| value | The computeEstimatedImpact to set. |
Definition at line 3454 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setDecomposedProblemMinTimeInSeconds | ( | double | value | ) |
HACK. To avoid spending too little time on small problems, spend at least this time solving each of the decomposed sub-problem. This only make sense if num_bop_solvers_used_by_decomposition is greater than 1 so that the overhead can be "absorbed" by the other threads.
optional double decomposed_problem_min_time_in_seconds = 36 [default = 0];
| value | The decomposedProblemMinTimeInSeconds to set. |
Definition at line 5387 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setDecomposerNumVariablesThreshold | ( | int | value | ) |
Only try to decompose the problem when the number of variables is greater than the threshold.
optional int32 decomposer_num_variables_threshold = 30 [default = 50];
| value | The decomposerNumVariablesThreshold to set. |
Definition at line 5257 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setDefaultSolverOptimizerSets | ( | java.lang.String | value | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
| value | The defaultSolverOptimizerSets to set. |
Definition at line 5100 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setDefaultSolverOptimizerSetsBytes | ( | com.google.protobuf.ByteString | value | ) |
optional string default_solver_optimizer_sets = 33 [default = "methods:{type:LOCAL_SEARCH } methods:{type:RANDOM_FIRST_SOLUTION } methods:{type:LINEAR_RELAXATION } methods:{type:LP_FIRST_SOLUTION } methods:{type:OBJECTIVE_FIRST_SOLUTION } methods:{type:USER_GUIDED_FIRST_SOLUTION } methods:{type:RANDOM_CONSTRAINT_LNS_GUIDED_BY_LP } methods:{type:RANDOM_VARIABLE_LNS_GUIDED_BY_LP } methods:{type:RELATION_GRAPH_LNS } methods:{type:RELATION_GRAPH_LNS_GUIDED_BY_LP } methods:{type:RANDOM_CONSTRAINT_LNS } methods:{type:RANDOM_VARIABLE_LNS } methods:{type:SAT_CORE_BASED } methods:{type:COMPLETE_LNS } "];
| value | The bytes for defaultSolverOptimizerSets to set. |
Definition at line 5123 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setExploitSymmetryInSatFirstSolution | ( | boolean | value | ) |
If true, find and exploit symmetries in proving satisfiability in the first problem. This feature is experimental. On some problems, computing symmetries may run forever. You may also run into unforseen problems as this feature was not extensively tested.
optional bool exploit_symmetry_in_sat_first_solution = 40 [default = false];
| value | The exploitSymmetryInSatFirstSolution to set. |
Definition at line 4242 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setGuidedSatConflictsChunk | ( | int | value | ) |
The first solutions based on guided SAT will work in chunk of that many conflicts at the time. This allows to simulate parallelism between the different guiding strategy on a single core.
optional int32 guided_sat_conflicts_chunk = 34 [default = 1000];
| value | The guidedSatConflictsChunk to set. |
Definition at line 5452 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setLogSearchProgress | ( | boolean | value | ) |
Whether the solver should log the search progress to LOG(INFO).
optional bool log_search_progress = 14 [default = false];
| value | The logSearchProgress to set. |
Definition at line 3398 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setLpMaxDeterministicTime | ( | double | value | ) |
The max deterministic time given to the LP solver each time it is called. If this is not enough to solve the LP at hand, it will simply be called again later (and the solve will resume from where it stopped).
optional double lp_max_deterministic_time = 37 [default = 1];
| value | The lpMaxDeterministicTime to set. |
Definition at line 3072 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxDeterministicTime | ( | double | value | ) |
Maximum time allowed in deterministic time to solve a problem. The deterministic time should be correlated with the real time used by the solver, the time unit being roughly the order of magnitude of a second. The counter will starts as soon as SetParameters() or SolveWithTimeLimit() is called.
optional double max_deterministic_time = 27 [default = inf];
| value | The maxDeterministicTime to set. |
Definition at line 3006 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxLpSolveForFeasibilityProblems | ( | int | value | ) |
The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function). Set this to a small value, e.g., 1, if fractional solutions offer useful guidance to other solvers in the portfolio. A negative value means no limit.
optional int32 max_lp_solve_for_feasibility_problems = 41 [default = 0];
| value | The maxLpSolveForFeasibilityProblems to set. |
Definition at line 5519 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfBacktracksInLs | ( | long | value | ) |
Maximum number of backtracks times the number of variables in Local Search, ie. max num backtracks == max_number_of_backtracks_in_ls / num variables.
optional int64 max_number_of_backtracks_in_ls = 11 [default = 100000000];
| value | The maxNumberOfBacktracksInLs to set. |
Definition at line 3929 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfConflictsForQuickCheck | ( | int | value | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
optional int32 max_number_of_conflicts_for_quick_check = 16 [default = 10];
| value | The maxNumberOfConflictsForQuickCheck to set. |
Definition at line 4101 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfConflictsInRandomLns | ( | int | value | ) |
The number of conflicts the SAT solver has to solve a random LNS subproblem.
optional int32 max_number_of_conflicts_in_random_lns = 9 [default = 2500];
| value | The maxNumberOfConflictsInRandomLns to set. |
Definition at line 3813 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfConflictsInRandomSolutionGeneration | ( | int | value | ) |
The number of conflicts the SAT solver has to generate a random solution.
optional int32 max_number_of_conflicts_in_random_solution_generation = 20 [default = 500];
| value | The maxNumberOfConflictsInRandomSolutionGeneration to set. |
Definition at line 4302 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfConsecutiveFailingOptimizerCalls | ( | int | value | ) |
Maximum number of consecutive optimizer calls without improving the current solution. If this number is reached, the search will be aborted. Note that this parameter only applies when an initial solution has been found or is provided. Also note that there is no limit to the number of calls, when the parameter is not set.
optional int32 max_number_of_consecutive_failing_optimizer_calls = 35;
| value | The maxNumberOfConsecutiveFailingOptimizerCalls to set. |
Definition at line 3142 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumberOfExploredAssignmentsPerTryInLs | ( | long | value | ) |
The maximum number of assignments the Local Search iterates on during one try. Note that if the Local Search is called again on the same solution it will not restart from scratch but will iterate on the next max_number_of_explored_assignments_per_try_in_ls assignments.
optional int64 max_number_of_explored_assignments_per_try_in_ls = 21 [default = 10000];
| value | The maxNumberOfExploredAssignmentsPerTryInLs to set. |
Definition at line 4367 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumBrokenConstraintsInLs | ( | int | value | ) |
Abort the LS search tree as soon as strictly more than this number of constraints are broken. The default is a large value which basically disable this heuristic.
optional int32 max_num_broken_constraints_in_ls = 38 [default = 2147483647];
| value | The maxNumBrokenConstraintsInLs to set. |
Definition at line 3340 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxNumDecisionsInLs | ( | int | value | ) |
Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
optional int32 max_num_decisions_in_ls = 2 [default = 4];
| value | The maxNumDecisionsInLs to set. |
Definition at line 3277 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setMaxTimeInSeconds | ( | double | value | ) |
Maximum time allowed in seconds to solve a problem. The counter will starts as soon as Solve() is called.
optional double max_time_in_seconds = 1 [default = inf];
| value | The maxTimeInSeconds to set. |
Definition at line 2937 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setNumberOfSolvers | ( | int | value | ) |
The number of solvers used to run Bop. Note that one thread will be created per solver. The type of communication between solvers is specified by the synchronization_type parameter.
optional int32 number_of_solvers = 24 [default = 1];
| value | The numberOfSolvers to set. |
Definition at line 4620 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setNumBopSolversUsedByDecomposition | ( | int | value | ) |
The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem. TODO(user): Merge this with the number_of_solvers parameter.
optional int32 num_bop_solvers_used_by_decomposition = 31 [default = 1];
| value | The numBopSolversUsedByDecomposition to set. |
Definition at line 5320 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setNumRandomLnsTries | ( | int | value | ) |
Number of tries in the random lns.
optional int32 num_random_lns_tries = 10 [default = 1];
| value | The numRandomLnsTries to set. |
Definition at line 3870 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setNumRelaxedVars | ( | int | value | ) |
Number of variables to relax in the exhaustive Large Neighborhood Search.
optional int32 num_relaxed_vars = 8 [default = 10];
| value | The numRelaxedVars to set. |
Definition at line 3754 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setPruneSearchTree | ( | boolean | value | ) |
Avoid exploring both branches (b, a, ...) and (a, b, ...).
optional bool prune_search_tree = 4 [default = false];
| value | The pruneSearchTree to set. |
Definition at line 3510 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setRandomSeed | ( | int | value | ) |
The seed used to initialize the random generator. TODO(user): Some of our client test fail depending on this value! we need to fix them and ideally randomize our behavior from on test to the next so that this doesn't happen in the future.
optional int32 random_seed = 7 [default = 8];
| value | The randomSeed to set. |
Definition at line 3694 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setRelativeGapLimit | ( | double | value | ) |
Limit used to stop the optimization as soon as the relative gap is smaller than the given value. The relative gap is defined as: abs(solution_cost - best_bound) / max(abs(solution_cost), abs(best_bound)).
optional double relative_gap_limit = 28 [default = 0.0001];
| value | The relativeGapLimit to set. |
Definition at line 3214 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setSolverOptimizerSets | ( | int | index, |
| com.google.ortools.bop.BopSolverOptimizerSet | value ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4759 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setSolverOptimizerSets | ( | int | index, |
| com.google.ortools.bop.BopSolverOptimizerSet.Builder | builderForValue ) |
List of set of optimizers to be run by the solvers. Note that the i_th solver will run the min(i, solver_optimizer_sets_size())_th optimizer set. The default is defined by default_solver_optimizer_sets (only one set).
repeated .operations_research.bop.BopSolverOptimizerSet solver_optimizer_sets = 26;
Definition at line 4783 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setSortConstraintsByNumTerms | ( | boolean | value | ) |
Sort constraints by increasing total number of terms instead of number of contributing terms.
optional bool sort_constraints_by_num_terms = 5 [default = false];
| value | The sortConstraintsByNumTerms to set. |
Definition at line 3569 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setSynchronizationType | ( | com.google.ortools.bop.BopParameters.ThreadSynchronizationType | value | ) |
optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
| value | The synchronizationType to set. |
Definition at line 4666 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseLearnedBinaryClausesInLp | ( | boolean | value | ) |
Whether we use the learned binary clauses in the Linear Relaxation.
optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
| value | The useLearnedBinaryClausesInLp to set. |
Definition at line 4558 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseLpLns | ( | boolean | value | ) |
Use Large Neighborhood Search based on the LP relaxation.
optional bool use_lp_lns = 12 [default = true];
| value | The useLpLns to set. |
Definition at line 3986 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseLpStrongBranching | ( | boolean | value | ) |
Use strong branching in the linear relaxation optimizer. The strong branching is a what-if analysis on each variable v, i.e. compute the best bound when v is assigned to true, compute the best bound when v is assigned to false, and then use those best bounds to improve the overall best bound. This is useful to improve the best_bound, but also to fix some variables during search. Note that using probing might be time consuming as it runs the LP solver 2 * num_variables times.
optional bool use_lp_strong_branching = 29 [default = false];
| value | The useLpStrongBranching to set. |
Definition at line 5190 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUsePotentialOneFlipRepairsInLs | ( | boolean | value | ) |
Whether we keep a list of variable that can potentially repair in one flip all the current infeasible constraints (such variable must at least appear in all the infeasible constraints for this to happen).
optional bool use_potential_one_flip_repairs_in_ls = 39 [default = false];
| value | The usePotentialOneFlipRepairsInLs to set. |
Definition at line 4500 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseRandomLns | ( | boolean | value | ) |
Use the random Large Neighborhood Search instead of the exhaustive one.
optional bool use_random_lns = 6 [default = true];
| value | The useRandomLns to set. |
Definition at line 3626 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseSatToChooseLnsNeighbourhood | ( | boolean | value | ) |
Whether we use sat propagation to choose the lns neighbourhood.
optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
| value | The useSatToChooseLnsNeighbourhood to set. |
Definition at line 4042 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseSymmetry | ( | boolean | value | ) |
If true, find and exploit the eventual symmetries of the problem. TODO(user): turn this on by default once the symmetry finder becomes fast enough to be negligeable for most problem. Or at least support a time limit.
optional bool use_symmetry = 17 [default = false];
| value | The useSymmetry to set. |
Definition at line 4170 of file BopParameters.java.
| Builder com.google.ortools.bop.BopParameters.Builder.setUseTranspositionTableInLs | ( | boolean | value | ) |
Whether we use an hash set during the LS to avoid exploring more than once the "same" state. Note that because the underlying SAT solver may learn information in the middle of the LS, this may make the LS slightly less "complete", but it should be faster.
optional bool use_transposition_table_in_ls = 22 [default = true];
| value | The useTranspositionTableInLs to set. |
Definition at line 4435 of file BopParameters.java.
1.13.2