BopParameters (com.google.ortools:ortools-java 9.12.9999 API)

java.lang.Object
- com.google.protobuf.AbstractMessageLite
- - com.google.protobuf.AbstractMessage
  - - com.google.protobuf.GeneratedMessage
    - - com.google.ortools.bop.BopParameters

All Implemented Interfaces:

BopParametersOrBuilder, com.google.protobuf.Message, com.google.protobuf.MessageLite, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, java.io.Serializable
```
public final class BopParameters
extends com.google.protobuf.GeneratedMessage
implements BopParametersOrBuilder
```
```
 Contains the definitions for all the bop algorithm parameters and their
 default values.

 NEXT TAG: 42
 
```
Protobuf type operations_research.bop.BopParameters
See Also:

Serialized Form

Nested Class Summary

Nested Classes
Modifier and Type	Class and Description
`static class`	`BopParameters.Builder` Contains the definitions for all the bop algorithm parameters and their default values.
`static class`	`BopParameters.ThreadSynchronizationType` Defines how the different solvers are synchronized during the search.

Nested classes/interfaces inherited from class com.google.protobuf.GeneratedMessage
com.google.protobuf.GeneratedMessage.ExtendableBuilder<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>,BuilderT extends com.google.protobuf.GeneratedMessage.ExtendableBuilder<MessageT,BuilderT>>, com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>>, com.google.protobuf.GeneratedMessage.ExtendableMessageOrBuilder<MessageT extends com.google.protobuf.GeneratedMessage.ExtendableMessage<MessageT>>, com.google.protobuf.GeneratedMessage.FieldAccessorTable, com.google.protobuf.GeneratedMessage.GeneratedExtension<ContainingT extends com.google.protobuf.Message,T>, com.google.protobuf.GeneratedMessage.UnusedPrivateParameter

Nested classes/interfaces inherited from class com.google.protobuf.AbstractMessage
com.google.protobuf.AbstractMessage.BuilderParent

Nested classes/interfaces inherited from class com.google.protobuf.AbstractMessageLite
com.google.protobuf.AbstractMessageLite.InternalOneOfEnum

Field Summary

Fields
Modifier and Type	Field and Description
`static int`	`COMPUTE_ESTIMATED_IMPACT_FIELD_NUMBER`
`static int`	`DECOMPOSED_PROBLEM_MIN_TIME_IN_SECONDS_FIELD_NUMBER`
`static int`	`DECOMPOSER_NUM_VARIABLES_THRESHOLD_FIELD_NUMBER`
`static int`	`DEFAULT_SOLVER_OPTIMIZER_SETS_FIELD_NUMBER`
`static int`	`EXPLOIT_SYMMETRY_IN_SAT_FIRST_SOLUTION_FIELD_NUMBER`
`static int`	`GUIDED_SAT_CONFLICTS_CHUNK_FIELD_NUMBER`
`static int`	`LOG_SEARCH_PROGRESS_FIELD_NUMBER`
`static int`	`LP_MAX_DETERMINISTIC_TIME_FIELD_NUMBER`
`static int`	`MAX_DETERMINISTIC_TIME_FIELD_NUMBER`
`static int`	`MAX_LP_SOLVE_FOR_FEASIBILITY_PROBLEMS_FIELD_NUMBER`
`static int`	`MAX_NUM_BROKEN_CONSTRAINTS_IN_LS_FIELD_NUMBER`
`static int`	`MAX_NUM_DECISIONS_IN_LS_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_BACKTRACKS_IN_LS_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_CONFLICTS_FOR_QUICK_CHECK_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_LNS_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_SOLUTION_GENERATION_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_CONSECUTIVE_FAILING_OPTIMIZER_CALLS_FIELD_NUMBER`
`static int`	`MAX_NUMBER_OF_EXPLORED_ASSIGNMENTS_PER_TRY_IN_LS_FIELD_NUMBER`
`static int`	`MAX_TIME_IN_SECONDS_FIELD_NUMBER`
`static int`	`NUM_BOP_SOLVERS_USED_BY_DECOMPOSITION_FIELD_NUMBER`
`static int`	`NUM_RANDOM_LNS_TRIES_FIELD_NUMBER`
`static int`	`NUM_RELAXED_VARS_FIELD_NUMBER`
`static int`	`NUMBER_OF_SOLVERS_FIELD_NUMBER`
`static int`	`PRUNE_SEARCH_TREE_FIELD_NUMBER`
`static int`	`RANDOM_SEED_FIELD_NUMBER`
`static int`	`RELATIVE_GAP_LIMIT_FIELD_NUMBER`
`static int`	`SOLVER_OPTIMIZER_SETS_FIELD_NUMBER`
`static int`	`SORT_CONSTRAINTS_BY_NUM_TERMS_FIELD_NUMBER`
`static int`	`SYNCHRONIZATION_TYPE_FIELD_NUMBER`
`static int`	`USE_LEARNED_BINARY_CLAUSES_IN_LP_FIELD_NUMBER`
`static int`	`USE_LP_LNS_FIELD_NUMBER`
`static int`	`USE_LP_STRONG_BRANCHING_FIELD_NUMBER`
`static int`	`USE_POTENTIAL_ONE_FLIP_REPAIRS_IN_LS_FIELD_NUMBER`
`static int`	`USE_RANDOM_LNS_FIELD_NUMBER`
`static int`	`USE_SAT_TO_CHOOSE_LNS_NEIGHBOURHOOD_FIELD_NUMBER`
`static int`	`USE_SYMMETRY_FIELD_NUMBER`
`static int`	`USE_TRANSPOSITION_TABLE_IN_LS_FIELD_NUMBER`

Fields inherited from class com.google.protobuf.GeneratedMessage
alwaysUseFieldBuilders, unknownFields

Fields inherited from class com.google.protobuf.AbstractMessage
memoizedSize

Fields inherited from class com.google.protobuf.AbstractMessageLite
memoizedHashCode

Method Summary

All Methods Static Methods Instance Methods Concrete Methods
Modifier and Type	Method and Description
`boolean`	`equals(java.lang.Object obj)`
`boolean`	`getComputeEstimatedImpact()` Compute estimated impact at each iteration when true; only once when false.
`double`	`getDecomposedProblemMinTimeInSeconds()` HACK.
`int`	`getDecomposerNumVariablesThreshold()` Only try to decompose the problem when the number of variables is greater than the threshold.
`static BopParameters`	`getDefaultInstance()`
`BopParameters`	`getDefaultInstanceForType()`
`java.lang.String`	`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 } "];
`com.google.protobuf.ByteString`	`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 } "];
`static com.google.protobuf.Descriptors.Descriptor`	`getDescriptor()`
`boolean`	`getExploitSymmetryInSatFirstSolution()` If true, find and exploit symmetries in proving satisfiability in the first problem.
`int`	`getGuidedSatConflictsChunk()` The first solutions based on guided SAT will work in chunk of that many conflicts at the time.
`boolean`	`getLogSearchProgress()` Whether the solver should log the search progress to LOG(INFO).
`double`	`getLpMaxDeterministicTime()` The max deterministic time given to the LP solver each time it is called.
`double`	`getMaxDeterministicTime()` Maximum time allowed in deterministic time to solve a problem.
`int`	`getMaxLpSolveForFeasibilityProblems()` The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function).
`long`	`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.
`int`	`getMaxNumberOfConflictsForQuickCheck()` The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
`int`	`getMaxNumberOfConflictsInRandomLns()` The number of conflicts the SAT solver has to solve a random LNS subproblem.
`int`	`getMaxNumberOfConflictsInRandomSolutionGeneration()` The number of conflicts the SAT solver has to generate a random solution.
`int`	`getMaxNumberOfConsecutiveFailingOptimizerCalls()` Maximum number of consecutive optimizer calls without improving the current solution.
`long`	`getMaxNumberOfExploredAssignmentsPerTryInLs()` The maximum number of assignments the Local Search iterates on during one try.
`int`	`getMaxNumBrokenConstraintsInLs()` Abort the LS search tree as soon as strictly more than this number of constraints are broken.
`int`	`getMaxNumDecisionsInLs()` Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
`double`	`getMaxTimeInSeconds()` Maximum time allowed in seconds to solve a problem.
`int`	`getNumberOfSolvers()` The number of solvers used to run Bop.
`int`	`getNumBopSolversUsedByDecomposition()` The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem.
`int`	`getNumRandomLnsTries()` Number of tries in the random lns.
`int`	`getNumRelaxedVars()` Number of variables to relax in the exhaustive Large Neighborhood Search.
`com.google.protobuf.Parser<BopParameters>`	`getParserForType()`
`boolean`	`getPruneSearchTree()` Avoid exploring both branches (b, a, ...) and (a, b, ...).
`int`	`getRandomSeed()` The seed used to initialize the random generator.
`double`	`getRelativeGapLimit()` Limit used to stop the optimization as soon as the relative gap is smaller than the given value.
`int`	`getSerializedSize()`
`BopSolverOptimizerSet`	`getSolverOptimizerSets(int index)` List of set of optimizers to be run by the solvers.
`int`	`getSolverOptimizerSetsCount()` List of set of optimizers to be run by the solvers.
`java.util.List<BopSolverOptimizerSet>`	`getSolverOptimizerSetsList()` List of set of optimizers to be run by the solvers.
`BopSolverOptimizerSetOrBuilder`	`getSolverOptimizerSetsOrBuilder(int index)` List of set of optimizers to be run by the solvers.
`java.util.List<? extends BopSolverOptimizerSetOrBuilder>`	`getSolverOptimizerSetsOrBuilderList()` List of set of optimizers to be run by the solvers.
`boolean`	`getSortConstraintsByNumTerms()` Sort constraints by increasing total number of terms instead of number of contributing terms.
`BopParameters.ThreadSynchronizationType`	`getSynchronizationType()` `optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];`
`boolean`	`getUseLearnedBinaryClausesInLp()` Whether we use the learned binary clauses in the Linear Relaxation.
`boolean`	`getUseLpLns()` Use Large Neighborhood Search based on the LP relaxation.
`boolean`	`getUseLpStrongBranching()` Use strong branching in the linear relaxation optimizer.
`boolean`	`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).
`boolean`	`getUseRandomLns()` Use the random Large Neighborhood Search instead of the exhaustive one.
`boolean`	`getUseSatToChooseLnsNeighbourhood()` Whether we use sat propagation to choose the lns neighbourhood.
`boolean`	`getUseSymmetry()` If true, find and exploit the eventual symmetries of the problem.
`boolean`	`getUseTranspositionTableInLs()` Whether we use an hash set during the LS to avoid exploring more than once the "same" state.
`boolean`	`hasComputeEstimatedImpact()` Compute estimated impact at each iteration when true; only once when false.
`boolean`	`hasDecomposedProblemMinTimeInSeconds()` HACK.
`boolean`	`hasDecomposerNumVariablesThreshold()` Only try to decompose the problem when the number of variables is greater than the threshold.
`boolean`	`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 } "];
`boolean`	`hasExploitSymmetryInSatFirstSolution()` If true, find and exploit symmetries in proving satisfiability in the first problem.
`boolean`	`hasGuidedSatConflictsChunk()` The first solutions based on guided SAT will work in chunk of that many conflicts at the time.
`int`	`hashCode()`
`boolean`	`hasLogSearchProgress()` Whether the solver should log the search progress to LOG(INFO).
`boolean`	`hasLpMaxDeterministicTime()` The max deterministic time given to the LP solver each time it is called.
`boolean`	`hasMaxDeterministicTime()` Maximum time allowed in deterministic time to solve a problem.
`boolean`	`hasMaxLpSolveForFeasibilityProblems()` The maximum number of time the LP solver will run to feasibility for pure feasibility problems (with a constant-valued objective function).
`boolean`	`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.
`boolean`	`hasMaxNumberOfConflictsForQuickCheck()` The number of conflicts the SAT solver has to solve a random LNS subproblem for the quick check of infeasibility.
`boolean`	`hasMaxNumberOfConflictsInRandomLns()` The number of conflicts the SAT solver has to solve a random LNS subproblem.
`boolean`	`hasMaxNumberOfConflictsInRandomSolutionGeneration()` The number of conflicts the SAT solver has to generate a random solution.
`boolean`	`hasMaxNumberOfConsecutiveFailingOptimizerCalls()` Maximum number of consecutive optimizer calls without improving the current solution.
`boolean`	`hasMaxNumberOfExploredAssignmentsPerTryInLs()` The maximum number of assignments the Local Search iterates on during one try.
`boolean`	`hasMaxNumBrokenConstraintsInLs()` Abort the LS search tree as soon as strictly more than this number of constraints are broken.
`boolean`	`hasMaxNumDecisionsInLs()` Maximum number of cascading decisions the solver might use to repair the current solution in the LS.
`boolean`	`hasMaxTimeInSeconds()` Maximum time allowed in seconds to solve a problem.
`boolean`	`hasNumberOfSolvers()` The number of solvers used to run Bop.
`boolean`	`hasNumBopSolversUsedByDecomposition()` The number of BopSolver created (thread pool workers) used by the integral solver to solve a decomposed problem.
`boolean`	`hasNumRandomLnsTries()` Number of tries in the random lns.
`boolean`	`hasNumRelaxedVars()` Number of variables to relax in the exhaustive Large Neighborhood Search.
`boolean`	`hasPruneSearchTree()` Avoid exploring both branches (b, a, ...) and (a, b, ...).
`boolean`	`hasRandomSeed()` The seed used to initialize the random generator.
`boolean`	`hasRelativeGapLimit()` Limit used to stop the optimization as soon as the relative gap is smaller than the given value.
`boolean`	`hasSortConstraintsByNumTerms()` Sort constraints by increasing total number of terms instead of number of contributing terms.
`boolean`	`hasSynchronizationType()` `optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];`
`boolean`	`hasUseLearnedBinaryClausesInLp()` Whether we use the learned binary clauses in the Linear Relaxation.
`boolean`	`hasUseLpLns()` Use Large Neighborhood Search based on the LP relaxation.
`boolean`	`hasUseLpStrongBranching()` Use strong branching in the linear relaxation optimizer.
`boolean`	`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).
`boolean`	`hasUseRandomLns()` Use the random Large Neighborhood Search instead of the exhaustive one.
`boolean`	`hasUseSatToChooseLnsNeighbourhood()` Whether we use sat propagation to choose the lns neighbourhood.
`boolean`	`hasUseSymmetry()` If true, find and exploit the eventual symmetries of the problem.
`boolean`	`hasUseTranspositionTableInLs()` Whether we use an hash set during the LS to avoid exploring more than once the "same" state.
`protected com.google.protobuf.GeneratedMessage.FieldAccessorTable`	`internalGetFieldAccessorTable()`
`boolean`	`isInitialized()`
`static BopParameters.Builder`	`newBuilder()`
`static BopParameters.Builder`	`newBuilder(BopParameters prototype)`
`BopParameters.Builder`	`newBuilderForType()`
`protected BopParameters.Builder`	`newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent)`
`static BopParameters`	`parseDelimitedFrom(java.io.InputStream input)`
`static BopParameters`	`parseDelimitedFrom(java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static BopParameters`	`parseFrom(byte[] data)`
`static BopParameters`	`parseFrom(byte[] data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static BopParameters`	`parseFrom(java.nio.ByteBuffer data)`
`static BopParameters`	`parseFrom(java.nio.ByteBuffer data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static BopParameters`	`parseFrom(com.google.protobuf.ByteString data)`
`static BopParameters`	`parseFrom(com.google.protobuf.ByteString data, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static BopParameters`	`parseFrom(com.google.protobuf.CodedInputStream input)`
`static BopParameters`	`parseFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static BopParameters`	`parseFrom(java.io.InputStream input)`
`static BopParameters`	`parseFrom(java.io.InputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry)`
`static com.google.protobuf.Parser<BopParameters>`	`parser()`
`BopParameters.Builder`	`toBuilder()`
`void`	`writeTo(com.google.protobuf.CodedOutputStream output)`

Methods inherited from class com.google.protobuf.GeneratedMessage
canUseUnsafe, computeStringSize, computeStringSizeNoTag, emptyBooleanList, emptyDoubleList, emptyFloatList, emptyIntList, emptyList, emptyLongList, getAllFields, getDescriptorForType, getField, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof, internalGetMapField, internalGetMapFieldReflection, isStringEmpty, makeMutableCopy, makeMutableCopy, mergeFromAndMakeImmutableInternal, newFileScopedGeneratedExtension, newInstance, newMessageScopedGeneratedExtension, parseDelimitedWithIOException, parseDelimitedWithIOException, parseUnknownField, parseUnknownFieldProto3, parseWithIOException, parseWithIOException, parseWithIOException, parseWithIOException, serializeBooleanMapTo, serializeIntegerMapTo, serializeLongMapTo, serializeStringMapTo, writeReplace, writeString, writeStringNoTag

Methods inherited from class com.google.protobuf.AbstractMessage
findInitializationErrors, getInitializationErrorString, hashFields, toString

Methods inherited from class com.google.protobuf.AbstractMessageLite
addAll, checkByteStringIsUtf8, toByteArray, toByteString, writeDelimitedTo, writeTo

Methods inherited from class java.lang.Object
clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Methods inherited from interface com.google.protobuf.MessageOrBuilder
findInitializationErrors, getAllFields, getDescriptorForType, getField, getInitializationErrorString, getOneofFieldDescriptor, getRepeatedField, getRepeatedFieldCount, getUnknownFields, hasField, hasOneof

Methods inherited from interface com.google.protobuf.MessageLite
toByteArray, toByteString, writeDelimitedTo, writeTo

- Field Detail
  - MAX_TIME_IN_SECONDS_FIELD_NUMBER
```
public static final int MAX_TIME_IN_SECONDS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_DETERMINISTIC_TIME_FIELD_NUMBER
```
public static final int MAX_DETERMINISTIC_TIME_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - LP_MAX_DETERMINISTIC_TIME_FIELD_NUMBER
```
public static final int LP_MAX_DETERMINISTIC_TIME_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_CONSECUTIVE_FAILING_OPTIMIZER_CALLS_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_CONSECUTIVE_FAILING_OPTIMIZER_CALLS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - RELATIVE_GAP_LIMIT_FIELD_NUMBER
```
public static final int RELATIVE_GAP_LIMIT_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUM_DECISIONS_IN_LS_FIELD_NUMBER
```
public static final int MAX_NUM_DECISIONS_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUM_BROKEN_CONSTRAINTS_IN_LS_FIELD_NUMBER
```
public static final int MAX_NUM_BROKEN_CONSTRAINTS_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - LOG_SEARCH_PROGRESS_FIELD_NUMBER
```
public static final int LOG_SEARCH_PROGRESS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - COMPUTE_ESTIMATED_IMPACT_FIELD_NUMBER
```
public static final int COMPUTE_ESTIMATED_IMPACT_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - PRUNE_SEARCH_TREE_FIELD_NUMBER
```
public static final int PRUNE_SEARCH_TREE_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - SORT_CONSTRAINTS_BY_NUM_TERMS_FIELD_NUMBER
```
public static final int SORT_CONSTRAINTS_BY_NUM_TERMS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_RANDOM_LNS_FIELD_NUMBER
```
public static final int USE_RANDOM_LNS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - RANDOM_SEED_FIELD_NUMBER
```
public static final int RANDOM_SEED_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - NUM_RELAXED_VARS_FIELD_NUMBER
```
public static final int NUM_RELAXED_VARS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_LNS_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_LNS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - NUM_RANDOM_LNS_TRIES_FIELD_NUMBER
```
public static final int NUM_RANDOM_LNS_TRIES_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_BACKTRACKS_IN_LS_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_BACKTRACKS_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_LP_LNS_FIELD_NUMBER
```
public static final int USE_LP_LNS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_SAT_TO_CHOOSE_LNS_NEIGHBOURHOOD_FIELD_NUMBER
```
public static final int USE_SAT_TO_CHOOSE_LNS_NEIGHBOURHOOD_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_CONFLICTS_FOR_QUICK_CHECK_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_CONFLICTS_FOR_QUICK_CHECK_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_SYMMETRY_FIELD_NUMBER
```
public static final int USE_SYMMETRY_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - EXPLOIT_SYMMETRY_IN_SAT_FIRST_SOLUTION_FIELD_NUMBER
```
public static final int EXPLOIT_SYMMETRY_IN_SAT_FIRST_SOLUTION_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_SOLUTION_GENERATION_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_SOLUTION_GENERATION_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_NUMBER_OF_EXPLORED_ASSIGNMENTS_PER_TRY_IN_LS_FIELD_NUMBER
```
public static final int MAX_NUMBER_OF_EXPLORED_ASSIGNMENTS_PER_TRY_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_TRANSPOSITION_TABLE_IN_LS_FIELD_NUMBER
```
public static final int USE_TRANSPOSITION_TABLE_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_POTENTIAL_ONE_FLIP_REPAIRS_IN_LS_FIELD_NUMBER
```
public static final int USE_POTENTIAL_ONE_FLIP_REPAIRS_IN_LS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_LEARNED_BINARY_CLAUSES_IN_LP_FIELD_NUMBER
```
public static final int USE_LEARNED_BINARY_CLAUSES_IN_LP_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - NUMBER_OF_SOLVERS_FIELD_NUMBER
```
public static final int NUMBER_OF_SOLVERS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - SYNCHRONIZATION_TYPE_FIELD_NUMBER
```
public static final int SYNCHRONIZATION_TYPE_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - SOLVER_OPTIMIZER_SETS_FIELD_NUMBER
```
public static final int SOLVER_OPTIMIZER_SETS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - DEFAULT_SOLVER_OPTIMIZER_SETS_FIELD_NUMBER
```
public static final int DEFAULT_SOLVER_OPTIMIZER_SETS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - USE_LP_STRONG_BRANCHING_FIELD_NUMBER
```
public static final int USE_LP_STRONG_BRANCHING_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - DECOMPOSER_NUM_VARIABLES_THRESHOLD_FIELD_NUMBER
```
public static final int DECOMPOSER_NUM_VARIABLES_THRESHOLD_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - NUM_BOP_SOLVERS_USED_BY_DECOMPOSITION_FIELD_NUMBER
```
public static final int NUM_BOP_SOLVERS_USED_BY_DECOMPOSITION_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - DECOMPOSED_PROBLEM_MIN_TIME_IN_SECONDS_FIELD_NUMBER
```
public static final int DECOMPOSED_PROBLEM_MIN_TIME_IN_SECONDS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - GUIDED_SAT_CONFLICTS_CHUNK_FIELD_NUMBER
```
public static final int GUIDED_SAT_CONFLICTS_CHUNK_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
  - MAX_LP_SOLVE_FOR_FEASIBILITY_PROBLEMS_FIELD_NUMBER
```
public static final int MAX_LP_SOLVE_FOR_FEASIBILITY_PROBLEMS_FIELD_NUMBER
```
    See Also:
    
    Constant Field Values
- Method Detail
  - getDescriptor
```
public static final com.google.protobuf.Descriptors.Descriptor getDescriptor()
```
  - internalGetFieldAccessorTable
```
protected com.google.protobuf.GeneratedMessage.FieldAccessorTable internalGetFieldAccessorTable()
```
    Specified by:
    
    internalGetFieldAccessorTable in class com.google.protobuf.GeneratedMessage
  - hasMaxTimeInSeconds
```
public boolean 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];
    Specified by:
    
    hasMaxTimeInSeconds in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxTimeInSeconds field is set.
  - getMaxTimeInSeconds
```
public double 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];
    Specified by:
    
    getMaxTimeInSeconds in interface BopParametersOrBuilder
    
    Returns:
    
    The maxTimeInSeconds.
  - hasMaxDeterministicTime
```
public boolean 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];
    Specified by:
    
    hasMaxDeterministicTime in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxDeterministicTime field is set.
  - getMaxDeterministicTime
```
public double 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];
    Specified by:
    
    getMaxDeterministicTime in interface BopParametersOrBuilder
    
    Returns:
    
    The maxDeterministicTime.
  - hasLpMaxDeterministicTime
```
public boolean 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];
    Specified by:
    
    hasLpMaxDeterministicTime in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the lpMaxDeterministicTime field is set.
  - getLpMaxDeterministicTime
```
public double 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];
    Specified by:
    
    getLpMaxDeterministicTime in interface BopParametersOrBuilder
    
    Returns:
    
    The lpMaxDeterministicTime.
  - hasMaxNumberOfConsecutiveFailingOptimizerCalls
```
public boolean 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;
    Specified by:
    
    hasMaxNumberOfConsecutiveFailingOptimizerCalls in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfConsecutiveFailingOptimizerCalls field is set.
  - getMaxNumberOfConsecutiveFailingOptimizerCalls
```
public int 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;
    Specified by:
    
    getMaxNumberOfConsecutiveFailingOptimizerCalls in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfConsecutiveFailingOptimizerCalls.
  - hasRelativeGapLimit
```
public boolean 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];
    Specified by:
    
    hasRelativeGapLimit in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the relativeGapLimit field is set.
  - getRelativeGapLimit
```
public double 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];
    Specified by:
    
    getRelativeGapLimit in interface BopParametersOrBuilder
    
    Returns:
    
    The relativeGapLimit.
  - hasMaxNumDecisionsInLs
```
public boolean 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];
    Specified by:
    
    hasMaxNumDecisionsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumDecisionsInLs field is set.
  - getMaxNumDecisionsInLs
```
public int 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];
    Specified by:
    
    getMaxNumDecisionsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumDecisionsInLs.
  - hasMaxNumBrokenConstraintsInLs
```
public boolean 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];
    Specified by:
    
    hasMaxNumBrokenConstraintsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumBrokenConstraintsInLs field is set.
  - getMaxNumBrokenConstraintsInLs
```
public int 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];
    Specified by:
    
    getMaxNumBrokenConstraintsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumBrokenConstraintsInLs.
  - hasLogSearchProgress
```
public boolean hasLogSearchProgress()
```
```
 Whether the solver should log the search progress to LOG(INFO).
 
```
    optional bool log_search_progress = 14 [default = false];
    Specified by:
    
    hasLogSearchProgress in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the logSearchProgress field is set.
  - getLogSearchProgress
```
public boolean getLogSearchProgress()
```
```
 Whether the solver should log the search progress to LOG(INFO).
 
```
    optional bool log_search_progress = 14 [default = false];
    Specified by:
    
    getLogSearchProgress in interface BopParametersOrBuilder
    
    Returns:
    
    The logSearchProgress.
  - hasComputeEstimatedImpact
```
public boolean hasComputeEstimatedImpact()
```
```
 Compute estimated impact at each iteration when true; only once when false.
 
```
    optional bool compute_estimated_impact = 3 [default = true];
    Specified by:
    
    hasComputeEstimatedImpact in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the computeEstimatedImpact field is set.
  - getComputeEstimatedImpact
```
public boolean getComputeEstimatedImpact()
```
```
 Compute estimated impact at each iteration when true; only once when false.
 
```
    optional bool compute_estimated_impact = 3 [default = true];
    Specified by:
    
    getComputeEstimatedImpact in interface BopParametersOrBuilder
    
    Returns:
    
    The computeEstimatedImpact.
  - hasPruneSearchTree
```
public boolean hasPruneSearchTree()
```
```
 Avoid exploring both branches (b, a, ...) and (a, b, ...).
 
```
    optional bool prune_search_tree = 4 [default = false];
    Specified by:
    
    hasPruneSearchTree in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the pruneSearchTree field is set.
  - getPruneSearchTree
```
public boolean getPruneSearchTree()
```
```
 Avoid exploring both branches (b, a, ...) and (a, b, ...).
 
```
    optional bool prune_search_tree = 4 [default = false];
    Specified by:
    
    getPruneSearchTree in interface BopParametersOrBuilder
    
    Returns:
    
    The pruneSearchTree.
  - hasSortConstraintsByNumTerms
```
public boolean 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];
    Specified by:
    
    hasSortConstraintsByNumTerms in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the sortConstraintsByNumTerms field is set.
  - getSortConstraintsByNumTerms
```
public boolean 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];
    Specified by:
    
    getSortConstraintsByNumTerms in interface BopParametersOrBuilder
    
    Returns:
    
    The sortConstraintsByNumTerms.
  - hasUseRandomLns
```
public boolean hasUseRandomLns()
```
```
 Use the random Large Neighborhood Search instead of the exhaustive one.
 
```
    optional bool use_random_lns = 6 [default = true];
    Specified by:
    
    hasUseRandomLns in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useRandomLns field is set.
  - getUseRandomLns
```
public boolean getUseRandomLns()
```
```
 Use the random Large Neighborhood Search instead of the exhaustive one.
 
```
    optional bool use_random_lns = 6 [default = true];
    Specified by:
    
    getUseRandomLns in interface BopParametersOrBuilder
    
    Returns:
    
    The useRandomLns.
  - hasRandomSeed
```
public boolean 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];
    Specified by:
    
    hasRandomSeed in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the randomSeed field is set.
  - getRandomSeed
```
public int 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];
    Specified by:
    
    getRandomSeed in interface BopParametersOrBuilder
    
    Returns:
    
    The randomSeed.
  - hasNumRelaxedVars
```
public boolean hasNumRelaxedVars()
```
```
 Number of variables to relax in the exhaustive Large Neighborhood Search.
 
```
    optional int32 num_relaxed_vars = 8 [default = 10];
    Specified by:
    
    hasNumRelaxedVars in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the numRelaxedVars field is set.
  - getNumRelaxedVars
```
public int getNumRelaxedVars()
```
```
 Number of variables to relax in the exhaustive Large Neighborhood Search.
 
```
    optional int32 num_relaxed_vars = 8 [default = 10];
    Specified by:
    
    getNumRelaxedVars in interface BopParametersOrBuilder
    
    Returns:
    
    The numRelaxedVars.
  - hasMaxNumberOfConflictsInRandomLns
```
public boolean 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];
    Specified by:
    
    hasMaxNumberOfConflictsInRandomLns in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfConflictsInRandomLns field is set.
  - getMaxNumberOfConflictsInRandomLns
```
public int 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];
    Specified by:
    
    getMaxNumberOfConflictsInRandomLns in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfConflictsInRandomLns.
  - hasNumRandomLnsTries
```
public boolean hasNumRandomLnsTries()
```
```
 Number of tries in the random lns.
 
```
    optional int32 num_random_lns_tries = 10 [default = 1];
    Specified by:
    
    hasNumRandomLnsTries in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the numRandomLnsTries field is set.
  - getNumRandomLnsTries
```
public int getNumRandomLnsTries()
```
```
 Number of tries in the random lns.
 
```
    optional int32 num_random_lns_tries = 10 [default = 1];
    Specified by:
    
    getNumRandomLnsTries in interface BopParametersOrBuilder
    
    Returns:
    
    The numRandomLnsTries.
  - hasMaxNumberOfBacktracksInLs
```
public boolean 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];
    Specified by:
    
    hasMaxNumberOfBacktracksInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfBacktracksInLs field is set.
  - getMaxNumberOfBacktracksInLs
```
public long 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];
    Specified by:
    
    getMaxNumberOfBacktracksInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfBacktracksInLs.
  - hasUseLpLns
```
public boolean hasUseLpLns()
```
```
 Use Large Neighborhood Search based on the LP relaxation.
 
```
    optional bool use_lp_lns = 12 [default = true];
    Specified by:
    
    hasUseLpLns in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useLpLns field is set.
  - getUseLpLns
```
public boolean getUseLpLns()
```
```
 Use Large Neighborhood Search based on the LP relaxation.
 
```
    optional bool use_lp_lns = 12 [default = true];
    Specified by:
    
    getUseLpLns in interface BopParametersOrBuilder
    
    Returns:
    
    The useLpLns.
  - hasUseSatToChooseLnsNeighbourhood
```
public boolean hasUseSatToChooseLnsNeighbourhood()
```
```
 Whether we use sat propagation to choose the lns neighbourhood.
 
```
    optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
    Specified by:
    
    hasUseSatToChooseLnsNeighbourhood in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useSatToChooseLnsNeighbourhood field is set.
  - getUseSatToChooseLnsNeighbourhood
```
public boolean getUseSatToChooseLnsNeighbourhood()
```
```
 Whether we use sat propagation to choose the lns neighbourhood.
 
```
    optional bool use_sat_to_choose_lns_neighbourhood = 15 [default = true];
    Specified by:
    
    getUseSatToChooseLnsNeighbourhood in interface BopParametersOrBuilder
    
    Returns:
    
    The useSatToChooseLnsNeighbourhood.
  - hasMaxNumberOfConflictsForQuickCheck
```
public boolean 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];
    Specified by:
    
    hasMaxNumberOfConflictsForQuickCheck in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfConflictsForQuickCheck field is set.
  - getMaxNumberOfConflictsForQuickCheck
```
public int 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];
    Specified by:
    
    getMaxNumberOfConflictsForQuickCheck in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfConflictsForQuickCheck.
  - hasUseSymmetry
```
public boolean 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];
    Specified by:
    
    hasUseSymmetry in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useSymmetry field is set.
  - getUseSymmetry
```
public boolean 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];
    Specified by:
    
    getUseSymmetry in interface BopParametersOrBuilder
    
    Returns:
    
    The useSymmetry.
  - hasExploitSymmetryInSatFirstSolution
```
public boolean 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];
    Specified by:
    
    hasExploitSymmetryInSatFirstSolution in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the exploitSymmetryInSatFirstSolution field is set.
  - getExploitSymmetryInSatFirstSolution
```
public boolean 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];
    Specified by:
    
    getExploitSymmetryInSatFirstSolution in interface BopParametersOrBuilder
    
    Returns:
    
    The exploitSymmetryInSatFirstSolution.
  - hasMaxNumberOfConflictsInRandomSolutionGeneration
```
public boolean 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];
    Specified by:
    
    hasMaxNumberOfConflictsInRandomSolutionGeneration in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfConflictsInRandomSolutionGeneration field is set.
  - getMaxNumberOfConflictsInRandomSolutionGeneration
```
public int 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];
    Specified by:
    
    getMaxNumberOfConflictsInRandomSolutionGeneration in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfConflictsInRandomSolutionGeneration.
  - hasMaxNumberOfExploredAssignmentsPerTryInLs
```
public boolean 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];
    Specified by:
    
    hasMaxNumberOfExploredAssignmentsPerTryInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxNumberOfExploredAssignmentsPerTryInLs field is set.
  - getMaxNumberOfExploredAssignmentsPerTryInLs
```
public long 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];
    Specified by:
    
    getMaxNumberOfExploredAssignmentsPerTryInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The maxNumberOfExploredAssignmentsPerTryInLs.
  - hasUseTranspositionTableInLs
```
public boolean 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];
    Specified by:
    
    hasUseTranspositionTableInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useTranspositionTableInLs field is set.
  - getUseTranspositionTableInLs
```
public boolean 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];
    Specified by:
    
    getUseTranspositionTableInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The useTranspositionTableInLs.
  - hasUsePotentialOneFlipRepairsInLs
```
public boolean 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];
    Specified by:
    
    hasUsePotentialOneFlipRepairsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the usePotentialOneFlipRepairsInLs field is set.
  - getUsePotentialOneFlipRepairsInLs
```
public boolean 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];
    Specified by:
    
    getUsePotentialOneFlipRepairsInLs in interface BopParametersOrBuilder
    
    Returns:
    
    The usePotentialOneFlipRepairsInLs.
  - hasUseLearnedBinaryClausesInLp
```
public boolean hasUseLearnedBinaryClausesInLp()
```
```
 Whether we use the learned binary clauses in the Linear Relaxation.
 
```
    optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
    Specified by:
    
    hasUseLearnedBinaryClausesInLp in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useLearnedBinaryClausesInLp field is set.
  - getUseLearnedBinaryClausesInLp
```
public boolean getUseLearnedBinaryClausesInLp()
```
```
 Whether we use the learned binary clauses in the Linear Relaxation.
 
```
    optional bool use_learned_binary_clauses_in_lp = 23 [default = true];
    Specified by:
    
    getUseLearnedBinaryClausesInLp in interface BopParametersOrBuilder
    
    Returns:
    
    The useLearnedBinaryClausesInLp.
  - hasNumberOfSolvers
```
public boolean 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];
    Specified by:
    
    hasNumberOfSolvers in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the numberOfSolvers field is set.
  - getNumberOfSolvers
```
public int 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];
    Specified by:
    
    getNumberOfSolvers in interface BopParametersOrBuilder
    
    Returns:
    
    The numberOfSolvers.
  - hasSynchronizationType
```
public boolean hasSynchronizationType()
```
    optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
    
    Specified by:
    
    hasSynchronizationType in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the synchronizationType field is set.
  - getSynchronizationType
```
public BopParameters.ThreadSynchronizationType getSynchronizationType()
```
    optional .operations_research.bop.BopParameters.ThreadSynchronizationType synchronization_type = 25 [default = NO_SYNCHRONIZATION];
    
    Specified by:
    
    getSynchronizationType in interface BopParametersOrBuilder
    
    Returns:
    
    The synchronizationType.
  - getSolverOptimizerSetsList
```
public java.util.List<BopSolverOptimizerSet> 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;
    Specified by:
    
    getSolverOptimizerSetsList in interface BopParametersOrBuilder
  - getSolverOptimizerSetsOrBuilderList
```
public java.util.List<? extends BopSolverOptimizerSetOrBuilder> 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;
    Specified by:
    
    getSolverOptimizerSetsOrBuilderList in interface BopParametersOrBuilder
  - getSolverOptimizerSetsCount
```
public int 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;
    Specified by:
    
    getSolverOptimizerSetsCount in interface BopParametersOrBuilder
  - getSolverOptimizerSets
```
public BopSolverOptimizerSet 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;
    Specified by:
    
    getSolverOptimizerSets in interface BopParametersOrBuilder
  - getSolverOptimizerSetsOrBuilder
```
public BopSolverOptimizerSetOrBuilder 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;
    Specified by:
    
    getSolverOptimizerSetsOrBuilder in interface BopParametersOrBuilder
  - hasDefaultSolverOptimizerSets
```
public boolean 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 } "];
    
    Specified by:
    
    hasDefaultSolverOptimizerSets in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the defaultSolverOptimizerSets field is set.
  - getDefaultSolverOptimizerSets
```
public java.lang.String 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 } "];
    
    Specified by:
    
    getDefaultSolverOptimizerSets in interface BopParametersOrBuilder
    
    Returns:
    
    The defaultSolverOptimizerSets.
  - getDefaultSolverOptimizerSetsBytes
```
public com.google.protobuf.ByteString 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 } "];
    
    Specified by:
    
    getDefaultSolverOptimizerSetsBytes in interface BopParametersOrBuilder
    
    Returns:
    
    The bytes for defaultSolverOptimizerSets.
  - hasUseLpStrongBranching
```
public boolean 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];
    Specified by:
    
    hasUseLpStrongBranching in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the useLpStrongBranching field is set.
  - getUseLpStrongBranching
```
public boolean 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];
    Specified by:
    
    getUseLpStrongBranching in interface BopParametersOrBuilder
    
    Returns:
    
    The useLpStrongBranching.
  - hasDecomposerNumVariablesThreshold
```
public boolean 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];
    Specified by:
    
    hasDecomposerNumVariablesThreshold in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the decomposerNumVariablesThreshold field is set.
  - getDecomposerNumVariablesThreshold
```
public int 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];
    Specified by:
    
    getDecomposerNumVariablesThreshold in interface BopParametersOrBuilder
    
    Returns:
    
    The decomposerNumVariablesThreshold.
  - hasNumBopSolversUsedByDecomposition
```
public boolean 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];
    Specified by:
    
    hasNumBopSolversUsedByDecomposition in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the numBopSolversUsedByDecomposition field is set.
  - getNumBopSolversUsedByDecomposition
```
public int 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];
    Specified by:
    
    getNumBopSolversUsedByDecomposition in interface BopParametersOrBuilder
    
    Returns:
    
    The numBopSolversUsedByDecomposition.
  - hasDecomposedProblemMinTimeInSeconds
```
public boolean 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];
    Specified by:
    
    hasDecomposedProblemMinTimeInSeconds in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the decomposedProblemMinTimeInSeconds field is set.
  - getDecomposedProblemMinTimeInSeconds
```
public double 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];
    Specified by:
    
    getDecomposedProblemMinTimeInSeconds in interface BopParametersOrBuilder
    
    Returns:
    
    The decomposedProblemMinTimeInSeconds.
  - hasGuidedSatConflictsChunk
```
public boolean 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];
    Specified by:
    
    hasGuidedSatConflictsChunk in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the guidedSatConflictsChunk field is set.
  - getGuidedSatConflictsChunk
```
public int 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];
    Specified by:
    
    getGuidedSatConflictsChunk in interface BopParametersOrBuilder
    
    Returns:
    
    The guidedSatConflictsChunk.
  - hasMaxLpSolveForFeasibilityProblems
```
public boolean 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];
    Specified by:
    
    hasMaxLpSolveForFeasibilityProblems in interface BopParametersOrBuilder
    
    Returns:
    
    Whether the maxLpSolveForFeasibilityProblems field is set.
  - getMaxLpSolveForFeasibilityProblems
```
public int 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];
    Specified by:
    
    getMaxLpSolveForFeasibilityProblems in interface BopParametersOrBuilder
    
    Returns:
    
    The maxLpSolveForFeasibilityProblems.
  - isInitialized
```
public final boolean isInitialized()
```
    Specified by:
    
    isInitialized in interface com.google.protobuf.MessageLiteOrBuilder
    
    Overrides:
    
    isInitialized in class com.google.protobuf.GeneratedMessage
  - writeTo
```
public void writeTo(com.google.protobuf.CodedOutputStream output)
             throws java.io.IOException
```
    Specified by:
    
    writeTo in interface com.google.protobuf.MessageLite
    
    Overrides:
    
    writeTo in class com.google.protobuf.GeneratedMessage
    
    Throws:
    
    java.io.IOException
  - getSerializedSize
```
public int getSerializedSize()
```
    Specified by:
    
    getSerializedSize in interface com.google.protobuf.MessageLite
    
    Overrides:
    
    getSerializedSize in class com.google.protobuf.GeneratedMessage
  - equals
```
public boolean equals(java.lang.Object obj)
```
    Specified by:
    
    equals in interface com.google.protobuf.Message
    
    Overrides:
    
    equals in class com.google.protobuf.AbstractMessage
  - hashCode
```
public int hashCode()
```
    Specified by:
    
    hashCode in interface com.google.protobuf.Message
    
    Overrides:
    
    hashCode in class com.google.protobuf.AbstractMessage
  - parseFrom
```
public static BopParameters parseFrom(java.nio.ByteBuffer data)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(java.nio.ByteBuffer data,
                                      com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(com.google.protobuf.ByteString data)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(com.google.protobuf.ByteString data,
                                      com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(byte[] data)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(byte[] data,
                                      com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                               throws com.google.protobuf.InvalidProtocolBufferException
```
    Throws:
    
    com.google.protobuf.InvalidProtocolBufferException
  - parseFrom
```
public static BopParameters parseFrom(java.io.InputStream input)
                               throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - parseFrom
```
public static BopParameters parseFrom(java.io.InputStream input,
                                      com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                               throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - parseDelimitedFrom
```
public static BopParameters parseDelimitedFrom(java.io.InputStream input)
                                        throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - parseDelimitedFrom
```
public static BopParameters parseDelimitedFrom(java.io.InputStream input,
                                               com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                                        throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - parseFrom
```
public static BopParameters parseFrom(com.google.protobuf.CodedInputStream input)
                               throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - parseFrom
```
public static BopParameters parseFrom(com.google.protobuf.CodedInputStream input,
                                      com.google.protobuf.ExtensionRegistryLite extensionRegistry)
                               throws java.io.IOException
```
    Throws:
    
    java.io.IOException
  - newBuilderForType
```
public BopParameters.Builder newBuilderForType()
```
    Specified by:
    
    newBuilderForType in interface com.google.protobuf.Message
    
    Specified by:
    
    newBuilderForType in interface com.google.protobuf.MessageLite
  - newBuilder
```
public static BopParameters.Builder newBuilder()
```
  - newBuilder
```
public static BopParameters.Builder newBuilder(BopParameters prototype)
```
  - toBuilder
```
public BopParameters.Builder toBuilder()
```
    Specified by:
    
    toBuilder in interface com.google.protobuf.Message
    
    Specified by:
    
    toBuilder in interface com.google.protobuf.MessageLite
  - newBuilderForType
```
protected BopParameters.Builder newBuilderForType(com.google.protobuf.AbstractMessage.BuilderParent parent)
```
    Overrides:
    
    newBuilderForType in class com.google.protobuf.AbstractMessage
  - getDefaultInstance
```
public static BopParameters getDefaultInstance()
```
  - parser
```
public static com.google.protobuf.Parser<BopParameters> parser()
```
  - getParserForType
```
public com.google.protobuf.Parser<BopParameters> getParserForType()
```
    Specified by:
    
    getParserForType in interface com.google.protobuf.Message
    
    Specified by:
    
    getParserForType in interface com.google.protobuf.MessageLite
    
    Overrides:
    
    getParserForType in class com.google.protobuf.GeneratedMessage
  - getDefaultInstanceForType
```
public BopParameters getDefaultInstanceForType()
```
    Specified by:
    
    getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuilder
    
    Specified by:
    
    getDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilder

Class BopParameters

Nested Class Summary

Nested classes/interfaces inherited from class com.google.protobuf.GeneratedMessage

Nested classes/interfaces inherited from class com.google.protobuf.AbstractMessage

Nested classes/interfaces inherited from class com.google.protobuf.AbstractMessageLite

Field Summary

Fields inherited from class com.google.protobuf.GeneratedMessage

Fields inherited from class com.google.protobuf.AbstractMessage

Fields inherited from class com.google.protobuf.AbstractMessageLite

Method Summary

Methods inherited from class com.google.protobuf.GeneratedMessage

Methods inherited from class com.google.protobuf.AbstractMessage

Methods inherited from class com.google.protobuf.AbstractMessageLite

Methods inherited from class java.lang.Object

Methods inherited from interface com.google.protobuf.MessageOrBuilder

Methods inherited from interface com.google.protobuf.MessageLite

Field Detail

MAX_TIME_IN_SECONDS_FIELD_NUMBER

MAX_DETERMINISTIC_TIME_FIELD_NUMBER

LP_MAX_DETERMINISTIC_TIME_FIELD_NUMBER

MAX_NUMBER_OF_CONSECUTIVE_FAILING_OPTIMIZER_CALLS_FIELD_NUMBER

RELATIVE_GAP_LIMIT_FIELD_NUMBER

MAX_NUM_DECISIONS_IN_LS_FIELD_NUMBER

MAX_NUM_BROKEN_CONSTRAINTS_IN_LS_FIELD_NUMBER

LOG_SEARCH_PROGRESS_FIELD_NUMBER

COMPUTE_ESTIMATED_IMPACT_FIELD_NUMBER

PRUNE_SEARCH_TREE_FIELD_NUMBER

SORT_CONSTRAINTS_BY_NUM_TERMS_FIELD_NUMBER

USE_RANDOM_LNS_FIELD_NUMBER

RANDOM_SEED_FIELD_NUMBER

NUM_RELAXED_VARS_FIELD_NUMBER

MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_LNS_FIELD_NUMBER

NUM_RANDOM_LNS_TRIES_FIELD_NUMBER

MAX_NUMBER_OF_BACKTRACKS_IN_LS_FIELD_NUMBER

USE_LP_LNS_FIELD_NUMBER

USE_SAT_TO_CHOOSE_LNS_NEIGHBOURHOOD_FIELD_NUMBER

MAX_NUMBER_OF_CONFLICTS_FOR_QUICK_CHECK_FIELD_NUMBER

USE_SYMMETRY_FIELD_NUMBER

EXPLOIT_SYMMETRY_IN_SAT_FIRST_SOLUTION_FIELD_NUMBER

MAX_NUMBER_OF_CONFLICTS_IN_RANDOM_SOLUTION_GENERATION_FIELD_NUMBER

MAX_NUMBER_OF_EXPLORED_ASSIGNMENTS_PER_TRY_IN_LS_FIELD_NUMBER

USE_TRANSPOSITION_TABLE_IN_LS_FIELD_NUMBER

USE_POTENTIAL_ONE_FLIP_REPAIRS_IN_LS_FIELD_NUMBER

USE_LEARNED_BINARY_CLAUSES_IN_LP_FIELD_NUMBER

NUMBER_OF_SOLVERS_FIELD_NUMBER

SYNCHRONIZATION_TYPE_FIELD_NUMBER

SOLVER_OPTIMIZER_SETS_FIELD_NUMBER

DEFAULT_SOLVER_OPTIMIZER_SETS_FIELD_NUMBER

USE_LP_STRONG_BRANCHING_FIELD_NUMBER

DECOMPOSER_NUM_VARIABLES_THRESHOLD_FIELD_NUMBER

NUM_BOP_SOLVERS_USED_BY_DECOMPOSITION_FIELD_NUMBER

DECOMPOSED_PROBLEM_MIN_TIME_IN_SECONDS_FIELD_NUMBER

GUIDED_SAT_CONFLICTS_CHUNK_FIELD_NUMBER

MAX_LP_SOLVE_FOR_FEASIBILITY_PROBLEMS_FIELD_NUMBER

Method Detail

getDescriptor

internalGetFieldAccessorTable

hasMaxTimeInSeconds

getMaxTimeInSeconds

hasMaxDeterministicTime

getMaxDeterministicTime

hasLpMaxDeterministicTime

getLpMaxDeterministicTime

hasMaxNumberOfConsecutiveFailingOptimizerCalls

getMaxNumberOfConsecutiveFailingOptimizerCalls

hasRelativeGapLimit

getRelativeGapLimit

hasMaxNumDecisionsInLs

getMaxNumDecisionsInLs

hasMaxNumBrokenConstraintsInLs

getMaxNumBrokenConstraintsInLs

hasLogSearchProgress

getLogSearchProgress

hasComputeEstimatedImpact

getComputeEstimatedImpact

hasPruneSearchTree

getPruneSearchTree

hasSortConstraintsByNumTerms

getSortConstraintsByNumTerms

hasUseRandomLns