Class SatParameters.Builder

java.lang.Object
com.google.protobuf.AbstractMessageLite.Builder
com.google.protobuf.AbstractMessage.Builder<SatParameters.Builder>
com.google.protobuf.GeneratedMessage.Builder<SatParameters.Builder>
com.google.ortools.sat.SatParameters.Builder
All Implemented Interfaces:
SatParametersOrBuilder, com.google.protobuf.Message.Builder, com.google.protobuf.MessageLite.Builder, com.google.protobuf.MessageLiteOrBuilder, com.google.protobuf.MessageOrBuilder, Cloneable
Enclosing class:
SatParameters

public static final class SatParameters.Builder extends com.google.protobuf.GeneratedMessage.Builder<SatParameters.Builder> implements SatParametersOrBuilder
 Contains the definitions for all the sat algorithm parameters and their
 default values.

 NEXT TAG: 325
 
Protobuf type operations_research.sat.SatParameters
  • Method Details

    • 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.Builder<SatParameters.Builder>
    • clear

      public SatParameters.Builder clear()
      Specified by:
      clear in interface com.google.protobuf.Message.Builder
      Specified by:
      clear in interface com.google.protobuf.MessageLite.Builder
      Overrides:
      clear in class com.google.protobuf.GeneratedMessage.Builder<SatParameters.Builder>
    • getDescriptorForType

      public com.google.protobuf.Descriptors.Descriptor getDescriptorForType()
      Specified by:
      getDescriptorForType in interface com.google.protobuf.Message.Builder
      Specified by:
      getDescriptorForType in interface com.google.protobuf.MessageOrBuilder
      Overrides:
      getDescriptorForType in class com.google.protobuf.GeneratedMessage.Builder<SatParameters.Builder>
    • getDefaultInstanceForType

      public SatParameters getDefaultInstanceForType()
      Specified by:
      getDefaultInstanceForType in interface com.google.protobuf.MessageLiteOrBuilder
      Specified by:
      getDefaultInstanceForType in interface com.google.protobuf.MessageOrBuilder
    • build

      public SatParameters build()
      Specified by:
      build in interface com.google.protobuf.Message.Builder
      Specified by:
      build in interface com.google.protobuf.MessageLite.Builder
    • buildPartial

      public SatParameters buildPartial()
      Specified by:
      buildPartial in interface com.google.protobuf.Message.Builder
      Specified by:
      buildPartial in interface com.google.protobuf.MessageLite.Builder
    • mergeFrom

      public SatParameters.Builder mergeFrom(com.google.protobuf.Message other)
      Specified by:
      mergeFrom in interface com.google.protobuf.Message.Builder
      Overrides:
      mergeFrom in class com.google.protobuf.AbstractMessage.Builder<SatParameters.Builder>
    • mergeFrom

      public SatParameters.Builder mergeFrom(SatParameters other)
    • isInitialized

      public final boolean isInitialized()
      Specified by:
      isInitialized in interface com.google.protobuf.MessageLiteOrBuilder
      Overrides:
      isInitialized in class com.google.protobuf.GeneratedMessage.Builder<SatParameters.Builder>
    • mergeFrom

      public SatParameters.Builder mergeFrom(com.google.protobuf.CodedInputStream input, com.google.protobuf.ExtensionRegistryLite extensionRegistry) throws IOException
      Specified by:
      mergeFrom in interface com.google.protobuf.Message.Builder
      Specified by:
      mergeFrom in interface com.google.protobuf.MessageLite.Builder
      Overrides:
      mergeFrom in class com.google.protobuf.AbstractMessage.Builder<SatParameters.Builder>
      Throws:
      IOException
    • hasName

      public boolean hasName()
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Specified by:
      hasName in interface SatParametersOrBuilder
      Returns:
      Whether the name field is set.
    • getName

      public String getName()
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Specified by:
      getName in interface SatParametersOrBuilder
      Returns:
      The name.
    • getNameBytes

      public com.google.protobuf.ByteString getNameBytes()
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Specified by:
      getNameBytes in interface SatParametersOrBuilder
      Returns:
      The bytes for name.
    • setName

      public SatParameters.Builder setName(String value)
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Parameters:
      value - The name to set.
      Returns:
      This builder for chaining.
    • clearName

      public SatParameters.Builder clearName()
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Returns:
      This builder for chaining.
    • setNameBytes

      public SatParameters.Builder setNameBytes(com.google.protobuf.ByteString value)
       In some context, like in a portfolio of search, it makes sense to name a
       given parameters set for logging purpose.
       
      optional string name = 171 [default = ""];
      Parameters:
      value - The bytes for name to set.
      Returns:
      This builder for chaining.
    • hasPreferredVariableOrder

      public boolean hasPreferredVariableOrder()
      optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default = IN_ORDER];
      Specified by:
      hasPreferredVariableOrder in interface SatParametersOrBuilder
      Returns:
      Whether the preferredVariableOrder field is set.
    • getPreferredVariableOrder

      public SatParameters.VariableOrder getPreferredVariableOrder()
      optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default = IN_ORDER];
      Specified by:
      getPreferredVariableOrder in interface SatParametersOrBuilder
      Returns:
      The preferredVariableOrder.
    • setPreferredVariableOrder

      public SatParameters.Builder setPreferredVariableOrder(SatParameters.VariableOrder value)
      optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default = IN_ORDER];
      Parameters:
      value - The preferredVariableOrder to set.
      Returns:
      This builder for chaining.
    • clearPreferredVariableOrder

      public SatParameters.Builder clearPreferredVariableOrder()
      optional .operations_research.sat.SatParameters.VariableOrder preferred_variable_order = 1 [default = IN_ORDER];
      Returns:
      This builder for chaining.
    • hasInitialPolarity

      public boolean hasInitialPolarity()
      optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FALSE];
      Specified by:
      hasInitialPolarity in interface SatParametersOrBuilder
      Returns:
      Whether the initialPolarity field is set.
    • getInitialPolarity

      public SatParameters.Polarity getInitialPolarity()
      optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FALSE];
      Specified by:
      getInitialPolarity in interface SatParametersOrBuilder
      Returns:
      The initialPolarity.
    • setInitialPolarity

      public SatParameters.Builder setInitialPolarity(SatParameters.Polarity value)
      optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FALSE];
      Parameters:
      value - The initialPolarity to set.
      Returns:
      This builder for chaining.
    • clearInitialPolarity

      public SatParameters.Builder clearInitialPolarity()
      optional .operations_research.sat.SatParameters.Polarity initial_polarity = 2 [default = POLARITY_FALSE];
      Returns:
      This builder for chaining.
    • hasUsePhaseSaving

      public boolean hasUsePhaseSaving()
       If this is true, then the polarity of a variable will be the last value it
       was assigned to, or its default polarity if it was never assigned since the
       call to ResetDecisionHeuristic().
      
       Actually, we use a newer version where we follow the last value in the
       longest non-conflicting partial assignment in the current phase.
      
       This is called 'literal phase saving'. For details see 'A Lightweight
       Component Caching Scheme for Satisfiability Solvers' K. Pipatsrisawat and
       A.Darwiche, In 10th International Conference on Theory and Applications of
       Satisfiability Testing, 2007.
       
      optional bool use_phase_saving = 44 [default = true];
      Specified by:
      hasUsePhaseSaving in interface SatParametersOrBuilder
      Returns:
      Whether the usePhaseSaving field is set.
    • getUsePhaseSaving

      public boolean getUsePhaseSaving()
       If this is true, then the polarity of a variable will be the last value it
       was assigned to, or its default polarity if it was never assigned since the
       call to ResetDecisionHeuristic().
      
       Actually, we use a newer version where we follow the last value in the
       longest non-conflicting partial assignment in the current phase.
      
       This is called 'literal phase saving'. For details see 'A Lightweight
       Component Caching Scheme for Satisfiability Solvers' K. Pipatsrisawat and
       A.Darwiche, In 10th International Conference on Theory and Applications of
       Satisfiability Testing, 2007.
       
      optional bool use_phase_saving = 44 [default = true];
      Specified by:
      getUsePhaseSaving in interface SatParametersOrBuilder
      Returns:
      The usePhaseSaving.
    • setUsePhaseSaving

      public SatParameters.Builder setUsePhaseSaving(boolean value)
       If this is true, then the polarity of a variable will be the last value it
       was assigned to, or its default polarity if it was never assigned since the
       call to ResetDecisionHeuristic().
      
       Actually, we use a newer version where we follow the last value in the
       longest non-conflicting partial assignment in the current phase.
      
       This is called 'literal phase saving'. For details see 'A Lightweight
       Component Caching Scheme for Satisfiability Solvers' K. Pipatsrisawat and
       A.Darwiche, In 10th International Conference on Theory and Applications of
       Satisfiability Testing, 2007.
       
      optional bool use_phase_saving = 44 [default = true];
      Parameters:
      value - The usePhaseSaving to set.
      Returns:
      This builder for chaining.
    • clearUsePhaseSaving

      public SatParameters.Builder clearUsePhaseSaving()
       If this is true, then the polarity of a variable will be the last value it
       was assigned to, or its default polarity if it was never assigned since the
       call to ResetDecisionHeuristic().
      
       Actually, we use a newer version where we follow the last value in the
       longest non-conflicting partial assignment in the current phase.
      
       This is called 'literal phase saving'. For details see 'A Lightweight
       Component Caching Scheme for Satisfiability Solvers' K. Pipatsrisawat and
       A.Darwiche, In 10th International Conference on Theory and Applications of
       Satisfiability Testing, 2007.
       
      optional bool use_phase_saving = 44 [default = true];
      Returns:
      This builder for chaining.
    • hasPolarityRephaseIncrement

      public boolean hasPolarityRephaseIncrement()
       If non-zero, then we change the polarity heuristic after that many number
       of conflicts in an arithmetically increasing fashion. So x the first time,
       2 * x the second time, etc...
       
      optional int32 polarity_rephase_increment = 168 [default = 1000];
      Specified by:
      hasPolarityRephaseIncrement in interface SatParametersOrBuilder
      Returns:
      Whether the polarityRephaseIncrement field is set.
    • getPolarityRephaseIncrement

      public int getPolarityRephaseIncrement()
       If non-zero, then we change the polarity heuristic after that many number
       of conflicts in an arithmetically increasing fashion. So x the first time,
       2 * x the second time, etc...
       
      optional int32 polarity_rephase_increment = 168 [default = 1000];
      Specified by:
      getPolarityRephaseIncrement in interface SatParametersOrBuilder
      Returns:
      The polarityRephaseIncrement.
    • setPolarityRephaseIncrement

      public SatParameters.Builder setPolarityRephaseIncrement(int value)
       If non-zero, then we change the polarity heuristic after that many number
       of conflicts in an arithmetically increasing fashion. So x the first time,
       2 * x the second time, etc...
       
      optional int32 polarity_rephase_increment = 168 [default = 1000];
      Parameters:
      value - The polarityRephaseIncrement to set.
      Returns:
      This builder for chaining.
    • clearPolarityRephaseIncrement

      public SatParameters.Builder clearPolarityRephaseIncrement()
       If non-zero, then we change the polarity heuristic after that many number
       of conflicts in an arithmetically increasing fashion. So x the first time,
       2 * x the second time, etc...
       
      optional int32 polarity_rephase_increment = 168 [default = 1000];
      Returns:
      This builder for chaining.
    • hasPolarityExploitLsHints

      public boolean hasPolarityExploitLsHints()
       If true and we have first solution LS workers, tries in some phase to
       follow a LS solutions that violates has litle constraints as possible.
       
      optional bool polarity_exploit_ls_hints = 309 [default = false];
      Specified by:
      hasPolarityExploitLsHints in interface SatParametersOrBuilder
      Returns:
      Whether the polarityExploitLsHints field is set.
    • getPolarityExploitLsHints

      public boolean getPolarityExploitLsHints()
       If true and we have first solution LS workers, tries in some phase to
       follow a LS solutions that violates has litle constraints as possible.
       
      optional bool polarity_exploit_ls_hints = 309 [default = false];
      Specified by:
      getPolarityExploitLsHints in interface SatParametersOrBuilder
      Returns:
      The polarityExploitLsHints.
    • setPolarityExploitLsHints

      public SatParameters.Builder setPolarityExploitLsHints(boolean value)
       If true and we have first solution LS workers, tries in some phase to
       follow a LS solutions that violates has litle constraints as possible.
       
      optional bool polarity_exploit_ls_hints = 309 [default = false];
      Parameters:
      value - The polarityExploitLsHints to set.
      Returns:
      This builder for chaining.
    • clearPolarityExploitLsHints

      public SatParameters.Builder clearPolarityExploitLsHints()
       If true and we have first solution LS workers, tries in some phase to
       follow a LS solutions that violates has litle constraints as possible.
       
      optional bool polarity_exploit_ls_hints = 309 [default = false];
      Returns:
      This builder for chaining.
    • hasRandomPolarityRatio

      public boolean hasRandomPolarityRatio()
       The proportion of polarity chosen at random. Note that this take
       precedence over the phase saving heuristic. This is different from
       initial_polarity:POLARITY_RANDOM because it will select a new random
       polarity each time the variable is branched upon instead of selecting one
       initially and then always taking this choice.
       
      optional double random_polarity_ratio = 45 [default = 0];
      Specified by:
      hasRandomPolarityRatio in interface SatParametersOrBuilder
      Returns:
      Whether the randomPolarityRatio field is set.
    • getRandomPolarityRatio

      public double getRandomPolarityRatio()
       The proportion of polarity chosen at random. Note that this take
       precedence over the phase saving heuristic. This is different from
       initial_polarity:POLARITY_RANDOM because it will select a new random
       polarity each time the variable is branched upon instead of selecting one
       initially and then always taking this choice.
       
      optional double random_polarity_ratio = 45 [default = 0];
      Specified by:
      getRandomPolarityRatio in interface SatParametersOrBuilder
      Returns:
      The randomPolarityRatio.
    • setRandomPolarityRatio

      public SatParameters.Builder setRandomPolarityRatio(double value)
       The proportion of polarity chosen at random. Note that this take
       precedence over the phase saving heuristic. This is different from
       initial_polarity:POLARITY_RANDOM because it will select a new random
       polarity each time the variable is branched upon instead of selecting one
       initially and then always taking this choice.
       
      optional double random_polarity_ratio = 45 [default = 0];
      Parameters:
      value - The randomPolarityRatio to set.
      Returns:
      This builder for chaining.
    • clearRandomPolarityRatio

      public SatParameters.Builder clearRandomPolarityRatio()
       The proportion of polarity chosen at random. Note that this take
       precedence over the phase saving heuristic. This is different from
       initial_polarity:POLARITY_RANDOM because it will select a new random
       polarity each time the variable is branched upon instead of selecting one
       initially and then always taking this choice.
       
      optional double random_polarity_ratio = 45 [default = 0];
      Returns:
      This builder for chaining.
    • hasRandomBranchesRatio

      public boolean hasRandomBranchesRatio()
       A number between 0 and 1 that indicates the proportion of branching
       variables that are selected randomly instead of choosing the first variable
       from the given variable_ordering strategy.
       
      optional double random_branches_ratio = 32 [default = 0];
      Specified by:
      hasRandomBranchesRatio in interface SatParametersOrBuilder
      Returns:
      Whether the randomBranchesRatio field is set.
    • getRandomBranchesRatio

      public double getRandomBranchesRatio()
       A number between 0 and 1 that indicates the proportion of branching
       variables that are selected randomly instead of choosing the first variable
       from the given variable_ordering strategy.
       
      optional double random_branches_ratio = 32 [default = 0];
      Specified by:
      getRandomBranchesRatio in interface SatParametersOrBuilder
      Returns:
      The randomBranchesRatio.
    • setRandomBranchesRatio

      public SatParameters.Builder setRandomBranchesRatio(double value)
       A number between 0 and 1 that indicates the proportion of branching
       variables that are selected randomly instead of choosing the first variable
       from the given variable_ordering strategy.
       
      optional double random_branches_ratio = 32 [default = 0];
      Parameters:
      value - The randomBranchesRatio to set.
      Returns:
      This builder for chaining.
    • clearRandomBranchesRatio

      public SatParameters.Builder clearRandomBranchesRatio()
       A number between 0 and 1 that indicates the proportion of branching
       variables that are selected randomly instead of choosing the first variable
       from the given variable_ordering strategy.
       
      optional double random_branches_ratio = 32 [default = 0];
      Returns:
      This builder for chaining.
    • hasUseErwaHeuristic

      public boolean hasUseErwaHeuristic()
       Whether we use the ERWA (Exponential Recency Weighted Average) heuristic as
       described in "Learning Rate Based Branching Heuristic for SAT solvers",
       J.H.Liang, V. Ganesh, P. Poupart, K.Czarnecki, SAT 2016.
       
      optional bool use_erwa_heuristic = 75 [default = false];
      Specified by:
      hasUseErwaHeuristic in interface SatParametersOrBuilder
      Returns:
      Whether the useErwaHeuristic field is set.
    • getUseErwaHeuristic

      public boolean getUseErwaHeuristic()
       Whether we use the ERWA (Exponential Recency Weighted Average) heuristic as
       described in "Learning Rate Based Branching Heuristic for SAT solvers",
       J.H.Liang, V. Ganesh, P. Poupart, K.Czarnecki, SAT 2016.
       
      optional bool use_erwa_heuristic = 75 [default = false];
      Specified by:
      getUseErwaHeuristic in interface SatParametersOrBuilder
      Returns:
      The useErwaHeuristic.
    • setUseErwaHeuristic

      public SatParameters.Builder setUseErwaHeuristic(boolean value)
       Whether we use the ERWA (Exponential Recency Weighted Average) heuristic as
       described in "Learning Rate Based Branching Heuristic for SAT solvers",
       J.H.Liang, V. Ganesh, P. Poupart, K.Czarnecki, SAT 2016.
       
      optional bool use_erwa_heuristic = 75 [default = false];
      Parameters:
      value - The useErwaHeuristic to set.
      Returns:
      This builder for chaining.
    • clearUseErwaHeuristic

      public SatParameters.Builder clearUseErwaHeuristic()
       Whether we use the ERWA (Exponential Recency Weighted Average) heuristic as
       described in "Learning Rate Based Branching Heuristic for SAT solvers",
       J.H.Liang, V. Ganesh, P. Poupart, K.Czarnecki, SAT 2016.
       
      optional bool use_erwa_heuristic = 75 [default = false];
      Returns:
      This builder for chaining.
    • hasInitialVariablesActivity

      public boolean hasInitialVariablesActivity()
       The initial value of the variables activity. A non-zero value only make
       sense when use_erwa_heuristic is true. Experiments with a value of 1e-2
       together with the ERWA heuristic showed slighthly better result than simply
       using zero. The idea is that when the "learning rate" of a variable becomes
       lower than this value, then we prefer to branch on never explored before
       variables. This is not in the ERWA paper.
       
      optional double initial_variables_activity = 76 [default = 0];
      Specified by:
      hasInitialVariablesActivity in interface SatParametersOrBuilder
      Returns:
      Whether the initialVariablesActivity field is set.
    • getInitialVariablesActivity

      public double getInitialVariablesActivity()
       The initial value of the variables activity. A non-zero value only make
       sense when use_erwa_heuristic is true. Experiments with a value of 1e-2
       together with the ERWA heuristic showed slighthly better result than simply
       using zero. The idea is that when the "learning rate" of a variable becomes
       lower than this value, then we prefer to branch on never explored before
       variables. This is not in the ERWA paper.
       
      optional double initial_variables_activity = 76 [default = 0];
      Specified by:
      getInitialVariablesActivity in interface SatParametersOrBuilder
      Returns:
      The initialVariablesActivity.
    • setInitialVariablesActivity

      public SatParameters.Builder setInitialVariablesActivity(double value)
       The initial value of the variables activity. A non-zero value only make
       sense when use_erwa_heuristic is true. Experiments with a value of 1e-2
       together with the ERWA heuristic showed slighthly better result than simply
       using zero. The idea is that when the "learning rate" of a variable becomes
       lower than this value, then we prefer to branch on never explored before
       variables. This is not in the ERWA paper.
       
      optional double initial_variables_activity = 76 [default = 0];
      Parameters:
      value - The initialVariablesActivity to set.
      Returns:
      This builder for chaining.
    • clearInitialVariablesActivity

      public SatParameters.Builder clearInitialVariablesActivity()
       The initial value of the variables activity. A non-zero value only make
       sense when use_erwa_heuristic is true. Experiments with a value of 1e-2
       together with the ERWA heuristic showed slighthly better result than simply
       using zero. The idea is that when the "learning rate" of a variable becomes
       lower than this value, then we prefer to branch on never explored before
       variables. This is not in the ERWA paper.
       
      optional double initial_variables_activity = 76 [default = 0];
      Returns:
      This builder for chaining.
    • hasAlsoBumpVariablesInConflictReasons

      public boolean hasAlsoBumpVariablesInConflictReasons()
       When this is true, then the variables that appear in any of the reason of
       the variables in a conflict have their activity bumped. This is addition to
       the variables in the conflict, and the one that were used during conflict
       resolution.
       
      optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
      Specified by:
      hasAlsoBumpVariablesInConflictReasons in interface SatParametersOrBuilder
      Returns:
      Whether the alsoBumpVariablesInConflictReasons field is set.
    • getAlsoBumpVariablesInConflictReasons

      public boolean getAlsoBumpVariablesInConflictReasons()
       When this is true, then the variables that appear in any of the reason of
       the variables in a conflict have their activity bumped. This is addition to
       the variables in the conflict, and the one that were used during conflict
       resolution.
       
      optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
      Specified by:
      getAlsoBumpVariablesInConflictReasons in interface SatParametersOrBuilder
      Returns:
      The alsoBumpVariablesInConflictReasons.
    • setAlsoBumpVariablesInConflictReasons

      public SatParameters.Builder setAlsoBumpVariablesInConflictReasons(boolean value)
       When this is true, then the variables that appear in any of the reason of
       the variables in a conflict have their activity bumped. This is addition to
       the variables in the conflict, and the one that were used during conflict
       resolution.
       
      optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
      Parameters:
      value - The alsoBumpVariablesInConflictReasons to set.
      Returns:
      This builder for chaining.
    • clearAlsoBumpVariablesInConflictReasons

      public SatParameters.Builder clearAlsoBumpVariablesInConflictReasons()
       When this is true, then the variables that appear in any of the reason of
       the variables in a conflict have their activity bumped. This is addition to
       the variables in the conflict, and the one that were used during conflict
       resolution.
       
      optional bool also_bump_variables_in_conflict_reasons = 77 [default = false];
      Returns:
      This builder for chaining.
    • hasMinimizationAlgorithm

      public boolean hasMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm = 4 [default = RECURSIVE];
      Specified by:
      hasMinimizationAlgorithm in interface SatParametersOrBuilder
      Returns:
      Whether the minimizationAlgorithm field is set.
    • getMinimizationAlgorithm

      public SatParameters.ConflictMinimizationAlgorithm getMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm = 4 [default = RECURSIVE];
      Specified by:
      getMinimizationAlgorithm in interface SatParametersOrBuilder
      Returns:
      The minimizationAlgorithm.
    • setMinimizationAlgorithm

      public SatParameters.Builder setMinimizationAlgorithm(SatParameters.ConflictMinimizationAlgorithm value)
      optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm = 4 [default = RECURSIVE];
      Parameters:
      value - The minimizationAlgorithm to set.
      Returns:
      This builder for chaining.
    • clearMinimizationAlgorithm

      public SatParameters.Builder clearMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.ConflictMinimizationAlgorithm minimization_algorithm = 4 [default = RECURSIVE];
      Returns:
      This builder for chaining.
    • hasBinaryMinimizationAlgorithm

      public boolean hasBinaryMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorithm = 34 [default = BINARY_MINIMIZATION_FIRST];
      Specified by:
      hasBinaryMinimizationAlgorithm in interface SatParametersOrBuilder
      Returns:
      Whether the binaryMinimizationAlgorithm field is set.
    • getBinaryMinimizationAlgorithm

      public SatParameters.BinaryMinizationAlgorithm getBinaryMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorithm = 34 [default = BINARY_MINIMIZATION_FIRST];
      Specified by:
      getBinaryMinimizationAlgorithm in interface SatParametersOrBuilder
      Returns:
      The binaryMinimizationAlgorithm.
    • setBinaryMinimizationAlgorithm

      public SatParameters.Builder setBinaryMinimizationAlgorithm(SatParameters.BinaryMinizationAlgorithm value)
      optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorithm = 34 [default = BINARY_MINIMIZATION_FIRST];
      Parameters:
      value - The binaryMinimizationAlgorithm to set.
      Returns:
      This builder for chaining.
    • clearBinaryMinimizationAlgorithm

      public SatParameters.Builder clearBinaryMinimizationAlgorithm()
      optional .operations_research.sat.SatParameters.BinaryMinizationAlgorithm binary_minimization_algorithm = 34 [default = BINARY_MINIMIZATION_FIRST];
      Returns:
      This builder for chaining.
    • hasSubsumptionDuringConflictAnalysis

      public boolean hasSubsumptionDuringConflictAnalysis()
       At a really low cost, during the 1-UIP conflict computation, it is easy to
       detect if some of the involved reasons are subsumed by the current
       conflict. When this is true, such clauses are detached and later removed
       from the problem.
       
      optional bool subsumption_during_conflict_analysis = 56 [default = true];
      Specified by:
      hasSubsumptionDuringConflictAnalysis in interface SatParametersOrBuilder
      Returns:
      Whether the subsumptionDuringConflictAnalysis field is set.
    • getSubsumptionDuringConflictAnalysis

      public boolean getSubsumptionDuringConflictAnalysis()
       At a really low cost, during the 1-UIP conflict computation, it is easy to
       detect if some of the involved reasons are subsumed by the current
       conflict. When this is true, such clauses are detached and later removed
       from the problem.
       
      optional bool subsumption_during_conflict_analysis = 56 [default = true];
      Specified by:
      getSubsumptionDuringConflictAnalysis in interface SatParametersOrBuilder
      Returns:
      The subsumptionDuringConflictAnalysis.
    • setSubsumptionDuringConflictAnalysis

      public SatParameters.Builder setSubsumptionDuringConflictAnalysis(boolean value)
       At a really low cost, during the 1-UIP conflict computation, it is easy to
       detect if some of the involved reasons are subsumed by the current
       conflict. When this is true, such clauses are detached and later removed
       from the problem.
       
      optional bool subsumption_during_conflict_analysis = 56 [default = true];
      Parameters:
      value - The subsumptionDuringConflictAnalysis to set.
      Returns:
      This builder for chaining.
    • clearSubsumptionDuringConflictAnalysis

      public SatParameters.Builder clearSubsumptionDuringConflictAnalysis()
       At a really low cost, during the 1-UIP conflict computation, it is easy to
       detect if some of the involved reasons are subsumed by the current
       conflict. When this is true, such clauses are detached and later removed
       from the problem.
       
      optional bool subsumption_during_conflict_analysis = 56 [default = true];
      Returns:
      This builder for chaining.
    • hasClauseCleanupPeriod

      public boolean hasClauseCleanupPeriod()
       Trigger a cleanup when this number of "deletable" clauses is learned.
       
      optional int32 clause_cleanup_period = 11 [default = 10000];
      Specified by:
      hasClauseCleanupPeriod in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupPeriod field is set.
    • getClauseCleanupPeriod

      public int getClauseCleanupPeriod()
       Trigger a cleanup when this number of "deletable" clauses is learned.
       
      optional int32 clause_cleanup_period = 11 [default = 10000];
      Specified by:
      getClauseCleanupPeriod in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupPeriod.
    • setClauseCleanupPeriod

      public SatParameters.Builder setClauseCleanupPeriod(int value)
       Trigger a cleanup when this number of "deletable" clauses is learned.
       
      optional int32 clause_cleanup_period = 11 [default = 10000];
      Parameters:
      value - The clauseCleanupPeriod to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupPeriod

      public SatParameters.Builder clearClauseCleanupPeriod()
       Trigger a cleanup when this number of "deletable" clauses is learned.
       
      optional int32 clause_cleanup_period = 11 [default = 10000];
      Returns:
      This builder for chaining.
    • hasClauseCleanupTarget

      public boolean hasClauseCleanupTarget()
       During a cleanup, we will always keep that number of "deletable" clauses.
       Note that this doesn't include the "protected" clauses.
       
      optional int32 clause_cleanup_target = 13 [default = 0];
      Specified by:
      hasClauseCleanupTarget in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupTarget field is set.
    • getClauseCleanupTarget

      public int getClauseCleanupTarget()
       During a cleanup, we will always keep that number of "deletable" clauses.
       Note that this doesn't include the "protected" clauses.
       
      optional int32 clause_cleanup_target = 13 [default = 0];
      Specified by:
      getClauseCleanupTarget in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupTarget.
    • setClauseCleanupTarget

      public SatParameters.Builder setClauseCleanupTarget(int value)
       During a cleanup, we will always keep that number of "deletable" clauses.
       Note that this doesn't include the "protected" clauses.
       
      optional int32 clause_cleanup_target = 13 [default = 0];
      Parameters:
      value - The clauseCleanupTarget to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupTarget

      public SatParameters.Builder clearClauseCleanupTarget()
       During a cleanup, we will always keep that number of "deletable" clauses.
       Note that this doesn't include the "protected" clauses.
       
      optional int32 clause_cleanup_target = 13 [default = 0];
      Returns:
      This builder for chaining.
    • hasClauseCleanupRatio

      public boolean hasClauseCleanupRatio()
       During a cleanup, if clause_cleanup_target is 0, we will delete the
       clause_cleanup_ratio of "deletable" clauses instead of aiming for a fixed
       target of clauses to keep.
       
      optional double clause_cleanup_ratio = 190 [default = 0.5];
      Specified by:
      hasClauseCleanupRatio in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupRatio field is set.
    • getClauseCleanupRatio

      public double getClauseCleanupRatio()
       During a cleanup, if clause_cleanup_target is 0, we will delete the
       clause_cleanup_ratio of "deletable" clauses instead of aiming for a fixed
       target of clauses to keep.
       
      optional double clause_cleanup_ratio = 190 [default = 0.5];
      Specified by:
      getClauseCleanupRatio in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupRatio.
    • setClauseCleanupRatio

      public SatParameters.Builder setClauseCleanupRatio(double value)
       During a cleanup, if clause_cleanup_target is 0, we will delete the
       clause_cleanup_ratio of "deletable" clauses instead of aiming for a fixed
       target of clauses to keep.
       
      optional double clause_cleanup_ratio = 190 [default = 0.5];
      Parameters:
      value - The clauseCleanupRatio to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupRatio

      public SatParameters.Builder clearClauseCleanupRatio()
       During a cleanup, if clause_cleanup_target is 0, we will delete the
       clause_cleanup_ratio of "deletable" clauses instead of aiming for a fixed
       target of clauses to keep.
       
      optional double clause_cleanup_ratio = 190 [default = 0.5];
      Returns:
      This builder for chaining.
    • hasClauseCleanupProtection

      public boolean hasClauseCleanupProtection()
      optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [default = PROTECTION_NONE];
      Specified by:
      hasClauseCleanupProtection in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupProtection field is set.
    • getClauseCleanupProtection

      public SatParameters.ClauseProtection getClauseCleanupProtection()
      optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [default = PROTECTION_NONE];
      Specified by:
      getClauseCleanupProtection in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupProtection.
    • setClauseCleanupProtection

      public SatParameters.Builder setClauseCleanupProtection(SatParameters.ClauseProtection value)
      optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [default = PROTECTION_NONE];
      Parameters:
      value - The clauseCleanupProtection to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupProtection

      public SatParameters.Builder clearClauseCleanupProtection()
      optional .operations_research.sat.SatParameters.ClauseProtection clause_cleanup_protection = 58 [default = PROTECTION_NONE];
      Returns:
      This builder for chaining.
    • hasClauseCleanupLbdBound

      public boolean hasClauseCleanupLbdBound()
       All the clauses with a LBD (literal blocks distance) lower or equal to this
       parameters will always be kept.
       
      optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
      Specified by:
      hasClauseCleanupLbdBound in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupLbdBound field is set.
    • getClauseCleanupLbdBound

      public int getClauseCleanupLbdBound()
       All the clauses with a LBD (literal blocks distance) lower or equal to this
       parameters will always be kept.
       
      optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
      Specified by:
      getClauseCleanupLbdBound in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupLbdBound.
    • setClauseCleanupLbdBound

      public SatParameters.Builder setClauseCleanupLbdBound(int value)
       All the clauses with a LBD (literal blocks distance) lower or equal to this
       parameters will always be kept.
       
      optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
      Parameters:
      value - The clauseCleanupLbdBound to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupLbdBound

      public SatParameters.Builder clearClauseCleanupLbdBound()
       All the clauses with a LBD (literal blocks distance) lower or equal to this
       parameters will always be kept.
       
      optional int32 clause_cleanup_lbd_bound = 59 [default = 5];
      Returns:
      This builder for chaining.
    • hasClauseCleanupOrdering

      public boolean hasClauseCleanupOrdering()
      optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default = CLAUSE_ACTIVITY];
      Specified by:
      hasClauseCleanupOrdering in interface SatParametersOrBuilder
      Returns:
      Whether the clauseCleanupOrdering field is set.
    • getClauseCleanupOrdering

      public SatParameters.ClauseOrdering getClauseCleanupOrdering()
      optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default = CLAUSE_ACTIVITY];
      Specified by:
      getClauseCleanupOrdering in interface SatParametersOrBuilder
      Returns:
      The clauseCleanupOrdering.
    • setClauseCleanupOrdering

      public SatParameters.Builder setClauseCleanupOrdering(SatParameters.ClauseOrdering value)
      optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default = CLAUSE_ACTIVITY];
      Parameters:
      value - The clauseCleanupOrdering to set.
      Returns:
      This builder for chaining.
    • clearClauseCleanupOrdering

      public SatParameters.Builder clearClauseCleanupOrdering()
      optional .operations_research.sat.SatParameters.ClauseOrdering clause_cleanup_ordering = 60 [default = CLAUSE_ACTIVITY];
      Returns:
      This builder for chaining.
    • hasPbCleanupIncrement

      public boolean hasPbCleanupIncrement()
       Same as for the clauses, but for the learned pseudo-Boolean constraints.
       
      optional int32 pb_cleanup_increment = 46 [default = 200];
      Specified by:
      hasPbCleanupIncrement in interface SatParametersOrBuilder
      Returns:
      Whether the pbCleanupIncrement field is set.
    • getPbCleanupIncrement

      public int getPbCleanupIncrement()
       Same as for the clauses, but for the learned pseudo-Boolean constraints.
       
      optional int32 pb_cleanup_increment = 46 [default = 200];
      Specified by:
      getPbCleanupIncrement in interface SatParametersOrBuilder
      Returns:
      The pbCleanupIncrement.
    • setPbCleanupIncrement

      public SatParameters.Builder setPbCleanupIncrement(int value)
       Same as for the clauses, but for the learned pseudo-Boolean constraints.
       
      optional int32 pb_cleanup_increment = 46 [default = 200];
      Parameters:
      value - The pbCleanupIncrement to set.
      Returns:
      This builder for chaining.
    • clearPbCleanupIncrement

      public SatParameters.Builder clearPbCleanupIncrement()
       Same as for the clauses, but for the learned pseudo-Boolean constraints.
       
      optional int32 pb_cleanup_increment = 46 [default = 200];
      Returns:
      This builder for chaining.
    • hasPbCleanupRatio

      public boolean hasPbCleanupRatio()
      optional double pb_cleanup_ratio = 47 [default = 0.5];
      Specified by:
      hasPbCleanupRatio in interface SatParametersOrBuilder
      Returns:
      Whether the pbCleanupRatio field is set.
    • getPbCleanupRatio

      public double getPbCleanupRatio()
      optional double pb_cleanup_ratio = 47 [default = 0.5];
      Specified by:
      getPbCleanupRatio in interface SatParametersOrBuilder
      Returns:
      The pbCleanupRatio.
    • setPbCleanupRatio

      public SatParameters.Builder setPbCleanupRatio(double value)
      optional double pb_cleanup_ratio = 47 [default = 0.5];
      Parameters:
      value - The pbCleanupRatio to set.
      Returns:
      This builder for chaining.
    • clearPbCleanupRatio

      public SatParameters.Builder clearPbCleanupRatio()
      optional double pb_cleanup_ratio = 47 [default = 0.5];
      Returns:
      This builder for chaining.
    • hasVariableActivityDecay

      public boolean hasVariableActivityDecay()
       Each time a conflict is found, the activities of some variables are
       increased by one. Then, the activity of all variables are multiplied by
       variable_activity_decay.
      
       To implement this efficiently, the activity of all the variables is not
       decayed at each conflict. Instead, the activity increment is multiplied by
       1 / decay. When an activity reach max_variable_activity_value, all the
       activity are multiplied by 1 / max_variable_activity_value.
       
      optional double variable_activity_decay = 15 [default = 0.8];
      Specified by:
      hasVariableActivityDecay in interface SatParametersOrBuilder
      Returns:
      Whether the variableActivityDecay field is set.
    • getVariableActivityDecay

      public double getVariableActivityDecay()
       Each time a conflict is found, the activities of some variables are
       increased by one. Then, the activity of all variables are multiplied by
       variable_activity_decay.
      
       To implement this efficiently, the activity of all the variables is not
       decayed at each conflict. Instead, the activity increment is multiplied by
       1 / decay. When an activity reach max_variable_activity_value, all the
       activity are multiplied by 1 / max_variable_activity_value.
       
      optional double variable_activity_decay = 15 [default = 0.8];
      Specified by:
      getVariableActivityDecay in interface SatParametersOrBuilder
      Returns:
      The variableActivityDecay.
    • setVariableActivityDecay

      public SatParameters.Builder setVariableActivityDecay(double value)
       Each time a conflict is found, the activities of some variables are
       increased by one. Then, the activity of all variables are multiplied by
       variable_activity_decay.
      
       To implement this efficiently, the activity of all the variables is not
       decayed at each conflict. Instead, the activity increment is multiplied by
       1 / decay. When an activity reach max_variable_activity_value, all the
       activity are multiplied by 1 / max_variable_activity_value.
       
      optional double variable_activity_decay = 15 [default = 0.8];
      Parameters:
      value - The variableActivityDecay to set.
      Returns:
      This builder for chaining.
    • clearVariableActivityDecay

      public SatParameters.Builder clearVariableActivityDecay()
       Each time a conflict is found, the activities of some variables are
       increased by one. Then, the activity of all variables are multiplied by
       variable_activity_decay.
      
       To implement this efficiently, the activity of all the variables is not
       decayed at each conflict. Instead, the activity increment is multiplied by
       1 / decay. When an activity reach max_variable_activity_value, all the
       activity are multiplied by 1 / max_variable_activity_value.
       
      optional double variable_activity_decay = 15 [default = 0.8];
      Returns:
      This builder for chaining.
    • hasMaxVariableActivityValue

      public boolean hasMaxVariableActivityValue()
      optional double max_variable_activity_value = 16 [default = 1e+100];
      Specified by:
      hasMaxVariableActivityValue in interface SatParametersOrBuilder
      Returns:
      Whether the maxVariableActivityValue field is set.
    • getMaxVariableActivityValue

      public double getMaxVariableActivityValue()
      optional double max_variable_activity_value = 16 [default = 1e+100];
      Specified by:
      getMaxVariableActivityValue in interface SatParametersOrBuilder
      Returns:
      The maxVariableActivityValue.
    • setMaxVariableActivityValue

      public SatParameters.Builder setMaxVariableActivityValue(double value)
      optional double max_variable_activity_value = 16 [default = 1e+100];
      Parameters:
      value - The maxVariableActivityValue to set.
      Returns:
      This builder for chaining.
    • clearMaxVariableActivityValue

      public SatParameters.Builder clearMaxVariableActivityValue()
      optional double max_variable_activity_value = 16 [default = 1e+100];
      Returns:
      This builder for chaining.
    • hasGlucoseMaxDecay

      public boolean hasGlucoseMaxDecay()
       The activity starts at 0.8 and increment by 0.01 every 5000 conflicts until
       0.95. This "hack" seems to work well and comes from:
      
       Glucose 2.3 in the SAT 2013 Competition - SAT Competition 2013
       http://edacc4.informatik.uni-ulm.de/SC13/solver-description-download/136
       
      optional double glucose_max_decay = 22 [default = 0.95];
      Specified by:
      hasGlucoseMaxDecay in interface SatParametersOrBuilder
      Returns:
      Whether the glucoseMaxDecay field is set.
    • getGlucoseMaxDecay

      public double getGlucoseMaxDecay()
       The activity starts at 0.8 and increment by 0.01 every 5000 conflicts until
       0.95. This "hack" seems to work well and comes from:
      
       Glucose 2.3 in the SAT 2013 Competition - SAT Competition 2013
       http://edacc4.informatik.uni-ulm.de/SC13/solver-description-download/136
       
      optional double glucose_max_decay = 22 [default = 0.95];
      Specified by:
      getGlucoseMaxDecay in interface SatParametersOrBuilder
      Returns:
      The glucoseMaxDecay.
    • setGlucoseMaxDecay

      public SatParameters.Builder setGlucoseMaxDecay(double value)
       The activity starts at 0.8 and increment by 0.01 every 5000 conflicts until
       0.95. This "hack" seems to work well and comes from:
      
       Glucose 2.3 in the SAT 2013 Competition - SAT Competition 2013
       http://edacc4.informatik.uni-ulm.de/SC13/solver-description-download/136
       
      optional double glucose_max_decay = 22 [default = 0.95];
      Parameters:
      value - The glucoseMaxDecay to set.
      Returns:
      This builder for chaining.
    • clearGlucoseMaxDecay

      public SatParameters.Builder clearGlucoseMaxDecay()
       The activity starts at 0.8 and increment by 0.01 every 5000 conflicts until
       0.95. This "hack" seems to work well and comes from:
      
       Glucose 2.3 in the SAT 2013 Competition - SAT Competition 2013
       http://edacc4.informatik.uni-ulm.de/SC13/solver-description-download/136
       
      optional double glucose_max_decay = 22 [default = 0.95];
      Returns:
      This builder for chaining.
    • hasGlucoseDecayIncrement

      public boolean hasGlucoseDecayIncrement()
      optional double glucose_decay_increment = 23 [default = 0.01];
      Specified by:
      hasGlucoseDecayIncrement in interface SatParametersOrBuilder
      Returns:
      Whether the glucoseDecayIncrement field is set.
    • getGlucoseDecayIncrement

      public double getGlucoseDecayIncrement()
      optional double glucose_decay_increment = 23 [default = 0.01];
      Specified by:
      getGlucoseDecayIncrement in interface SatParametersOrBuilder
      Returns:
      The glucoseDecayIncrement.
    • setGlucoseDecayIncrement

      public SatParameters.Builder setGlucoseDecayIncrement(double value)
      optional double glucose_decay_increment = 23 [default = 0.01];
      Parameters:
      value - The glucoseDecayIncrement to set.
      Returns:
      This builder for chaining.
    • clearGlucoseDecayIncrement

      public SatParameters.Builder clearGlucoseDecayIncrement()
      optional double glucose_decay_increment = 23 [default = 0.01];
      Returns:
      This builder for chaining.
    • hasGlucoseDecayIncrementPeriod

      public boolean hasGlucoseDecayIncrementPeriod()
      optional int32 glucose_decay_increment_period = 24 [default = 5000];
      Specified by:
      hasGlucoseDecayIncrementPeriod in interface SatParametersOrBuilder
      Returns:
      Whether the glucoseDecayIncrementPeriod field is set.
    • getGlucoseDecayIncrementPeriod

      public int getGlucoseDecayIncrementPeriod()
      optional int32 glucose_decay_increment_period = 24 [default = 5000];
      Specified by:
      getGlucoseDecayIncrementPeriod in interface SatParametersOrBuilder
      Returns:
      The glucoseDecayIncrementPeriod.
    • setGlucoseDecayIncrementPeriod

      public SatParameters.Builder setGlucoseDecayIncrementPeriod(int value)
      optional int32 glucose_decay_increment_period = 24 [default = 5000];
      Parameters:
      value - The glucoseDecayIncrementPeriod to set.
      Returns:
      This builder for chaining.
    • clearGlucoseDecayIncrementPeriod

      public SatParameters.Builder clearGlucoseDecayIncrementPeriod()
      optional int32 glucose_decay_increment_period = 24 [default = 5000];
      Returns:
      This builder for chaining.
    • hasClauseActivityDecay

      public boolean hasClauseActivityDecay()
       Clause activity parameters (same effect as the one on the variables).
       
      optional double clause_activity_decay = 17 [default = 0.999];
      Specified by:
      hasClauseActivityDecay in interface SatParametersOrBuilder
      Returns:
      Whether the clauseActivityDecay field is set.
    • getClauseActivityDecay

      public double getClauseActivityDecay()
       Clause activity parameters (same effect as the one on the variables).
       
      optional double clause_activity_decay = 17 [default = 0.999];
      Specified by:
      getClauseActivityDecay in interface SatParametersOrBuilder
      Returns:
      The clauseActivityDecay.
    • setClauseActivityDecay

      public SatParameters.Builder setClauseActivityDecay(double value)
       Clause activity parameters (same effect as the one on the variables).
       
      optional double clause_activity_decay = 17 [default = 0.999];
      Parameters:
      value - The clauseActivityDecay to set.
      Returns:
      This builder for chaining.
    • clearClauseActivityDecay

      public SatParameters.Builder clearClauseActivityDecay()
       Clause activity parameters (same effect as the one on the variables).
       
      optional double clause_activity_decay = 17 [default = 0.999];
      Returns:
      This builder for chaining.
    • hasMaxClauseActivityValue

      public boolean hasMaxClauseActivityValue()
      optional double max_clause_activity_value = 18 [default = 1e+20];
      Specified by:
      hasMaxClauseActivityValue in interface SatParametersOrBuilder
      Returns:
      Whether the maxClauseActivityValue field is set.
    • getMaxClauseActivityValue

      public double getMaxClauseActivityValue()
      optional double max_clause_activity_value = 18 [default = 1e+20];
      Specified by:
      getMaxClauseActivityValue in interface SatParametersOrBuilder
      Returns:
      The maxClauseActivityValue.
    • setMaxClauseActivityValue

      public SatParameters.Builder setMaxClauseActivityValue(double value)
      optional double max_clause_activity_value = 18 [default = 1e+20];
      Parameters:
      value - The maxClauseActivityValue to set.
      Returns:
      This builder for chaining.
    • clearMaxClauseActivityValue

      public SatParameters.Builder clearMaxClauseActivityValue()
      optional double max_clause_activity_value = 18 [default = 1e+20];
      Returns:
      This builder for chaining.
    • getRestartAlgorithmsList

      public List<SatParameters.RestartAlgorithm> getRestartAlgorithmsList()
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Specified by:
      getRestartAlgorithmsList in interface SatParametersOrBuilder
      Returns:
      A list containing the restartAlgorithms.
    • getRestartAlgorithmsCount

      public int getRestartAlgorithmsCount()
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Specified by:
      getRestartAlgorithmsCount in interface SatParametersOrBuilder
      Returns:
      The count of restartAlgorithms.
    • getRestartAlgorithms

      public SatParameters.RestartAlgorithm getRestartAlgorithms(int index)
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Specified by:
      getRestartAlgorithms in interface SatParametersOrBuilder
      Parameters:
      index - The index of the element to return.
      Returns:
      The restartAlgorithms at the given index.
    • setRestartAlgorithms

      public SatParameters.Builder setRestartAlgorithms(int index, SatParameters.RestartAlgorithm value)
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Parameters:
      index - The index to set the value at.
      value - The restartAlgorithms to set.
      Returns:
      This builder for chaining.
    • addRestartAlgorithms

      public SatParameters.Builder addRestartAlgorithms(SatParameters.RestartAlgorithm value)
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Parameters:
      value - The restartAlgorithms to add.
      Returns:
      This builder for chaining.
    • addAllRestartAlgorithms

      public SatParameters.Builder addAllRestartAlgorithms(Iterable<? extends SatParameters.RestartAlgorithm> values)
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Parameters:
      values - The restartAlgorithms to add.
      Returns:
      This builder for chaining.
    • clearRestartAlgorithms

      public SatParameters.Builder clearRestartAlgorithms()
       The restart strategies will change each time the strategy_counter is
       increased. The current strategy will simply be the one at index
       strategy_counter modulo the number of strategy. Note that if this list
       includes a NO_RESTART, nothing will change when it is reached because the
       strategy_counter will only increment after a restart.
      
       The idea of switching of search strategy tailored for SAT/UNSAT comes from
       Chanseok Oh with his COMiniSatPS solver, see http://cs.nyu.edu/~chanseok/.
       But more generally, it seems REALLY beneficial to try different strategy.
       
      repeated .operations_research.sat.SatParameters.RestartAlgorithm restart_algorithms = 61;
      Returns:
      This builder for chaining.
    • hasDefaultRestartAlgorithms

      public boolean hasDefaultRestartAlgorithms()
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Specified by:
      hasDefaultRestartAlgorithms in interface SatParametersOrBuilder
      Returns:
      Whether the defaultRestartAlgorithms field is set.
    • getDefaultRestartAlgorithms

      public String getDefaultRestartAlgorithms()
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Specified by:
      getDefaultRestartAlgorithms in interface SatParametersOrBuilder
      Returns:
      The defaultRestartAlgorithms.
    • getDefaultRestartAlgorithmsBytes

      public com.google.protobuf.ByteString getDefaultRestartAlgorithmsBytes()
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Specified by:
      getDefaultRestartAlgorithmsBytes in interface SatParametersOrBuilder
      Returns:
      The bytes for defaultRestartAlgorithms.
    • setDefaultRestartAlgorithms

      public SatParameters.Builder setDefaultRestartAlgorithms(String value)
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Parameters:
      value - The defaultRestartAlgorithms to set.
      Returns:
      This builder for chaining.
    • clearDefaultRestartAlgorithms

      public SatParameters.Builder clearDefaultRestartAlgorithms()
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Returns:
      This builder for chaining.
    • setDefaultRestartAlgorithmsBytes

      public SatParameters.Builder setDefaultRestartAlgorithmsBytes(com.google.protobuf.ByteString value)
      optional string default_restart_algorithms = 70 [default = "LUBY_RESTART,LBD_MOVING_AVERAGE_RESTART,DL_MOVING_AVERAGE_RESTART"];
      Parameters:
      value - The bytes for defaultRestartAlgorithms to set.
      Returns:
      This builder for chaining.
    • hasRestartPeriod

      public boolean hasRestartPeriod()
       Restart period for the FIXED_RESTART strategy. This is also the multiplier
       used by the LUBY_RESTART strategy.
       
      optional int32 restart_period = 30 [default = 50];
      Specified by:
      hasRestartPeriod in interface SatParametersOrBuilder
      Returns:
      Whether the restartPeriod field is set.
    • getRestartPeriod

      public int getRestartPeriod()
       Restart period for the FIXED_RESTART strategy. This is also the multiplier
       used by the LUBY_RESTART strategy.
       
      optional int32 restart_period = 30 [default = 50];
      Specified by:
      getRestartPeriod in interface SatParametersOrBuilder
      Returns:
      The restartPeriod.
    • setRestartPeriod

      public SatParameters.Builder setRestartPeriod(int value)
       Restart period for the FIXED_RESTART strategy. This is also the multiplier
       used by the LUBY_RESTART strategy.
       
      optional int32 restart_period = 30 [default = 50];
      Parameters:
      value - The restartPeriod to set.
      Returns:
      This builder for chaining.
    • clearRestartPeriod

      public SatParameters.Builder clearRestartPeriod()
       Restart period for the FIXED_RESTART strategy. This is also the multiplier
       used by the LUBY_RESTART strategy.
       
      optional int32 restart_period = 30 [default = 50];
      Returns:
      This builder for chaining.
    • hasRestartRunningWindowSize

      public boolean hasRestartRunningWindowSize()
       Size of the window for the moving average restarts.
       
      optional int32 restart_running_window_size = 62 [default = 50];
      Specified by:
      hasRestartRunningWindowSize in interface SatParametersOrBuilder
      Returns:
      Whether the restartRunningWindowSize field is set.
    • getRestartRunningWindowSize

      public int getRestartRunningWindowSize()
       Size of the window for the moving average restarts.
       
      optional int32 restart_running_window_size = 62 [default = 50];
      Specified by:
      getRestartRunningWindowSize in interface SatParametersOrBuilder
      Returns:
      The restartRunningWindowSize.
    • setRestartRunningWindowSize

      public SatParameters.Builder setRestartRunningWindowSize(int value)
       Size of the window for the moving average restarts.
       
      optional int32 restart_running_window_size = 62 [default = 50];
      Parameters:
      value - The restartRunningWindowSize to set.
      Returns:
      This builder for chaining.
    • clearRestartRunningWindowSize

      public SatParameters.Builder clearRestartRunningWindowSize()
       Size of the window for the moving average restarts.
       
      optional int32 restart_running_window_size = 62 [default = 50];
      Returns:
      This builder for chaining.
    • hasRestartDlAverageRatio

      public boolean hasRestartDlAverageRatio()
       In the moving average restart algorithms, a restart is triggered if the
       window average times this ratio is greater that the global average.
       
      optional double restart_dl_average_ratio = 63 [default = 1];
      Specified by:
      hasRestartDlAverageRatio in interface SatParametersOrBuilder
      Returns:
      Whether the restartDlAverageRatio field is set.
    • getRestartDlAverageRatio

      public double getRestartDlAverageRatio()
       In the moving average restart algorithms, a restart is triggered if the
       window average times this ratio is greater that the global average.
       
      optional double restart_dl_average_ratio = 63 [default = 1];
      Specified by:
      getRestartDlAverageRatio in interface SatParametersOrBuilder
      Returns:
      The restartDlAverageRatio.
    • setRestartDlAverageRatio

      public SatParameters.Builder setRestartDlAverageRatio(double value)
       In the moving average restart algorithms, a restart is triggered if the
       window average times this ratio is greater that the global average.
       
      optional double restart_dl_average_ratio = 63 [default = 1];
      Parameters:
      value - The restartDlAverageRatio to set.
      Returns:
      This builder for chaining.
    • clearRestartDlAverageRatio

      public SatParameters.Builder clearRestartDlAverageRatio()
       In the moving average restart algorithms, a restart is triggered if the
       window average times this ratio is greater that the global average.
       
      optional double restart_dl_average_ratio = 63 [default = 1];
      Returns:
      This builder for chaining.
    • hasRestartLbdAverageRatio

      public boolean hasRestartLbdAverageRatio()
      optional double restart_lbd_average_ratio = 71 [default = 1];
      Specified by:
      hasRestartLbdAverageRatio in interface SatParametersOrBuilder
      Returns:
      Whether the restartLbdAverageRatio field is set.
    • getRestartLbdAverageRatio

      public double getRestartLbdAverageRatio()
      optional double restart_lbd_average_ratio = 71 [default = 1];
      Specified by:
      getRestartLbdAverageRatio in interface SatParametersOrBuilder
      Returns:
      The restartLbdAverageRatio.
    • setRestartLbdAverageRatio

      public SatParameters.Builder setRestartLbdAverageRatio(double value)
      optional double restart_lbd_average_ratio = 71 [default = 1];
      Parameters:
      value - The restartLbdAverageRatio to set.
      Returns:
      This builder for chaining.
    • clearRestartLbdAverageRatio

      public SatParameters.Builder clearRestartLbdAverageRatio()
      optional double restart_lbd_average_ratio = 71 [default = 1];
      Returns:
      This builder for chaining.
    • hasUseBlockingRestart

      public boolean hasUseBlockingRestart()
       Block a moving restart algorithm if the trail size of the current conflict
       is greater than the multiplier times the moving average of the trail size
       at the previous conflicts.
       
      optional bool use_blocking_restart = 64 [default = false];
      Specified by:
      hasUseBlockingRestart in interface SatParametersOrBuilder
      Returns:
      Whether the useBlockingRestart field is set.
    • getUseBlockingRestart

      public boolean getUseBlockingRestart()
       Block a moving restart algorithm if the trail size of the current conflict
       is greater than the multiplier times the moving average of the trail size
       at the previous conflicts.
       
      optional bool use_blocking_restart = 64 [default = false];
      Specified by:
      getUseBlockingRestart in interface SatParametersOrBuilder
      Returns:
      The useBlockingRestart.
    • setUseBlockingRestart

      public SatParameters.Builder setUseBlockingRestart(boolean value)
       Block a moving restart algorithm if the trail size of the current conflict
       is greater than the multiplier times the moving average of the trail size
       at the previous conflicts.
       
      optional bool use_blocking_restart = 64 [default = false];
      Parameters:
      value - The useBlockingRestart to set.
      Returns:
      This builder for chaining.
    • clearUseBlockingRestart

      public SatParameters.Builder clearUseBlockingRestart()
       Block a moving restart algorithm if the trail size of the current conflict
       is greater than the multiplier times the moving average of the trail size
       at the previous conflicts.
       
      optional bool use_blocking_restart = 64 [default = false];
      Returns:
      This builder for chaining.
    • hasBlockingRestartWindowSize

      public boolean hasBlockingRestartWindowSize()
      optional int32 blocking_restart_window_size = 65 [default = 5000];
      Specified by:
      hasBlockingRestartWindowSize in interface SatParametersOrBuilder
      Returns:
      Whether the blockingRestartWindowSize field is set.
    • getBlockingRestartWindowSize

      public int getBlockingRestartWindowSize()
      optional int32 blocking_restart_window_size = 65 [default = 5000];
      Specified by:
      getBlockingRestartWindowSize in interface SatParametersOrBuilder
      Returns:
      The blockingRestartWindowSize.
    • setBlockingRestartWindowSize

      public SatParameters.Builder setBlockingRestartWindowSize(int value)
      optional int32 blocking_restart_window_size = 65 [default = 5000];
      Parameters:
      value - The blockingRestartWindowSize to set.
      Returns:
      This builder for chaining.
    • clearBlockingRestartWindowSize

      public SatParameters.Builder clearBlockingRestartWindowSize()
      optional int32 blocking_restart_window_size = 65 [default = 5000];
      Returns:
      This builder for chaining.
    • hasBlockingRestartMultiplier

      public boolean hasBlockingRestartMultiplier()
      optional double blocking_restart_multiplier = 66 [default = 1.4];
      Specified by:
      hasBlockingRestartMultiplier in interface SatParametersOrBuilder
      Returns:
      Whether the blockingRestartMultiplier field is set.
    • getBlockingRestartMultiplier

      public double getBlockingRestartMultiplier()
      optional double blocking_restart_multiplier = 66 [default = 1.4];
      Specified by:
      getBlockingRestartMultiplier in interface SatParametersOrBuilder
      Returns:
      The blockingRestartMultiplier.
    • setBlockingRestartMultiplier

      public SatParameters.Builder setBlockingRestartMultiplier(double value)
      optional double blocking_restart_multiplier = 66 [default = 1.4];
      Parameters:
      value - The blockingRestartMultiplier to set.
      Returns:
      This builder for chaining.
    • clearBlockingRestartMultiplier

      public SatParameters.Builder clearBlockingRestartMultiplier()
      optional double blocking_restart_multiplier = 66 [default = 1.4];
      Returns:
      This builder for chaining.
    • hasNumConflictsBeforeStrategyChanges

      public boolean hasNumConflictsBeforeStrategyChanges()
       After each restart, if the number of conflict since the last strategy
       change is greater that this, then we increment a "strategy_counter" that
       can be use to change the search strategy used by the following restarts.
       
      optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
      Specified by:
      hasNumConflictsBeforeStrategyChanges in interface SatParametersOrBuilder
      Returns:
      Whether the numConflictsBeforeStrategyChanges field is set.
    • getNumConflictsBeforeStrategyChanges

      public int getNumConflictsBeforeStrategyChanges()
       After each restart, if the number of conflict since the last strategy
       change is greater that this, then we increment a "strategy_counter" that
       can be use to change the search strategy used by the following restarts.
       
      optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
      Specified by:
      getNumConflictsBeforeStrategyChanges in interface SatParametersOrBuilder
      Returns:
      The numConflictsBeforeStrategyChanges.
    • setNumConflictsBeforeStrategyChanges

      public SatParameters.Builder setNumConflictsBeforeStrategyChanges(int value)
       After each restart, if the number of conflict since the last strategy
       change is greater that this, then we increment a "strategy_counter" that
       can be use to change the search strategy used by the following restarts.
       
      optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
      Parameters:
      value - The numConflictsBeforeStrategyChanges to set.
      Returns:
      This builder for chaining.
    • clearNumConflictsBeforeStrategyChanges

      public SatParameters.Builder clearNumConflictsBeforeStrategyChanges()
       After each restart, if the number of conflict since the last strategy
       change is greater that this, then we increment a "strategy_counter" that
       can be use to change the search strategy used by the following restarts.
       
      optional int32 num_conflicts_before_strategy_changes = 68 [default = 0];
      Returns:
      This builder for chaining.
    • hasStrategyChangeIncreaseRatio

      public boolean hasStrategyChangeIncreaseRatio()
       The parameter num_conflicts_before_strategy_changes is increased by that
       much after each strategy change.
       
      optional double strategy_change_increase_ratio = 69 [default = 0];
      Specified by:
      hasStrategyChangeIncreaseRatio in interface SatParametersOrBuilder
      Returns:
      Whether the strategyChangeIncreaseRatio field is set.
    • getStrategyChangeIncreaseRatio

      public double getStrategyChangeIncreaseRatio()
       The parameter num_conflicts_before_strategy_changes is increased by that
       much after each strategy change.
       
      optional double strategy_change_increase_ratio = 69 [default = 0];
      Specified by:
      getStrategyChangeIncreaseRatio in interface SatParametersOrBuilder
      Returns:
      The strategyChangeIncreaseRatio.
    • setStrategyChangeIncreaseRatio

      public SatParameters.Builder setStrategyChangeIncreaseRatio(double value)
       The parameter num_conflicts_before_strategy_changes is increased by that
       much after each strategy change.
       
      optional double strategy_change_increase_ratio = 69 [default = 0];
      Parameters:
      value - The strategyChangeIncreaseRatio to set.
      Returns:
      This builder for chaining.
    • clearStrategyChangeIncreaseRatio

      public SatParameters.Builder clearStrategyChangeIncreaseRatio()
       The parameter num_conflicts_before_strategy_changes is increased by that
       much after each strategy change.
       
      optional double strategy_change_increase_ratio = 69 [default = 0];
      Returns:
      This builder for chaining.
    • hasMaxTimeInSeconds

      public boolean hasMaxTimeInSeconds()
       Maximum time allowed in seconds to solve a problem.
       The counter will starts at the beginning of the Solve() call.
       
      optional double max_time_in_seconds = 36 [default = inf];
      Specified by:
      hasMaxTimeInSeconds in interface SatParametersOrBuilder
      Returns:
      Whether the maxTimeInSeconds field is set.
    • getMaxTimeInSeconds

      public double getMaxTimeInSeconds()
       Maximum time allowed in seconds to solve a problem.
       The counter will starts at the beginning of the Solve() call.
       
      optional double max_time_in_seconds = 36 [default = inf];
      Specified by:
      getMaxTimeInSeconds in interface SatParametersOrBuilder
      Returns:
      The maxTimeInSeconds.
    • setMaxTimeInSeconds

      public SatParameters.Builder setMaxTimeInSeconds(double value)
       Maximum time allowed in seconds to solve a problem.
       The counter will starts at the beginning of the Solve() call.
       
      optional double max_time_in_seconds = 36 [default = inf];
      Parameters:
      value - The maxTimeInSeconds to set.
      Returns:
      This builder for chaining.
    • clearMaxTimeInSeconds

      public SatParameters.Builder clearMaxTimeInSeconds()
       Maximum time allowed in seconds to solve a problem.
       The counter will starts at the beginning of the Solve() call.
       
      optional double max_time_in_seconds = 36 [default = inf];
      Returns:
      This builder for chaining.
    • 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 as close as possible to a second.
       
      optional double max_deterministic_time = 67 [default = inf];
      Specified by:
      hasMaxDeterministicTime in interface SatParametersOrBuilder
      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 as close as possible to a second.
       
      optional double max_deterministic_time = 67 [default = inf];
      Specified by:
      getMaxDeterministicTime in interface SatParametersOrBuilder
      Returns:
      The maxDeterministicTime.
    • setMaxDeterministicTime

      public SatParameters.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 as close as possible to a second.
       
      optional double max_deterministic_time = 67 [default = inf];
      Parameters:
      value - The maxDeterministicTime to set.
      Returns:
      This builder for chaining.
    • clearMaxDeterministicTime

      public SatParameters.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 as close as possible to a second.
       
      optional double max_deterministic_time = 67 [default = inf];
      Returns:
      This builder for chaining.
    • hasMaxNumDeterministicBatches

      public boolean hasMaxNumDeterministicBatches()
       Stops after that number of batches has been scheduled. This only make sense
       when interleave_search is true.
       
      optional int32 max_num_deterministic_batches = 291 [default = 0];
      Specified by:
      hasMaxNumDeterministicBatches in interface SatParametersOrBuilder
      Returns:
      Whether the maxNumDeterministicBatches field is set.
    • getMaxNumDeterministicBatches

      public int getMaxNumDeterministicBatches()
       Stops after that number of batches has been scheduled. This only make sense
       when interleave_search is true.
       
      optional int32 max_num_deterministic_batches = 291 [default = 0];
      Specified by:
      getMaxNumDeterministicBatches in interface SatParametersOrBuilder
      Returns:
      The maxNumDeterministicBatches.
    • setMaxNumDeterministicBatches

      public SatParameters.Builder setMaxNumDeterministicBatches(int value)
       Stops after that number of batches has been scheduled. This only make sense
       when interleave_search is true.
       
      optional int32 max_num_deterministic_batches = 291 [default = 0];
      Parameters:
      value - The maxNumDeterministicBatches to set.
      Returns:
      This builder for chaining.
    • clearMaxNumDeterministicBatches

      public SatParameters.Builder clearMaxNumDeterministicBatches()
       Stops after that number of batches has been scheduled. This only make sense
       when interleave_search is true.
       
      optional int32 max_num_deterministic_batches = 291 [default = 0];
      Returns:
      This builder for chaining.
    • hasMaxNumberOfConflicts

      public boolean hasMaxNumberOfConflicts()
       Maximum number of conflicts allowed to solve a problem.
      
       TODO(user): Maybe change the way the conflict limit is enforced?
       currently it is enforced on each independent internal SAT solve, rather
       than on the overall number of conflicts across all solves. So in the
       context of an optimization problem, this is not really usable directly by a
       client.
       
      optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
      Specified by:
      hasMaxNumberOfConflicts in interface SatParametersOrBuilder
      Returns:
      Whether the maxNumberOfConflicts field is set.
    • getMaxNumberOfConflicts

      public long getMaxNumberOfConflicts()
       Maximum number of conflicts allowed to solve a problem.
      
       TODO(user): Maybe change the way the conflict limit is enforced?
       currently it is enforced on each independent internal SAT solve, rather
       than on the overall number of conflicts across all solves. So in the
       context of an optimization problem, this is not really usable directly by a
       client.
       
      optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
      Specified by:
      getMaxNumberOfConflicts in interface SatParametersOrBuilder
      Returns:
      The maxNumberOfConflicts.
    • setMaxNumberOfConflicts

      public SatParameters.Builder setMaxNumberOfConflicts(long value)
       Maximum number of conflicts allowed to solve a problem.
      
       TODO(user): Maybe change the way the conflict limit is enforced?
       currently it is enforced on each independent internal SAT solve, rather
       than on the overall number of conflicts across all solves. So in the
       context of an optimization problem, this is not really usable directly by a
       client.
       
      optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
      Parameters:
      value - The maxNumberOfConflicts to set.
      Returns:
      This builder for chaining.
    • clearMaxNumberOfConflicts

      public SatParameters.Builder clearMaxNumberOfConflicts()
       Maximum number of conflicts allowed to solve a problem.
      
       TODO(user): Maybe change the way the conflict limit is enforced?
       currently it is enforced on each independent internal SAT solve, rather
       than on the overall number of conflicts across all solves. So in the
       context of an optimization problem, this is not really usable directly by a
       client.
       
      optional int64 max_number_of_conflicts = 37 [default = 9223372036854775807];
      Returns:
      This builder for chaining.
    • hasMaxMemoryInMb

      public boolean hasMaxMemoryInMb()
       Maximum memory allowed for the whole thread containing the solver. The
       solver will abort as soon as it detects that this limit is crossed. As a
       result, this limit is approximative, but usually the solver will not go too
       much over.
      
       TODO(user): This is only used by the pure SAT solver, generalize to CP-SAT.
       
      optional int64 max_memory_in_mb = 40 [default = 10000];
      Specified by:
      hasMaxMemoryInMb in interface SatParametersOrBuilder
      Returns:
      Whether the maxMemoryInMb field is set.
    • getMaxMemoryInMb

      public long getMaxMemoryInMb()
       Maximum memory allowed for the whole thread containing the solver. The
       solver will abort as soon as it detects that this limit is crossed. As a
       result, this limit is approximative, but usually the solver will not go too
       much over.
      
       TODO(user): This is only used by the pure SAT solver, generalize to CP-SAT.
       
      optional int64 max_memory_in_mb = 40 [default = 10000];
      Specified by:
      getMaxMemoryInMb in interface SatParametersOrBuilder
      Returns:
      The maxMemoryInMb.
    • setMaxMemoryInMb

      public SatParameters.Builder setMaxMemoryInMb(long value)
       Maximum memory allowed for the whole thread containing the solver. The
       solver will abort as soon as it detects that this limit is crossed. As a
       result, this limit is approximative, but usually the solver will not go too
       much over.
      
       TODO(user): This is only used by the pure SAT solver, generalize to CP-SAT.
       
      optional int64 max_memory_in_mb = 40 [default = 10000];
      Parameters:
      value - The maxMemoryInMb to set.
      Returns:
      This builder for chaining.
    • clearMaxMemoryInMb

      public SatParameters.Builder clearMaxMemoryInMb()
       Maximum memory allowed for the whole thread containing the solver. The
       solver will abort as soon as it detects that this limit is crossed. As a
       result, this limit is approximative, but usually the solver will not go too
       much over.
      
       TODO(user): This is only used by the pure SAT solver, generalize to CP-SAT.
       
      optional int64 max_memory_in_mb = 40 [default = 10000];
      Returns:
      This builder for chaining.
    • hasAbsoluteGapLimit

      public boolean hasAbsoluteGapLimit()
       Stop the search when the gap between the best feasible objective (O) and
       our best objective bound (B) is smaller than a limit.
       The exact definition is:
       - Absolute: abs(O - B)
       - Relative: abs(O - B) / max(1, abs(O)).
      
       Important: The relative gap depends on the objective offset! If you
       artificially shift the objective, you will get widely different value of
       the relative gap.
      
       Note that if the gap is reached, the search status will be OPTIMAL. But
       one can check the best objective bound to see the actual gap.
      
       If the objective is integer, then any absolute gap < 1 will lead to a true
       optimal. If the objective is floating point, a gap of zero make little
       sense so is is why we use a non-zero default value. At the end of the
       search, we will display a warning if OPTIMAL is reported yet the gap is
       greater than this absolute gap.
       
      optional double absolute_gap_limit = 159 [default = 0.0001];
      Specified by:
      hasAbsoluteGapLimit in interface SatParametersOrBuilder
      Returns:
      Whether the absoluteGapLimit field is set.
    • getAbsoluteGapLimit

      public double getAbsoluteGapLimit()
       Stop the search when the gap between the best feasible objective (O) and
       our best objective bound (B) is smaller than a limit.
       The exact definition is:
       - Absolute: abs(O - B)
       - Relative: abs(O - B) / max(1, abs(O)).
      
       Important: The relative gap depends on the objective offset! If you
       artificially shift the objective, you will get widely different value of
       the relative gap.
      
       Note that if the gap is reached, the search status will be OPTIMAL. But
       one can check the best objective bound to see the actual gap.
      
       If the objective is integer, then any absolute gap < 1 will lead to a true
       optimal. If the objective is floating point, a gap of zero make little
       sense so is is why we use a non-zero default value. At the end of the
       search, we will display a warning if OPTIMAL is reported yet the gap is
       greater than this absolute gap.
       
      optional double absolute_gap_limit = 159 [default = 0.0001];
      Specified by:
      getAbsoluteGapLimit in interface SatParametersOrBuilder
      Returns:
      The absoluteGapLimit.
    • setAbsoluteGapLimit

      public SatParameters.Builder setAbsoluteGapLimit(double value)
       Stop the search when the gap between the best feasible objective (O) and
       our best objective bound (B) is smaller than a limit.
       The exact definition is:
       - Absolute: abs(O - B)
       - Relative: abs(O - B) / max(1, abs(O)).
      
       Important: The relative gap depends on the objective offset! If you
       artificially shift the objective, you will get widely different value of
       the relative gap.
      
       Note that if the gap is reached, the search status will be OPTIMAL. But
       one can check the best objective bound to see the actual gap.
      
       If the objective is integer, then any absolute gap < 1 will lead to a true
       optimal. If the objective is floating point, a gap of zero make little
       sense so is is why we use a non-zero default value. At the end of the
       search, we will display a warning if OPTIMAL is reported yet the gap is
       greater than this absolute gap.
       
      optional double absolute_gap_limit = 159 [default = 0.0001];
      Parameters:
      value - The absoluteGapLimit to set.
      Returns:
      This builder for chaining.
    • clearAbsoluteGapLimit

      public SatParameters.Builder clearAbsoluteGapLimit()
       Stop the search when the gap between the best feasible objective (O) and
       our best objective bound (B) is smaller than a limit.
       The exact definition is:
       - Absolute: abs(O - B)
       - Relative: abs(O - B) / max(1, abs(O)).
      
       Important: The relative gap depends on the objective offset! If you
       artificially shift the objective, you will get widely different value of
       the relative gap.
      
       Note that if the gap is reached, the search status will be OPTIMAL. But
       one can check the best objective bound to see the actual gap.
      
       If the objective is integer, then any absolute gap < 1 will lead to a true
       optimal. If the objective is floating point, a gap of zero make little
       sense so is is why we use a non-zero default value. At the end of the
       search, we will display a warning if OPTIMAL is reported yet the gap is
       greater than this absolute gap.
       
      optional double absolute_gap_limit = 159 [default = 0.0001];
      Returns:
      This builder for chaining.
    • hasRelativeGapLimit

      public boolean hasRelativeGapLimit()
      optional double relative_gap_limit = 160 [default = 0];
      Specified by:
      hasRelativeGapLimit in interface SatParametersOrBuilder
      Returns:
      Whether the relativeGapLimit field is set.
    • getRelativeGapLimit

      public double getRelativeGapLimit()
      optional double relative_gap_limit = 160 [default = 0];
      Specified by:
      getRelativeGapLimit in interface SatParametersOrBuilder
      Returns:
      The relativeGapLimit.
    • setRelativeGapLimit

      public SatParameters.Builder setRelativeGapLimit(double value)
      optional double relative_gap_limit = 160 [default = 0];
      Parameters:
      value - The relativeGapLimit to set.
      Returns:
      This builder for chaining.
    • clearRelativeGapLimit

      public SatParameters.Builder clearRelativeGapLimit()
      optional double relative_gap_limit = 160 [default = 0];
      Returns:
      This builder for chaining.
    • hasRandomSeed

      public boolean hasRandomSeed()
       At the beginning of each solve, the random number generator used in some
       part of the solver is reinitialized to this seed. If you change the random
       seed, the solver may make different choices during the solving process.
      
       For some problems, the running time may vary a lot depending on small
       change in the solving algorithm. Running the solver with different seeds
       enables to have more robust benchmarks when evaluating new features.
       
      optional int32 random_seed = 31 [default = 1];
      Specified by:
      hasRandomSeed in interface SatParametersOrBuilder
      Returns:
      Whether the randomSeed field is set.
    • getRandomSeed

      public int getRandomSeed()
       At the beginning of each solve, the random number generator used in some
       part of the solver is reinitialized to this seed. If you change the random
       seed, the solver may make different choices during the solving process.
      
       For some problems, the running time may vary a lot depending on small
       change in the solving algorithm. Running the solver with different seeds
       enables to have more robust benchmarks when evaluating new features.
       
      optional int32 random_seed = 31 [default = 1];
      Specified by:
      getRandomSeed in interface SatParametersOrBuilder
      Returns:
      The randomSeed.
    • setRandomSeed

      public SatParameters.Builder setRandomSeed(int value)
       At the beginning of each solve, the random number generator used in some
       part of the solver is reinitialized to this seed. If you change the random
       seed, the solver may make different choices during the solving process.
      
       For some problems, the running time may vary a lot depending on small
       change in the solving algorithm. Running the solver with different seeds
       enables to have more robust benchmarks when evaluating new features.
       
      optional int32 random_seed = 31 [default = 1];
      Parameters:
      value - The randomSeed to set.
      Returns:
      This builder for chaining.
    • clearRandomSeed

      public SatParameters.Builder clearRandomSeed()
       At the beginning of each solve, the random number generator used in some
       part of the solver is reinitialized to this seed. If you change the random
       seed, the solver may make different choices during the solving process.
      
       For some problems, the running time may vary a lot depending on small
       change in the solving algorithm. Running the solver with different seeds
       enables to have more robust benchmarks when evaluating new features.
       
      optional int32 random_seed = 31 [default = 1];
      Returns:
      This builder for chaining.
    • hasPermuteVariableRandomly

      public boolean hasPermuteVariableRandomly()
       This is mainly here to test the solver variability. Note that in tests, if
       not explicitly set to false, all 3 options will be set to true so that
       clients do not rely on the solver returning a specific solution if they are
       many equivalent optimal solutions.
       
      optional bool permute_variable_randomly = 178 [default = false];
      Specified by:
      hasPermuteVariableRandomly in interface SatParametersOrBuilder
      Returns:
      Whether the permuteVariableRandomly field is set.
    • getPermuteVariableRandomly

      public boolean getPermuteVariableRandomly()
       This is mainly here to test the solver variability. Note that in tests, if
       not explicitly set to false, all 3 options will be set to true so that
       clients do not rely on the solver returning a specific solution if they are
       many equivalent optimal solutions.
       
      optional bool permute_variable_randomly = 178 [default = false];
      Specified by:
      getPermuteVariableRandomly in interface SatParametersOrBuilder
      Returns:
      The permuteVariableRandomly.
    • setPermuteVariableRandomly

      public SatParameters.Builder setPermuteVariableRandomly(boolean value)
       This is mainly here to test the solver variability. Note that in tests, if
       not explicitly set to false, all 3 options will be set to true so that
       clients do not rely on the solver returning a specific solution if they are
       many equivalent optimal solutions.
       
      optional bool permute_variable_randomly = 178 [default = false];
      Parameters:
      value - The permuteVariableRandomly to set.
      Returns:
      This builder for chaining.
    • clearPermuteVariableRandomly

      public SatParameters.Builder clearPermuteVariableRandomly()
       This is mainly here to test the solver variability. Note that in tests, if
       not explicitly set to false, all 3 options will be set to true so that
       clients do not rely on the solver returning a specific solution if they are
       many equivalent optimal solutions.
       
      optional bool permute_variable_randomly = 178 [default = false];
      Returns:
      This builder for chaining.
    • hasPermutePresolveConstraintOrder

      public boolean hasPermutePresolveConstraintOrder()
      optional bool permute_presolve_constraint_order = 179 [default = false];
      Specified by:
      hasPermutePresolveConstraintOrder in interface SatParametersOrBuilder
      Returns:
      Whether the permutePresolveConstraintOrder field is set.
    • getPermutePresolveConstraintOrder

      public boolean getPermutePresolveConstraintOrder()
      optional bool permute_presolve_constraint_order = 179 [default = false];
      Specified by:
      getPermutePresolveConstraintOrder in interface SatParametersOrBuilder
      Returns:
      The permutePresolveConstraintOrder.
    • setPermutePresolveConstraintOrder

      public SatParameters.Builder setPermutePresolveConstraintOrder(boolean value)
      optional bool permute_presolve_constraint_order = 179 [default = false];
      Parameters:
      value - The permutePresolveConstraintOrder to set.
      Returns:
      This builder for chaining.
    • clearPermutePresolveConstraintOrder

      public SatParameters.Builder clearPermutePresolveConstraintOrder()
      optional bool permute_presolve_constraint_order = 179 [default = false];
      Returns:
      This builder for chaining.
    • hasUseAbslRandom

      public boolean hasUseAbslRandom()
      optional bool use_absl_random = 180 [default = false];
      Specified by:
      hasUseAbslRandom in interface SatParametersOrBuilder
      Returns:
      Whether the useAbslRandom field is set.
    • getUseAbslRandom

      public boolean getUseAbslRandom()
      optional bool use_absl_random = 180 [default = false];
      Specified by:
      getUseAbslRandom in interface SatParametersOrBuilder
      Returns:
      The useAbslRandom.
    • setUseAbslRandom

      public SatParameters.Builder setUseAbslRandom(boolean value)
      optional bool use_absl_random = 180 [default = false];
      Parameters:
      value - The useAbslRandom to set.
      Returns:
      This builder for chaining.
    • clearUseAbslRandom

      public SatParameters.Builder clearUseAbslRandom()
      optional bool use_absl_random = 180 [default = false];
      Returns:
      This builder for chaining.
    • hasLogSearchProgress

      public boolean hasLogSearchProgress()
       Whether the solver should log the search progress. This is the maing
       logging parameter and if this is false, none of the logging (callbacks,
       log_to_stdout, log_to_response, ...) will do anything.
       
      optional bool log_search_progress = 41 [default = false];
      Specified by:
      hasLogSearchProgress in interface SatParametersOrBuilder
      Returns:
      Whether the logSearchProgress field is set.
    • getLogSearchProgress

      public boolean getLogSearchProgress()
       Whether the solver should log the search progress. This is the maing
       logging parameter and if this is false, none of the logging (callbacks,
       log_to_stdout, log_to_response, ...) will do anything.
       
      optional bool log_search_progress = 41 [default = false];
      Specified by:
      getLogSearchProgress in interface SatParametersOrBuilder
      Returns:
      The logSearchProgress.
    • setLogSearchProgress

      public SatParameters.Builder setLogSearchProgress(boolean value)
       Whether the solver should log the search progress. This is the maing
       logging parameter and if this is false, none of the logging (callbacks,
       log_to_stdout, log_to_response, ...) will do anything.
       
      optional bool log_search_progress = 41 [default = false];
      Parameters:
      value - The logSearchProgress to set.
      Returns:
      This builder for chaining.
    • clearLogSearchProgress

      public SatParameters.Builder clearLogSearchProgress()
       Whether the solver should log the search progress. This is the maing
       logging parameter and if this is false, none of the logging (callbacks,
       log_to_stdout, log_to_response, ...) will do anything.
       
      optional bool log_search_progress = 41 [default = false];
      Returns:
      This builder for chaining.
    • hasLogSubsolverStatistics

      public boolean hasLogSubsolverStatistics()
       Whether the solver should display per sub-solver search statistics.
       This is only useful is log_search_progress is set to true, and if the
       number of search workers is > 1. Note that in all case we display a bit
       of stats with one line per subsolver.
       
      optional bool log_subsolver_statistics = 189 [default = false];
      Specified by:
      hasLogSubsolverStatistics in interface SatParametersOrBuilder
      Returns:
      Whether the logSubsolverStatistics field is set.
    • getLogSubsolverStatistics

      public boolean getLogSubsolverStatistics()
       Whether the solver should display per sub-solver search statistics.
       This is only useful is log_search_progress is set to true, and if the
       number of search workers is > 1. Note that in all case we display a bit
       of stats with one line per subsolver.
       
      optional bool log_subsolver_statistics = 189 [default = false];
      Specified by:
      getLogSubsolverStatistics in interface SatParametersOrBuilder
      Returns:
      The logSubsolverStatistics.
    • setLogSubsolverStatistics

      public SatParameters.Builder setLogSubsolverStatistics(boolean value)
       Whether the solver should display per sub-solver search statistics.
       This is only useful is log_search_progress is set to true, and if the
       number of search workers is > 1. Note that in all case we display a bit
       of stats with one line per subsolver.
       
      optional bool log_subsolver_statistics = 189 [default = false];
      Parameters:
      value - The logSubsolverStatistics to set.
      Returns:
      This builder for chaining.
    • clearLogSubsolverStatistics

      public SatParameters.Builder clearLogSubsolverStatistics()
       Whether the solver should display per sub-solver search statistics.
       This is only useful is log_search_progress is set to true, and if the
       number of search workers is > 1. Note that in all case we display a bit
       of stats with one line per subsolver.
       
      optional bool log_subsolver_statistics = 189 [default = false];
      Returns:
      This builder for chaining.
    • hasLogPrefix

      public boolean hasLogPrefix()
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Specified by:
      hasLogPrefix in interface SatParametersOrBuilder
      Returns:
      Whether the logPrefix field is set.
    • getLogPrefix

      public String getLogPrefix()
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Specified by:
      getLogPrefix in interface SatParametersOrBuilder
      Returns:
      The logPrefix.
    • getLogPrefixBytes

      public com.google.protobuf.ByteString getLogPrefixBytes()
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Specified by:
      getLogPrefixBytes in interface SatParametersOrBuilder
      Returns:
      The bytes for logPrefix.
    • setLogPrefix

      public SatParameters.Builder setLogPrefix(String value)
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Parameters:
      value - The logPrefix to set.
      Returns:
      This builder for chaining.
    • clearLogPrefix

      public SatParameters.Builder clearLogPrefix()
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Returns:
      This builder for chaining.
    • setLogPrefixBytes

      public SatParameters.Builder setLogPrefixBytes(com.google.protobuf.ByteString value)
       Add a prefix to all logs.
       
      optional string log_prefix = 185 [default = ""];
      Parameters:
      value - The bytes for logPrefix to set.
      Returns:
      This builder for chaining.
    • hasLogToStdout

      public boolean hasLogToStdout()
       Log to stdout.
       
      optional bool log_to_stdout = 186 [default = true];
      Specified by:
      hasLogToStdout in interface SatParametersOrBuilder
      Returns:
      Whether the logToStdout field is set.
    • getLogToStdout

      public boolean getLogToStdout()
       Log to stdout.
       
      optional bool log_to_stdout = 186 [default = true];
      Specified by:
      getLogToStdout in interface SatParametersOrBuilder
      Returns:
      The logToStdout.
    • setLogToStdout

      public SatParameters.Builder setLogToStdout(boolean value)
       Log to stdout.
       
      optional bool log_to_stdout = 186 [default = true];
      Parameters:
      value - The logToStdout to set.
      Returns:
      This builder for chaining.
    • clearLogToStdout

      public SatParameters.Builder clearLogToStdout()
       Log to stdout.
       
      optional bool log_to_stdout = 186 [default = true];
      Returns:
      This builder for chaining.
    • hasLogToResponse

      public boolean hasLogToResponse()
       Log to response proto.
       
      optional bool log_to_response = 187 [default = false];
      Specified by:
      hasLogToResponse in interface SatParametersOrBuilder
      Returns:
      Whether the logToResponse field is set.
    • getLogToResponse

      public boolean getLogToResponse()
       Log to response proto.
       
      optional bool log_to_response = 187 [default = false];
      Specified by:
      getLogToResponse in interface SatParametersOrBuilder
      Returns:
      The logToResponse.
    • setLogToResponse

      public SatParameters.Builder setLogToResponse(boolean value)
       Log to response proto.
       
      optional bool log_to_response = 187 [default = false];
      Parameters:
      value - The logToResponse to set.
      Returns:
      This builder for chaining.
    • clearLogToResponse

      public SatParameters.Builder clearLogToResponse()
       Log to response proto.
       
      optional bool log_to_response = 187 [default = false];
      Returns:
      This builder for chaining.
    • hasUsePbResolution

      public boolean hasUsePbResolution()
       Whether to use pseudo-Boolean resolution to analyze a conflict. Note that
       this option only make sense if your problem is modelized using
       pseudo-Boolean constraints. If you only have clauses, this shouldn't change
       anything (except slow the solver down).
       
      optional bool use_pb_resolution = 43 [default = false];
      Specified by:
      hasUsePbResolution in interface SatParametersOrBuilder
      Returns:
      Whether the usePbResolution field is set.
    • getUsePbResolution

      public boolean getUsePbResolution()
       Whether to use pseudo-Boolean resolution to analyze a conflict. Note that
       this option only make sense if your problem is modelized using
       pseudo-Boolean constraints. If you only have clauses, this shouldn't change
       anything (except slow the solver down).
       
      optional bool use_pb_resolution = 43 [default = false];
      Specified by:
      getUsePbResolution in interface SatParametersOrBuilder
      Returns:
      The usePbResolution.
    • setUsePbResolution

      public SatParameters.Builder setUsePbResolution(boolean value)
       Whether to use pseudo-Boolean resolution to analyze a conflict. Note that
       this option only make sense if your problem is modelized using
       pseudo-Boolean constraints. If you only have clauses, this shouldn't change
       anything (except slow the solver down).
       
      optional bool use_pb_resolution = 43 [default = false];
      Parameters:
      value - The usePbResolution to set.
      Returns:
      This builder for chaining.
    • clearUsePbResolution

      public SatParameters.Builder clearUsePbResolution()
       Whether to use pseudo-Boolean resolution to analyze a conflict. Note that
       this option only make sense if your problem is modelized using
       pseudo-Boolean constraints. If you only have clauses, this shouldn't change
       anything (except slow the solver down).
       
      optional bool use_pb_resolution = 43 [default = false];
      Returns:
      This builder for chaining.
    • hasMinimizeReductionDuringPbResolution

      public boolean hasMinimizeReductionDuringPbResolution()
       A different algorithm during PB resolution. It minimizes the number of
       calls to ReduceCoefficients() which can be time consuming. However, the
       search space will be different and if the coefficients are large, this may
       lead to integer overflows that could otherwise be prevented.
       
      optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
      Specified by:
      hasMinimizeReductionDuringPbResolution in interface SatParametersOrBuilder
      Returns:
      Whether the minimizeReductionDuringPbResolution field is set.
    • getMinimizeReductionDuringPbResolution

      public boolean getMinimizeReductionDuringPbResolution()
       A different algorithm during PB resolution. It minimizes the number of
       calls to ReduceCoefficients() which can be time consuming. However, the
       search space will be different and if the coefficients are large, this may
       lead to integer overflows that could otherwise be prevented.
       
      optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
      Specified by:
      getMinimizeReductionDuringPbResolution in interface SatParametersOrBuilder
      Returns:
      The minimizeReductionDuringPbResolution.
    • setMinimizeReductionDuringPbResolution

      public SatParameters.Builder setMinimizeReductionDuringPbResolution(boolean value)
       A different algorithm during PB resolution. It minimizes the number of
       calls to ReduceCoefficients() which can be time consuming. However, the
       search space will be different and if the coefficients are large, this may
       lead to integer overflows that could otherwise be prevented.
       
      optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
      Parameters:
      value - The minimizeReductionDuringPbResolution to set.
      Returns:
      This builder for chaining.
    • clearMinimizeReductionDuringPbResolution

      public SatParameters.Builder clearMinimizeReductionDuringPbResolution()
       A different algorithm during PB resolution. It minimizes the number of
       calls to ReduceCoefficients() which can be time consuming. However, the
       search space will be different and if the coefficients are large, this may
       lead to integer overflows that could otherwise be prevented.
       
      optional bool minimize_reduction_during_pb_resolution = 48 [default = false];
      Returns:
      This builder for chaining.
    • hasCountAssumptionLevelsInLbd

      public boolean hasCountAssumptionLevelsInLbd()
       Whether or not the assumption levels are taken into account during the LBD
       computation. According to the reference below, not counting them improves
       the solver in some situation. Note that this only impact solves under
       assumptions.
      
       Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, "Improving Glucose for
       Incremental SAT Solving with Assumptions: Application to MUS Extraction"
       Theory and Applications of Satisfiability Testing - SAT 2013, Lecture Notes
       in Computer Science Volume 7962, 2013, pp 309-317.
       
      optional bool count_assumption_levels_in_lbd = 49 [default = true];
      Specified by:
      hasCountAssumptionLevelsInLbd in interface SatParametersOrBuilder
      Returns:
      Whether the countAssumptionLevelsInLbd field is set.
    • getCountAssumptionLevelsInLbd

      public boolean getCountAssumptionLevelsInLbd()
       Whether or not the assumption levels are taken into account during the LBD
       computation. According to the reference below, not counting them improves
       the solver in some situation. Note that this only impact solves under
       assumptions.
      
       Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, "Improving Glucose for
       Incremental SAT Solving with Assumptions: Application to MUS Extraction"
       Theory and Applications of Satisfiability Testing - SAT 2013, Lecture Notes
       in Computer Science Volume 7962, 2013, pp 309-317.
       
      optional bool count_assumption_levels_in_lbd = 49 [default = true];
      Specified by:
      getCountAssumptionLevelsInLbd in interface SatParametersOrBuilder
      Returns:
      The countAssumptionLevelsInLbd.
    • setCountAssumptionLevelsInLbd

      public SatParameters.Builder setCountAssumptionLevelsInLbd(boolean value)
       Whether or not the assumption levels are taken into account during the LBD
       computation. According to the reference below, not counting them improves
       the solver in some situation. Note that this only impact solves under
       assumptions.
      
       Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, "Improving Glucose for
       Incremental SAT Solving with Assumptions: Application to MUS Extraction"
       Theory and Applications of Satisfiability Testing - SAT 2013, Lecture Notes
       in Computer Science Volume 7962, 2013, pp 309-317.
       
      optional bool count_assumption_levels_in_lbd = 49 [default = true];
      Parameters:
      value - The countAssumptionLevelsInLbd to set.
      Returns:
      This builder for chaining.
    • clearCountAssumptionLevelsInLbd

      public SatParameters.Builder clearCountAssumptionLevelsInLbd()
       Whether or not the assumption levels are taken into account during the LBD
       computation. According to the reference below, not counting them improves
       the solver in some situation. Note that this only impact solves under
       assumptions.
      
       Gilles Audemard, Jean-Marie Lagniez, Laurent Simon, "Improving Glucose for
       Incremental SAT Solving with Assumptions: Application to MUS Extraction"
       Theory and Applications of Satisfiability Testing - SAT 2013, Lecture Notes
       in Computer Science Volume 7962, 2013, pp 309-317.
       
      optional bool count_assumption_levels_in_lbd = 49 [default = true];
      Returns:
      This builder for chaining.
    • hasPresolveBveThreshold

      public boolean hasPresolveBveThreshold()
       During presolve, only try to perform the bounded variable elimination (BVE)
       of a variable x if the number of occurrences of x times the number of
       occurrences of not(x) is not greater than this parameter.
       
      optional int32 presolve_bve_threshold = 54 [default = 500];
      Specified by:
      hasPresolveBveThreshold in interface SatParametersOrBuilder
      Returns:
      Whether the presolveBveThreshold field is set.
    • getPresolveBveThreshold

      public int getPresolveBveThreshold()
       During presolve, only try to perform the bounded variable elimination (BVE)
       of a variable x if the number of occurrences of x times the number of
       occurrences of not(x) is not greater than this parameter.
       
      optional int32 presolve_bve_threshold = 54 [default = 500];
      Specified by:
      getPresolveBveThreshold in interface SatParametersOrBuilder
      Returns:
      The presolveBveThreshold.
    • setPresolveBveThreshold

      public SatParameters.Builder setPresolveBveThreshold(int value)
       During presolve, only try to perform the bounded variable elimination (BVE)
       of a variable x if the number of occurrences of x times the number of
       occurrences of not(x) is not greater than this parameter.
       
      optional int32 presolve_bve_threshold = 54 [default = 500];
      Parameters:
      value - The presolveBveThreshold to set.
      Returns:
      This builder for chaining.
    • clearPresolveBveThreshold

      public SatParameters.Builder clearPresolveBveThreshold()
       During presolve, only try to perform the bounded variable elimination (BVE)
       of a variable x if the number of occurrences of x times the number of
       occurrences of not(x) is not greater than this parameter.
       
      optional int32 presolve_bve_threshold = 54 [default = 500];
      Returns:
      This builder for chaining.
    • hasFilterSatPostsolveClauses

      public boolean hasFilterSatPostsolveClauses()
       Internal parameter. During BVE, if we eliminate a variable x, by default we
       will push all clauses containing x and all clauses containing not(x) to the
       postsolve. However, it is possible to write the postsolve code so that only
       one such set is needed. The idea is that, if we push the set containing a
       literal l, is to set l to false except if it is needed to satisfy one of
       the clause in the set. This is always beneficial, but for historical
       reason, not all our postsolve algorithm support this.
       
      optional bool filter_sat_postsolve_clauses = 324 [default = false];
      Specified by:
      hasFilterSatPostsolveClauses in interface SatParametersOrBuilder
      Returns:
      Whether the filterSatPostsolveClauses field is set.
    • getFilterSatPostsolveClauses

      public boolean getFilterSatPostsolveClauses()
       Internal parameter. During BVE, if we eliminate a variable x, by default we
       will push all clauses containing x and all clauses containing not(x) to the
       postsolve. However, it is possible to write the postsolve code so that only
       one such set is needed. The idea is that, if we push the set containing a
       literal l, is to set l to false except if it is needed to satisfy one of
       the clause in the set. This is always beneficial, but for historical
       reason, not all our postsolve algorithm support this.
       
      optional bool filter_sat_postsolve_clauses = 324 [default = false];
      Specified by:
      getFilterSatPostsolveClauses in interface SatParametersOrBuilder
      Returns:
      The filterSatPostsolveClauses.
    • setFilterSatPostsolveClauses

      public SatParameters.Builder setFilterSatPostsolveClauses(boolean value)
       Internal parameter. During BVE, if we eliminate a variable x, by default we
       will push all clauses containing x and all clauses containing not(x) to the
       postsolve. However, it is possible to write the postsolve code so that only
       one such set is needed. The idea is that, if we push the set containing a
       literal l, is to set l to false except if it is needed to satisfy one of
       the clause in the set. This is always beneficial, but for historical
       reason, not all our postsolve algorithm support this.
       
      optional bool filter_sat_postsolve_clauses = 324 [default = false];
      Parameters:
      value - The filterSatPostsolveClauses to set.
      Returns:
      This builder for chaining.
    • clearFilterSatPostsolveClauses

      public SatParameters.Builder clearFilterSatPostsolveClauses()
       Internal parameter. During BVE, if we eliminate a variable x, by default we
       will push all clauses containing x and all clauses containing not(x) to the
       postsolve. However, it is possible to write the postsolve code so that only
       one such set is needed. The idea is that, if we push the set containing a
       literal l, is to set l to false except if it is needed to satisfy one of
       the clause in the set. This is always beneficial, but for historical
       reason, not all our postsolve algorithm support this.
       
      optional bool filter_sat_postsolve_clauses = 324 [default = false];
      Returns:
      This builder for chaining.
    • hasPresolveBveClauseWeight

      public boolean hasPresolveBveClauseWeight()
       During presolve, we apply BVE only if this weight times the number of
       clauses plus the number of clause literals is not increased.
       
      optional int32 presolve_bve_clause_weight = 55 [default = 3];
      Specified by:
      hasPresolveBveClauseWeight in interface SatParametersOrBuilder
      Returns:
      Whether the presolveBveClauseWeight field is set.
    • getPresolveBveClauseWeight

      public int getPresolveBveClauseWeight()
       During presolve, we apply BVE only if this weight times the number of
       clauses plus the number of clause literals is not increased.
       
      optional int32 presolve_bve_clause_weight = 55 [default = 3];
      Specified by:
      getPresolveBveClauseWeight in interface SatParametersOrBuilder
      Returns:
      The presolveBveClauseWeight.
    • setPresolveBveClauseWeight

      public SatParameters.Builder setPresolveBveClauseWeight(int value)
       During presolve, we apply BVE only if this weight times the number of
       clauses plus the number of clause literals is not increased.
       
      optional int32 presolve_bve_clause_weight = 55 [default = 3];
      Parameters:
      value - The presolveBveClauseWeight to set.
      Returns:
      This builder for chaining.
    • clearPresolveBveClauseWeight

      public SatParameters.Builder clearPresolveBveClauseWeight()
       During presolve, we apply BVE only if this weight times the number of
       clauses plus the number of clause literals is not increased.
       
      optional int32 presolve_bve_clause_weight = 55 [default = 3];
      Returns:
      This builder for chaining.
    • hasProbingDeterministicTimeLimit

      public boolean hasProbingDeterministicTimeLimit()
       The maximum "deterministic" time limit to spend in probing. A value of
       zero will disable the probing.
      
       TODO(user): Clean up. The first one is used in CP-SAT, the other in pure
       SAT presolve.
       
      optional double probing_deterministic_time_limit = 226 [default = 1];
      Specified by:
      hasProbingDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      Whether the probingDeterministicTimeLimit field is set.
    • getProbingDeterministicTimeLimit

      public double getProbingDeterministicTimeLimit()
       The maximum "deterministic" time limit to spend in probing. A value of
       zero will disable the probing.
      
       TODO(user): Clean up. The first one is used in CP-SAT, the other in pure
       SAT presolve.
       
      optional double probing_deterministic_time_limit = 226 [default = 1];
      Specified by:
      getProbingDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      The probingDeterministicTimeLimit.
    • setProbingDeterministicTimeLimit

      public SatParameters.Builder setProbingDeterministicTimeLimit(double value)
       The maximum "deterministic" time limit to spend in probing. A value of
       zero will disable the probing.
      
       TODO(user): Clean up. The first one is used in CP-SAT, the other in pure
       SAT presolve.
       
      optional double probing_deterministic_time_limit = 226 [default = 1];
      Parameters:
      value - The probingDeterministicTimeLimit to set.
      Returns:
      This builder for chaining.
    • clearProbingDeterministicTimeLimit

      public SatParameters.Builder clearProbingDeterministicTimeLimit()
       The maximum "deterministic" time limit to spend in probing. A value of
       zero will disable the probing.
      
       TODO(user): Clean up. The first one is used in CP-SAT, the other in pure
       SAT presolve.
       
      optional double probing_deterministic_time_limit = 226 [default = 1];
      Returns:
      This builder for chaining.
    • hasPresolveProbingDeterministicTimeLimit

      public boolean hasPresolveProbingDeterministicTimeLimit()
      optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
      Specified by:
      hasPresolveProbingDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      Whether the presolveProbingDeterministicTimeLimit field is set.
    • getPresolveProbingDeterministicTimeLimit

      public double getPresolveProbingDeterministicTimeLimit()
      optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
      Specified by:
      getPresolveProbingDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      The presolveProbingDeterministicTimeLimit.
    • setPresolveProbingDeterministicTimeLimit

      public SatParameters.Builder setPresolveProbingDeterministicTimeLimit(double value)
      optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
      Parameters:
      value - The presolveProbingDeterministicTimeLimit to set.
      Returns:
      This builder for chaining.
    • clearPresolveProbingDeterministicTimeLimit

      public SatParameters.Builder clearPresolveProbingDeterministicTimeLimit()
      optional double presolve_probing_deterministic_time_limit = 57 [default = 30];
      Returns:
      This builder for chaining.
    • hasPresolveBlockedClause

      public boolean hasPresolveBlockedClause()
       Whether we use an heuristic to detect some basic case of blocked clause
       in the SAT presolve.
       
      optional bool presolve_blocked_clause = 88 [default = true];
      Specified by:
      hasPresolveBlockedClause in interface SatParametersOrBuilder
      Returns:
      Whether the presolveBlockedClause field is set.
    • getPresolveBlockedClause

      public boolean getPresolveBlockedClause()
       Whether we use an heuristic to detect some basic case of blocked clause
       in the SAT presolve.
       
      optional bool presolve_blocked_clause = 88 [default = true];
      Specified by:
      getPresolveBlockedClause in interface SatParametersOrBuilder
      Returns:
      The presolveBlockedClause.
    • setPresolveBlockedClause

      public SatParameters.Builder setPresolveBlockedClause(boolean value)
       Whether we use an heuristic to detect some basic case of blocked clause
       in the SAT presolve.
       
      optional bool presolve_blocked_clause = 88 [default = true];
      Parameters:
      value - The presolveBlockedClause to set.
      Returns:
      This builder for chaining.
    • clearPresolveBlockedClause

      public SatParameters.Builder clearPresolveBlockedClause()
       Whether we use an heuristic to detect some basic case of blocked clause
       in the SAT presolve.
       
      optional bool presolve_blocked_clause = 88 [default = true];
      Returns:
      This builder for chaining.
    • hasPresolveUseBva

      public boolean hasPresolveUseBva()
       Whether or not we use Bounded Variable Addition (BVA) in the presolve.
       
      optional bool presolve_use_bva = 72 [default = true];
      Specified by:
      hasPresolveUseBva in interface SatParametersOrBuilder
      Returns:
      Whether the presolveUseBva field is set.
    • getPresolveUseBva

      public boolean getPresolveUseBva()
       Whether or not we use Bounded Variable Addition (BVA) in the presolve.
       
      optional bool presolve_use_bva = 72 [default = true];
      Specified by:
      getPresolveUseBva in interface SatParametersOrBuilder
      Returns:
      The presolveUseBva.
    • setPresolveUseBva

      public SatParameters.Builder setPresolveUseBva(boolean value)
       Whether or not we use Bounded Variable Addition (BVA) in the presolve.
       
      optional bool presolve_use_bva = 72 [default = true];
      Parameters:
      value - The presolveUseBva to set.
      Returns:
      This builder for chaining.
    • clearPresolveUseBva

      public SatParameters.Builder clearPresolveUseBva()
       Whether or not we use Bounded Variable Addition (BVA) in the presolve.
       
      optional bool presolve_use_bva = 72 [default = true];
      Returns:
      This builder for chaining.
    • hasPresolveBvaThreshold

      public boolean hasPresolveBvaThreshold()
       Apply Bounded Variable Addition (BVA) if the number of clauses is reduced
       by stricly more than this threshold. The algorithm described in the paper
       uses 0, but quick experiments showed that 1 is a good value. It may not be
       worth it to add a new variable just to remove one clause.
       
      optional int32 presolve_bva_threshold = 73 [default = 1];
      Specified by:
      hasPresolveBvaThreshold in interface SatParametersOrBuilder
      Returns:
      Whether the presolveBvaThreshold field is set.
    • getPresolveBvaThreshold

      public int getPresolveBvaThreshold()
       Apply Bounded Variable Addition (BVA) if the number of clauses is reduced
       by stricly more than this threshold. The algorithm described in the paper
       uses 0, but quick experiments showed that 1 is a good value. It may not be
       worth it to add a new variable just to remove one clause.
       
      optional int32 presolve_bva_threshold = 73 [default = 1];
      Specified by:
      getPresolveBvaThreshold in interface SatParametersOrBuilder
      Returns:
      The presolveBvaThreshold.
    • setPresolveBvaThreshold

      public SatParameters.Builder setPresolveBvaThreshold(int value)
       Apply Bounded Variable Addition (BVA) if the number of clauses is reduced
       by stricly more than this threshold. The algorithm described in the paper
       uses 0, but quick experiments showed that 1 is a good value. It may not be
       worth it to add a new variable just to remove one clause.
       
      optional int32 presolve_bva_threshold = 73 [default = 1];
      Parameters:
      value - The presolveBvaThreshold to set.
      Returns:
      This builder for chaining.
    • clearPresolveBvaThreshold

      public SatParameters.Builder clearPresolveBvaThreshold()
       Apply Bounded Variable Addition (BVA) if the number of clauses is reduced
       by stricly more than this threshold. The algorithm described in the paper
       uses 0, but quick experiments showed that 1 is a good value. It may not be
       worth it to add a new variable just to remove one clause.
       
      optional int32 presolve_bva_threshold = 73 [default = 1];
      Returns:
      This builder for chaining.
    • hasMaxPresolveIterations

      public boolean hasMaxPresolveIterations()
       In case of large reduction in a presolve iteration, we perform multiple
       presolve iterations. This parameter controls the maximum number of such
       presolve iterations.
       
      optional int32 max_presolve_iterations = 138 [default = 3];
      Specified by:
      hasMaxPresolveIterations in interface SatParametersOrBuilder
      Returns:
      Whether the maxPresolveIterations field is set.
    • getMaxPresolveIterations

      public int getMaxPresolveIterations()
       In case of large reduction in a presolve iteration, we perform multiple
       presolve iterations. This parameter controls the maximum number of such
       presolve iterations.
       
      optional int32 max_presolve_iterations = 138 [default = 3];
      Specified by:
      getMaxPresolveIterations in interface SatParametersOrBuilder
      Returns:
      The maxPresolveIterations.
    • setMaxPresolveIterations

      public SatParameters.Builder setMaxPresolveIterations(int value)
       In case of large reduction in a presolve iteration, we perform multiple
       presolve iterations. This parameter controls the maximum number of such
       presolve iterations.
       
      optional int32 max_presolve_iterations = 138 [default = 3];
      Parameters:
      value - The maxPresolveIterations to set.
      Returns:
      This builder for chaining.
    • clearMaxPresolveIterations

      public SatParameters.Builder clearMaxPresolveIterations()
       In case of large reduction in a presolve iteration, we perform multiple
       presolve iterations. This parameter controls the maximum number of such
       presolve iterations.
       
      optional int32 max_presolve_iterations = 138 [default = 3];
      Returns:
      This builder for chaining.
    • hasCpModelPresolve

      public boolean hasCpModelPresolve()
       Whether we presolve the cp_model before solving it.
       
      optional bool cp_model_presolve = 86 [default = true];
      Specified by:
      hasCpModelPresolve in interface SatParametersOrBuilder
      Returns:
      Whether the cpModelPresolve field is set.
    • getCpModelPresolve

      public boolean getCpModelPresolve()
       Whether we presolve the cp_model before solving it.
       
      optional bool cp_model_presolve = 86 [default = true];
      Specified by:
      getCpModelPresolve in interface SatParametersOrBuilder
      Returns:
      The cpModelPresolve.
    • setCpModelPresolve

      public SatParameters.Builder setCpModelPresolve(boolean value)
       Whether we presolve the cp_model before solving it.
       
      optional bool cp_model_presolve = 86 [default = true];
      Parameters:
      value - The cpModelPresolve to set.
      Returns:
      This builder for chaining.
    • clearCpModelPresolve

      public SatParameters.Builder clearCpModelPresolve()
       Whether we presolve the cp_model before solving it.
       
      optional bool cp_model_presolve = 86 [default = true];
      Returns:
      This builder for chaining.
    • hasCpModelProbingLevel

      public boolean hasCpModelProbingLevel()
       How much effort do we spend on probing. 0 disables it completely.
       
      optional int32 cp_model_probing_level = 110 [default = 2];
      Specified by:
      hasCpModelProbingLevel in interface SatParametersOrBuilder
      Returns:
      Whether the cpModelProbingLevel field is set.
    • getCpModelProbingLevel

      public int getCpModelProbingLevel()
       How much effort do we spend on probing. 0 disables it completely.
       
      optional int32 cp_model_probing_level = 110 [default = 2];
      Specified by:
      getCpModelProbingLevel in interface SatParametersOrBuilder
      Returns:
      The cpModelProbingLevel.
    • setCpModelProbingLevel

      public SatParameters.Builder setCpModelProbingLevel(int value)
       How much effort do we spend on probing. 0 disables it completely.
       
      optional int32 cp_model_probing_level = 110 [default = 2];
      Parameters:
      value - The cpModelProbingLevel to set.
      Returns:
      This builder for chaining.
    • clearCpModelProbingLevel

      public SatParameters.Builder clearCpModelProbingLevel()
       How much effort do we spend on probing. 0 disables it completely.
       
      optional int32 cp_model_probing_level = 110 [default = 2];
      Returns:
      This builder for chaining.
    • hasCpModelUseSatPresolve

      public boolean hasCpModelUseSatPresolve()
       Whether we also use the sat presolve when cp_model_presolve is true.
       
      optional bool cp_model_use_sat_presolve = 93 [default = true];
      Specified by:
      hasCpModelUseSatPresolve in interface SatParametersOrBuilder
      Returns:
      Whether the cpModelUseSatPresolve field is set.
    • getCpModelUseSatPresolve

      public boolean getCpModelUseSatPresolve()
       Whether we also use the sat presolve when cp_model_presolve is true.
       
      optional bool cp_model_use_sat_presolve = 93 [default = true];
      Specified by:
      getCpModelUseSatPresolve in interface SatParametersOrBuilder
      Returns:
      The cpModelUseSatPresolve.
    • setCpModelUseSatPresolve

      public SatParameters.Builder setCpModelUseSatPresolve(boolean value)
       Whether we also use the sat presolve when cp_model_presolve is true.
       
      optional bool cp_model_use_sat_presolve = 93 [default = true];
      Parameters:
      value - The cpModelUseSatPresolve to set.
      Returns:
      This builder for chaining.
    • clearCpModelUseSatPresolve

      public SatParameters.Builder clearCpModelUseSatPresolve()
       Whether we also use the sat presolve when cp_model_presolve is true.
       
      optional bool cp_model_use_sat_presolve = 93 [default = true];
      Returns:
      This builder for chaining.
    • hasRemoveFixedVariablesEarly

      public boolean hasRemoveFixedVariablesEarly()
       If cp_model_presolve is true and there is a large proportion of fixed
       variable after the first model copy, remap all the model to a dense set of
       variable before the full presolve even starts. This should help for LNS on
       large models.
       
      optional bool remove_fixed_variables_early = 310 [default = true];
      Specified by:
      hasRemoveFixedVariablesEarly in interface SatParametersOrBuilder
      Returns:
      Whether the removeFixedVariablesEarly field is set.
    • getRemoveFixedVariablesEarly

      public boolean getRemoveFixedVariablesEarly()
       If cp_model_presolve is true and there is a large proportion of fixed
       variable after the first model copy, remap all the model to a dense set of
       variable before the full presolve even starts. This should help for LNS on
       large models.
       
      optional bool remove_fixed_variables_early = 310 [default = true];
      Specified by:
      getRemoveFixedVariablesEarly in interface SatParametersOrBuilder
      Returns:
      The removeFixedVariablesEarly.
    • setRemoveFixedVariablesEarly

      public SatParameters.Builder setRemoveFixedVariablesEarly(boolean value)
       If cp_model_presolve is true and there is a large proportion of fixed
       variable after the first model copy, remap all the model to a dense set of
       variable before the full presolve even starts. This should help for LNS on
       large models.
       
      optional bool remove_fixed_variables_early = 310 [default = true];
      Parameters:
      value - The removeFixedVariablesEarly to set.
      Returns:
      This builder for chaining.
    • clearRemoveFixedVariablesEarly

      public SatParameters.Builder clearRemoveFixedVariablesEarly()
       If cp_model_presolve is true and there is a large proportion of fixed
       variable after the first model copy, remap all the model to a dense set of
       variable before the full presolve even starts. This should help for LNS on
       large models.
       
      optional bool remove_fixed_variables_early = 310 [default = true];
      Returns:
      This builder for chaining.
    • hasDetectTableWithCost

      public boolean hasDetectTableWithCost()
       If true, we detect variable that are unique to a table constraint and only
       there to encode a cost on each tuple. This is usually the case when a WCSP
       (weighted constraint program) is encoded into CP-SAT format.
      
       This can lead to a dramatic speed-up for such problems but is still
       experimental at this point.
       
      optional bool detect_table_with_cost = 216 [default = false];
      Specified by:
      hasDetectTableWithCost in interface SatParametersOrBuilder
      Returns:
      Whether the detectTableWithCost field is set.
    • getDetectTableWithCost

      public boolean getDetectTableWithCost()
       If true, we detect variable that are unique to a table constraint and only
       there to encode a cost on each tuple. This is usually the case when a WCSP
       (weighted constraint program) is encoded into CP-SAT format.
      
       This can lead to a dramatic speed-up for such problems but is still
       experimental at this point.
       
      optional bool detect_table_with_cost = 216 [default = false];
      Specified by:
      getDetectTableWithCost in interface SatParametersOrBuilder
      Returns:
      The detectTableWithCost.
    • setDetectTableWithCost

      public SatParameters.Builder setDetectTableWithCost(boolean value)
       If true, we detect variable that are unique to a table constraint and only
       there to encode a cost on each tuple. This is usually the case when a WCSP
       (weighted constraint program) is encoded into CP-SAT format.
      
       This can lead to a dramatic speed-up for such problems but is still
       experimental at this point.
       
      optional bool detect_table_with_cost = 216 [default = false];
      Parameters:
      value - The detectTableWithCost to set.
      Returns:
      This builder for chaining.
    • clearDetectTableWithCost

      public SatParameters.Builder clearDetectTableWithCost()
       If true, we detect variable that are unique to a table constraint and only
       there to encode a cost on each tuple. This is usually the case when a WCSP
       (weighted constraint program) is encoded into CP-SAT format.
      
       This can lead to a dramatic speed-up for such problems but is still
       experimental at this point.
       
      optional bool detect_table_with_cost = 216 [default = false];
      Returns:
      This builder for chaining.
    • hasTableCompressionLevel

      public boolean hasTableCompressionLevel()
       How much we try to "compress" a table constraint. Compressing more leads to
       less Booleans and faster propagation but can reduced the quality of the lp
       relaxation. Values goes from 0 to 3 where we always try to fully compress a
       table. At 2, we try to automatically decide if it is worth it.
       
      optional int32 table_compression_level = 217 [default = 2];
      Specified by:
      hasTableCompressionLevel in interface SatParametersOrBuilder
      Returns:
      Whether the tableCompressionLevel field is set.
    • getTableCompressionLevel

      public int getTableCompressionLevel()
       How much we try to "compress" a table constraint. Compressing more leads to
       less Booleans and faster propagation but can reduced the quality of the lp
       relaxation. Values goes from 0 to 3 where we always try to fully compress a
       table. At 2, we try to automatically decide if it is worth it.
       
      optional int32 table_compression_level = 217 [default = 2];
      Specified by:
      getTableCompressionLevel in interface SatParametersOrBuilder
      Returns:
      The tableCompressionLevel.
    • setTableCompressionLevel

      public SatParameters.Builder setTableCompressionLevel(int value)
       How much we try to "compress" a table constraint. Compressing more leads to
       less Booleans and faster propagation but can reduced the quality of the lp
       relaxation. Values goes from 0 to 3 where we always try to fully compress a
       table. At 2, we try to automatically decide if it is worth it.
       
      optional int32 table_compression_level = 217 [default = 2];
      Parameters:
      value - The tableCompressionLevel to set.
      Returns:
      This builder for chaining.
    • clearTableCompressionLevel

      public SatParameters.Builder clearTableCompressionLevel()
       How much we try to "compress" a table constraint. Compressing more leads to
       less Booleans and faster propagation but can reduced the quality of the lp
       relaxation. Values goes from 0 to 3 where we always try to fully compress a
       table. At 2, we try to automatically decide if it is worth it.
       
      optional int32 table_compression_level = 217 [default = 2];
      Returns:
      This builder for chaining.
    • hasExpandAlldiffConstraints

      public boolean hasExpandAlldiffConstraints()
       If true, expand all_different constraints that are not permutations.
       Permutations (#Variables = #Values) are always expanded.
       
      optional bool expand_alldiff_constraints = 170 [default = false];
      Specified by:
      hasExpandAlldiffConstraints in interface SatParametersOrBuilder
      Returns:
      Whether the expandAlldiffConstraints field is set.
    • getExpandAlldiffConstraints

      public boolean getExpandAlldiffConstraints()
       If true, expand all_different constraints that are not permutations.
       Permutations (#Variables = #Values) are always expanded.
       
      optional bool expand_alldiff_constraints = 170 [default = false];
      Specified by:
      getExpandAlldiffConstraints in interface SatParametersOrBuilder
      Returns:
      The expandAlldiffConstraints.
    • setExpandAlldiffConstraints

      public SatParameters.Builder setExpandAlldiffConstraints(boolean value)
       If true, expand all_different constraints that are not permutations.
       Permutations (#Variables = #Values) are always expanded.
       
      optional bool expand_alldiff_constraints = 170 [default = false];
      Parameters:
      value - The expandAlldiffConstraints to set.
      Returns:
      This builder for chaining.
    • clearExpandAlldiffConstraints

      public SatParameters.Builder clearExpandAlldiffConstraints()
       If true, expand all_different constraints that are not permutations.
       Permutations (#Variables = #Values) are always expanded.
       
      optional bool expand_alldiff_constraints = 170 [default = false];
      Returns:
      This builder for chaining.
    • hasMaxAlldiffDomainSize

      public boolean hasMaxAlldiffDomainSize()
       Max domain size for all_different constraints to be expanded.
       
      optional int32 max_alldiff_domain_size = 320 [default = 256];
      Specified by:
      hasMaxAlldiffDomainSize in interface SatParametersOrBuilder
      Returns:
      Whether the maxAlldiffDomainSize field is set.
    • getMaxAlldiffDomainSize

      public int getMaxAlldiffDomainSize()
       Max domain size for all_different constraints to be expanded.
       
      optional int32 max_alldiff_domain_size = 320 [default = 256];
      Specified by:
      getMaxAlldiffDomainSize in interface SatParametersOrBuilder
      Returns:
      The maxAlldiffDomainSize.
    • setMaxAlldiffDomainSize

      public SatParameters.Builder setMaxAlldiffDomainSize(int value)
       Max domain size for all_different constraints to be expanded.
       
      optional int32 max_alldiff_domain_size = 320 [default = 256];
      Parameters:
      value - The maxAlldiffDomainSize to set.
      Returns:
      This builder for chaining.
    • clearMaxAlldiffDomainSize

      public SatParameters.Builder clearMaxAlldiffDomainSize()
       Max domain size for all_different constraints to be expanded.
       
      optional int32 max_alldiff_domain_size = 320 [default = 256];
      Returns:
      This builder for chaining.
    • hasExpandReservoirConstraints

      public boolean hasExpandReservoirConstraints()
       If true, expand the reservoir constraints by creating booleans for all
       possible precedences between event and encoding the constraint.
       
      optional bool expand_reservoir_constraints = 182 [default = true];
      Specified by:
      hasExpandReservoirConstraints in interface SatParametersOrBuilder
      Returns:
      Whether the expandReservoirConstraints field is set.
    • getExpandReservoirConstraints

      public boolean getExpandReservoirConstraints()
       If true, expand the reservoir constraints by creating booleans for all
       possible precedences between event and encoding the constraint.
       
      optional bool expand_reservoir_constraints = 182 [default = true];
      Specified by:
      getExpandReservoirConstraints in interface SatParametersOrBuilder
      Returns:
      The expandReservoirConstraints.
    • setExpandReservoirConstraints

      public SatParameters.Builder setExpandReservoirConstraints(boolean value)
       If true, expand the reservoir constraints by creating booleans for all
       possible precedences between event and encoding the constraint.
       
      optional bool expand_reservoir_constraints = 182 [default = true];
      Parameters:
      value - The expandReservoirConstraints to set.
      Returns:
      This builder for chaining.
    • clearExpandReservoirConstraints

      public SatParameters.Builder clearExpandReservoirConstraints()
       If true, expand the reservoir constraints by creating booleans for all
       possible precedences between event and encoding the constraint.
       
      optional bool expand_reservoir_constraints = 182 [default = true];
      Returns:
      This builder for chaining.
    • hasExpandReservoirUsingCircuit

      public boolean hasExpandReservoirUsingCircuit()
       Mainly useful for testing.
      
       If this and expand_reservoir_constraints is true, we use a different
       encoding of the reservoir constraint using circuit instead of precedences.
       Note that this is usually slower, but can exercise different part of the
       solver. Note that contrary to the precedence encoding, this easily support
       variable demands.
      
       WARNING: with this encoding, the constraint takes a slightly different
       meaning. There must exist a permutation of the events occurring at the same
       time such that the level is within the reservoir after each of these events
       (in this permuted order). So we cannot have +100 and -100 at the same time
       if the level must be between 0 and 10 (as authorized by the reservoir
       constraint).
       
      optional bool expand_reservoir_using_circuit = 288 [default = false];
      Specified by:
      hasExpandReservoirUsingCircuit in interface SatParametersOrBuilder
      Returns:
      Whether the expandReservoirUsingCircuit field is set.
    • getExpandReservoirUsingCircuit

      public boolean getExpandReservoirUsingCircuit()
       Mainly useful for testing.
      
       If this and expand_reservoir_constraints is true, we use a different
       encoding of the reservoir constraint using circuit instead of precedences.
       Note that this is usually slower, but can exercise different part of the
       solver. Note that contrary to the precedence encoding, this easily support
       variable demands.
      
       WARNING: with this encoding, the constraint takes a slightly different
       meaning. There must exist a permutation of the events occurring at the same
       time such that the level is within the reservoir after each of these events
       (in this permuted order). So we cannot have +100 and -100 at the same time
       if the level must be between 0 and 10 (as authorized by the reservoir
       constraint).
       
      optional bool expand_reservoir_using_circuit = 288 [default = false];
      Specified by:
      getExpandReservoirUsingCircuit in interface SatParametersOrBuilder
      Returns:
      The expandReservoirUsingCircuit.
    • setExpandReservoirUsingCircuit

      public SatParameters.Builder setExpandReservoirUsingCircuit(boolean value)
       Mainly useful for testing.
      
       If this and expand_reservoir_constraints is true, we use a different
       encoding of the reservoir constraint using circuit instead of precedences.
       Note that this is usually slower, but can exercise different part of the
       solver. Note that contrary to the precedence encoding, this easily support
       variable demands.
      
       WARNING: with this encoding, the constraint takes a slightly different
       meaning. There must exist a permutation of the events occurring at the same
       time such that the level is within the reservoir after each of these events
       (in this permuted order). So we cannot have +100 and -100 at the same time
       if the level must be between 0 and 10 (as authorized by the reservoir
       constraint).
       
      optional bool expand_reservoir_using_circuit = 288 [default = false];
      Parameters:
      value - The expandReservoirUsingCircuit to set.
      Returns:
      This builder for chaining.
    • clearExpandReservoirUsingCircuit

      public SatParameters.Builder clearExpandReservoirUsingCircuit()
       Mainly useful for testing.
      
       If this and expand_reservoir_constraints is true, we use a different
       encoding of the reservoir constraint using circuit instead of precedences.
       Note that this is usually slower, but can exercise different part of the
       solver. Note that contrary to the precedence encoding, this easily support
       variable demands.
      
       WARNING: with this encoding, the constraint takes a slightly different
       meaning. There must exist a permutation of the events occurring at the same
       time such that the level is within the reservoir after each of these events
       (in this permuted order). So we cannot have +100 and -100 at the same time
       if the level must be between 0 and 10 (as authorized by the reservoir
       constraint).
       
      optional bool expand_reservoir_using_circuit = 288 [default = false];
      Returns:
      This builder for chaining.
    • hasEncodeCumulativeAsReservoir

      public boolean hasEncodeCumulativeAsReservoir()
       Encore cumulative with fixed demands and capacity as a reservoir
       constraint. The only reason you might want to do that is to test the
       reservoir propagation code!
       
      optional bool encode_cumulative_as_reservoir = 287 [default = false];
      Specified by:
      hasEncodeCumulativeAsReservoir in interface SatParametersOrBuilder
      Returns:
      Whether the encodeCumulativeAsReservoir field is set.
    • getEncodeCumulativeAsReservoir

      public boolean getEncodeCumulativeAsReservoir()
       Encore cumulative with fixed demands and capacity as a reservoir
       constraint. The only reason you might want to do that is to test the
       reservoir propagation code!
       
      optional bool encode_cumulative_as_reservoir = 287 [default = false];
      Specified by:
      getEncodeCumulativeAsReservoir in interface SatParametersOrBuilder
      Returns:
      The encodeCumulativeAsReservoir.
    • setEncodeCumulativeAsReservoir

      public SatParameters.Builder setEncodeCumulativeAsReservoir(boolean value)
       Encore cumulative with fixed demands and capacity as a reservoir
       constraint. The only reason you might want to do that is to test the
       reservoir propagation code!
       
      optional bool encode_cumulative_as_reservoir = 287 [default = false];
      Parameters:
      value - The encodeCumulativeAsReservoir to set.
      Returns:
      This builder for chaining.
    • clearEncodeCumulativeAsReservoir

      public SatParameters.Builder clearEncodeCumulativeAsReservoir()
       Encore cumulative with fixed demands and capacity as a reservoir
       constraint. The only reason you might want to do that is to test the
       reservoir propagation code!
       
      optional bool encode_cumulative_as_reservoir = 287 [default = false];
      Returns:
      This builder for chaining.
    • hasMaxLinMaxSizeForExpansion

      public boolean hasMaxLinMaxSizeForExpansion()
       If the number of expressions in the lin_max is less that the max size
       parameter, model expansion replaces target = max(xi) by linear constraint
       with the introduction of new booleans bi such that bi => target == xi.
      
       This is mainly for experimenting compared to a custom lin_max propagator.
       
      optional int32 max_lin_max_size_for_expansion = 280 [default = 0];
      Specified by:
      hasMaxLinMaxSizeForExpansion in interface SatParametersOrBuilder
      Returns:
      Whether the maxLinMaxSizeForExpansion field is set.
    • getMaxLinMaxSizeForExpansion

      public int getMaxLinMaxSizeForExpansion()
       If the number of expressions in the lin_max is less that the max size
       parameter, model expansion replaces target = max(xi) by linear constraint
       with the introduction of new booleans bi such that bi => target == xi.
      
       This is mainly for experimenting compared to a custom lin_max propagator.
       
      optional int32 max_lin_max_size_for_expansion = 280 [default = 0];
      Specified by:
      getMaxLinMaxSizeForExpansion in interface SatParametersOrBuilder
      Returns:
      The maxLinMaxSizeForExpansion.
    • setMaxLinMaxSizeForExpansion

      public SatParameters.Builder setMaxLinMaxSizeForExpansion(int value)
       If the number of expressions in the lin_max is less that the max size
       parameter, model expansion replaces target = max(xi) by linear constraint
       with the introduction of new booleans bi such that bi => target == xi.
      
       This is mainly for experimenting compared to a custom lin_max propagator.
       
      optional int32 max_lin_max_size_for_expansion = 280 [default = 0];
      Parameters:
      value - The maxLinMaxSizeForExpansion to set.
      Returns:
      This builder for chaining.
    • clearMaxLinMaxSizeForExpansion

      public SatParameters.Builder clearMaxLinMaxSizeForExpansion()
       If the number of expressions in the lin_max is less that the max size
       parameter, model expansion replaces target = max(xi) by linear constraint
       with the introduction of new booleans bi such that bi => target == xi.
      
       This is mainly for experimenting compared to a custom lin_max propagator.
       
      optional int32 max_lin_max_size_for_expansion = 280 [default = 0];
      Returns:
      This builder for chaining.
    • hasDisableConstraintExpansion

      public boolean hasDisableConstraintExpansion()
       If true, it disable all constraint expansion.
       This should only be used to test the presolve of expanded constraints.
       
      optional bool disable_constraint_expansion = 181 [default = false];
      Specified by:
      hasDisableConstraintExpansion in interface SatParametersOrBuilder
      Returns:
      Whether the disableConstraintExpansion field is set.
    • getDisableConstraintExpansion

      public boolean getDisableConstraintExpansion()
       If true, it disable all constraint expansion.
       This should only be used to test the presolve of expanded constraints.
       
      optional bool disable_constraint_expansion = 181 [default = false];
      Specified by:
      getDisableConstraintExpansion in interface SatParametersOrBuilder
      Returns:
      The disableConstraintExpansion.
    • setDisableConstraintExpansion

      public SatParameters.Builder setDisableConstraintExpansion(boolean value)
       If true, it disable all constraint expansion.
       This should only be used to test the presolve of expanded constraints.
       
      optional bool disable_constraint_expansion = 181 [default = false];
      Parameters:
      value - The disableConstraintExpansion to set.
      Returns:
      This builder for chaining.
    • clearDisableConstraintExpansion

      public SatParameters.Builder clearDisableConstraintExpansion()
       If true, it disable all constraint expansion.
       This should only be used to test the presolve of expanded constraints.
       
      optional bool disable_constraint_expansion = 181 [default = false];
      Returns:
      This builder for chaining.
    • hasEncodeComplexLinearConstraintWithInteger

      public boolean hasEncodeComplexLinearConstraintWithInteger()
       Linear constraint with a complex right hand side (more than a single
       interval) need to be expanded, there is a couple of way to do that.
       
      optional bool encode_complex_linear_constraint_with_integer = 223 [default = false];
      Specified by:
      hasEncodeComplexLinearConstraintWithInteger in interface SatParametersOrBuilder
      Returns:
      Whether the encodeComplexLinearConstraintWithInteger field is set.
    • getEncodeComplexLinearConstraintWithInteger

      public boolean getEncodeComplexLinearConstraintWithInteger()
       Linear constraint with a complex right hand side (more than a single
       interval) need to be expanded, there is a couple of way to do that.
       
      optional bool encode_complex_linear_constraint_with_integer = 223 [default = false];
      Specified by:
      getEncodeComplexLinearConstraintWithInteger in interface SatParametersOrBuilder
      Returns:
      The encodeComplexLinearConstraintWithInteger.
    • setEncodeComplexLinearConstraintWithInteger

      public SatParameters.Builder setEncodeComplexLinearConstraintWithInteger(boolean value)
       Linear constraint with a complex right hand side (more than a single
       interval) need to be expanded, there is a couple of way to do that.
       
      optional bool encode_complex_linear_constraint_with_integer = 223 [default = false];
      Parameters:
      value - The encodeComplexLinearConstraintWithInteger to set.
      Returns:
      This builder for chaining.
    • clearEncodeComplexLinearConstraintWithInteger

      public SatParameters.Builder clearEncodeComplexLinearConstraintWithInteger()
       Linear constraint with a complex right hand side (more than a single
       interval) need to be expanded, there is a couple of way to do that.
       
      optional bool encode_complex_linear_constraint_with_integer = 223 [default = false];
      Returns:
      This builder for chaining.
    • hasMergeNoOverlapWorkLimit

      public boolean hasMergeNoOverlapWorkLimit()
       During presolve, we use a maximum clique heuristic to merge together
       no-overlap constraints or at most one constraints. This code can be slow,
       so we have a limit in place on the number of explored nodes in the
       underlying graph. The internal limit is an int64, but we use double here to
       simplify manual input.
       
      optional double merge_no_overlap_work_limit = 145 [default = 1000000000000];
      Specified by:
      hasMergeNoOverlapWorkLimit in interface SatParametersOrBuilder
      Returns:
      Whether the mergeNoOverlapWorkLimit field is set.
    • getMergeNoOverlapWorkLimit

      public double getMergeNoOverlapWorkLimit()
       During presolve, we use a maximum clique heuristic to merge together
       no-overlap constraints or at most one constraints. This code can be slow,
       so we have a limit in place on the number of explored nodes in the
       underlying graph. The internal limit is an int64, but we use double here to
       simplify manual input.
       
      optional double merge_no_overlap_work_limit = 145 [default = 1000000000000];
      Specified by:
      getMergeNoOverlapWorkLimit in interface SatParametersOrBuilder
      Returns:
      The mergeNoOverlapWorkLimit.
    • setMergeNoOverlapWorkLimit

      public SatParameters.Builder setMergeNoOverlapWorkLimit(double value)
       During presolve, we use a maximum clique heuristic to merge together
       no-overlap constraints or at most one constraints. This code can be slow,
       so we have a limit in place on the number of explored nodes in the
       underlying graph. The internal limit is an int64, but we use double here to
       simplify manual input.
       
      optional double merge_no_overlap_work_limit = 145 [default = 1000000000000];
      Parameters:
      value - The mergeNoOverlapWorkLimit to set.
      Returns:
      This builder for chaining.
    • clearMergeNoOverlapWorkLimit

      public SatParameters.Builder clearMergeNoOverlapWorkLimit()
       During presolve, we use a maximum clique heuristic to merge together
       no-overlap constraints or at most one constraints. This code can be slow,
       so we have a limit in place on the number of explored nodes in the
       underlying graph. The internal limit is an int64, but we use double here to
       simplify manual input.
       
      optional double merge_no_overlap_work_limit = 145 [default = 1000000000000];
      Returns:
      This builder for chaining.
    • hasMergeAtMostOneWorkLimit

      public boolean hasMergeAtMostOneWorkLimit()
      optional double merge_at_most_one_work_limit = 146 [default = 100000000];
      Specified by:
      hasMergeAtMostOneWorkLimit in interface SatParametersOrBuilder
      Returns:
      Whether the mergeAtMostOneWorkLimit field is set.
    • getMergeAtMostOneWorkLimit

      public double getMergeAtMostOneWorkLimit()
      optional double merge_at_most_one_work_limit = 146 [default = 100000000];
      Specified by:
      getMergeAtMostOneWorkLimit in interface SatParametersOrBuilder
      Returns:
      The mergeAtMostOneWorkLimit.
    • setMergeAtMostOneWorkLimit

      public SatParameters.Builder setMergeAtMostOneWorkLimit(double value)
      optional double merge_at_most_one_work_limit = 146 [default = 100000000];
      Parameters:
      value - The mergeAtMostOneWorkLimit to set.
      Returns:
      This builder for chaining.
    • clearMergeAtMostOneWorkLimit

      public SatParameters.Builder clearMergeAtMostOneWorkLimit()
      optional double merge_at_most_one_work_limit = 146 [default = 100000000];
      Returns:
      This builder for chaining.
    • hasPresolveSubstitutionLevel

      public boolean hasPresolveSubstitutionLevel()
       How much substitution (also called free variable aggregation in MIP
       litterature) should we perform at presolve. This currently only concerns
       variable appearing only in linear constraints. For now the value 0 turns it
       off and any positive value performs substitution.
       
      optional int32 presolve_substitution_level = 147 [default = 1];
      Specified by:
      hasPresolveSubstitutionLevel in interface SatParametersOrBuilder
      Returns:
      Whether the presolveSubstitutionLevel field is set.
    • getPresolveSubstitutionLevel

      public int getPresolveSubstitutionLevel()
       How much substitution (also called free variable aggregation in MIP
       litterature) should we perform at presolve. This currently only concerns
       variable appearing only in linear constraints. For now the value 0 turns it
       off and any positive value performs substitution.
       
      optional int32 presolve_substitution_level = 147 [default = 1];
      Specified by:
      getPresolveSubstitutionLevel in interface SatParametersOrBuilder
      Returns:
      The presolveSubstitutionLevel.
    • setPresolveSubstitutionLevel

      public SatParameters.Builder setPresolveSubstitutionLevel(int value)
       How much substitution (also called free variable aggregation in MIP
       litterature) should we perform at presolve. This currently only concerns
       variable appearing only in linear constraints. For now the value 0 turns it
       off and any positive value performs substitution.
       
      optional int32 presolve_substitution_level = 147 [default = 1];
      Parameters:
      value - The presolveSubstitutionLevel to set.
      Returns:
      This builder for chaining.
    • clearPresolveSubstitutionLevel

      public SatParameters.Builder clearPresolveSubstitutionLevel()
       How much substitution (also called free variable aggregation in MIP
       litterature) should we perform at presolve. This currently only concerns
       variable appearing only in linear constraints. For now the value 0 turns it
       off and any positive value performs substitution.
       
      optional int32 presolve_substitution_level = 147 [default = 1];
      Returns:
      This builder for chaining.
    • hasPresolveExtractIntegerEnforcement

      public boolean hasPresolveExtractIntegerEnforcement()
       If true, we will extract from linear constraints, enforcement literals of
       the form "integer variable at bound => simplified constraint". This should
       always be beneficial except that we don't always handle them as efficiently
       as we could for now. This causes problem on manna81.mps (LP relaxation not
       as tight it seems) and on neos-3354841-apure.mps.gz (too many literals
       created this way).
       
      optional bool presolve_extract_integer_enforcement = 174 [default = false];
      Specified by:
      hasPresolveExtractIntegerEnforcement in interface SatParametersOrBuilder
      Returns:
      Whether the presolveExtractIntegerEnforcement field is set.
    • getPresolveExtractIntegerEnforcement

      public boolean getPresolveExtractIntegerEnforcement()
       If true, we will extract from linear constraints, enforcement literals of
       the form "integer variable at bound => simplified constraint". This should
       always be beneficial except that we don't always handle them as efficiently
       as we could for now. This causes problem on manna81.mps (LP relaxation not
       as tight it seems) and on neos-3354841-apure.mps.gz (too many literals
       created this way).
       
      optional bool presolve_extract_integer_enforcement = 174 [default = false];
      Specified by:
      getPresolveExtractIntegerEnforcement in interface SatParametersOrBuilder
      Returns:
      The presolveExtractIntegerEnforcement.
    • setPresolveExtractIntegerEnforcement

      public SatParameters.Builder setPresolveExtractIntegerEnforcement(boolean value)
       If true, we will extract from linear constraints, enforcement literals of
       the form "integer variable at bound => simplified constraint". This should
       always be beneficial except that we don't always handle them as efficiently
       as we could for now. This causes problem on manna81.mps (LP relaxation not
       as tight it seems) and on neos-3354841-apure.mps.gz (too many literals
       created this way).
       
      optional bool presolve_extract_integer_enforcement = 174 [default = false];
      Parameters:
      value - The presolveExtractIntegerEnforcement to set.
      Returns:
      This builder for chaining.
    • clearPresolveExtractIntegerEnforcement

      public SatParameters.Builder clearPresolveExtractIntegerEnforcement()
       If true, we will extract from linear constraints, enforcement literals of
       the form "integer variable at bound => simplified constraint". This should
       always be beneficial except that we don't always handle them as efficiently
       as we could for now. This causes problem on manna81.mps (LP relaxation not
       as tight it seems) and on neos-3354841-apure.mps.gz (too many literals
       created this way).
       
      optional bool presolve_extract_integer_enforcement = 174 [default = false];
      Returns:
      This builder for chaining.
    • hasPresolveInclusionWorkLimit

      public boolean hasPresolveInclusionWorkLimit()
       A few presolve operations involve detecting constraints included in other
       constraint. Since there can be a quadratic number of such pairs, and
       processing them usually involve scanning them, the complexity of these
       operations can be big. This enforce a local deterministic limit on the
       number of entries scanned. Default is 1e8.
      
       A value of zero will disable these presolve rules completely.
       
      optional int64 presolve_inclusion_work_limit = 201 [default = 100000000];
      Specified by:
      hasPresolveInclusionWorkLimit in interface SatParametersOrBuilder
      Returns:
      Whether the presolveInclusionWorkLimit field is set.
    • getPresolveInclusionWorkLimit

      public long getPresolveInclusionWorkLimit()
       A few presolve operations involve detecting constraints included in other
       constraint. Since there can be a quadratic number of such pairs, and
       processing them usually involve scanning them, the complexity of these
       operations can be big. This enforce a local deterministic limit on the
       number of entries scanned. Default is 1e8.
      
       A value of zero will disable these presolve rules completely.
       
      optional int64 presolve_inclusion_work_limit = 201 [default = 100000000];
      Specified by:
      getPresolveInclusionWorkLimit in interface SatParametersOrBuilder
      Returns:
      The presolveInclusionWorkLimit.
    • setPresolveInclusionWorkLimit

      public SatParameters.Builder setPresolveInclusionWorkLimit(long value)
       A few presolve operations involve detecting constraints included in other
       constraint. Since there can be a quadratic number of such pairs, and
       processing them usually involve scanning them, the complexity of these
       operations can be big. This enforce a local deterministic limit on the
       number of entries scanned. Default is 1e8.
      
       A value of zero will disable these presolve rules completely.
       
      optional int64 presolve_inclusion_work_limit = 201 [default = 100000000];
      Parameters:
      value - The presolveInclusionWorkLimit to set.
      Returns:
      This builder for chaining.
    • clearPresolveInclusionWorkLimit

      public SatParameters.Builder clearPresolveInclusionWorkLimit()
       A few presolve operations involve detecting constraints included in other
       constraint. Since there can be a quadratic number of such pairs, and
       processing them usually involve scanning them, the complexity of these
       operations can be big. This enforce a local deterministic limit on the
       number of entries scanned. Default is 1e8.
      
       A value of zero will disable these presolve rules completely.
       
      optional int64 presolve_inclusion_work_limit = 201 [default = 100000000];
      Returns:
      This builder for chaining.
    • hasIgnoreNames

      public boolean hasIgnoreNames()
       If true, we don't keep names in our internal copy of the user given model.
       
      optional bool ignore_names = 202 [default = true];
      Specified by:
      hasIgnoreNames in interface SatParametersOrBuilder
      Returns:
      Whether the ignoreNames field is set.
    • getIgnoreNames

      public boolean getIgnoreNames()
       If true, we don't keep names in our internal copy of the user given model.
       
      optional bool ignore_names = 202 [default = true];
      Specified by:
      getIgnoreNames in interface SatParametersOrBuilder
      Returns:
      The ignoreNames.
    • setIgnoreNames

      public SatParameters.Builder setIgnoreNames(boolean value)
       If true, we don't keep names in our internal copy of the user given model.
       
      optional bool ignore_names = 202 [default = true];
      Parameters:
      value - The ignoreNames to set.
      Returns:
      This builder for chaining.
    • clearIgnoreNames

      public SatParameters.Builder clearIgnoreNames()
       If true, we don't keep names in our internal copy of the user given model.
       
      optional bool ignore_names = 202 [default = true];
      Returns:
      This builder for chaining.
    • hasInferAllDiffs

      public boolean hasInferAllDiffs()
       Run a max-clique code amongst all the x != y we can find and try to infer
       set of variables that are all different. This allows to close neos16.mps
       for instance. Note that we only run this code if there is no all_diff
       already in the model so that if a user want to add some all_diff, we assume
       it is well done and do not try to add more.
      
       This will also detect and add no_overlap constraints, if all the relations
       x != y have "offsets" between them. I.e. x > y + offset.
       
      optional bool infer_all_diffs = 233 [default = true];
      Specified by:
      hasInferAllDiffs in interface SatParametersOrBuilder
      Returns:
      Whether the inferAllDiffs field is set.
    • getInferAllDiffs

      public boolean getInferAllDiffs()
       Run a max-clique code amongst all the x != y we can find and try to infer
       set of variables that are all different. This allows to close neos16.mps
       for instance. Note that we only run this code if there is no all_diff
       already in the model so that if a user want to add some all_diff, we assume
       it is well done and do not try to add more.
      
       This will also detect and add no_overlap constraints, if all the relations
       x != y have "offsets" between them. I.e. x > y + offset.
       
      optional bool infer_all_diffs = 233 [default = true];
      Specified by:
      getInferAllDiffs in interface SatParametersOrBuilder
      Returns:
      The inferAllDiffs.
    • setInferAllDiffs

      public SatParameters.Builder setInferAllDiffs(boolean value)
       Run a max-clique code amongst all the x != y we can find and try to infer
       set of variables that are all different. This allows to close neos16.mps
       for instance. Note that we only run this code if there is no all_diff
       already in the model so that if a user want to add some all_diff, we assume
       it is well done and do not try to add more.
      
       This will also detect and add no_overlap constraints, if all the relations
       x != y have "offsets" between them. I.e. x > y + offset.
       
      optional bool infer_all_diffs = 233 [default = true];
      Parameters:
      value - The inferAllDiffs to set.
      Returns:
      This builder for chaining.
    • clearInferAllDiffs

      public SatParameters.Builder clearInferAllDiffs()
       Run a max-clique code amongst all the x != y we can find and try to infer
       set of variables that are all different. This allows to close neos16.mps
       for instance. Note that we only run this code if there is no all_diff
       already in the model so that if a user want to add some all_diff, we assume
       it is well done and do not try to add more.
      
       This will also detect and add no_overlap constraints, if all the relations
       x != y have "offsets" between them. I.e. x > y + offset.
       
      optional bool infer_all_diffs = 233 [default = true];
      Returns:
      This builder for chaining.
    • hasFindBigLinearOverlap

      public boolean hasFindBigLinearOverlap()
       Try to find large "rectangle" in the linear constraint matrix with
       identical lines. If such rectangle is big enough, we can introduce a new
       integer variable corresponding to the common expression and greatly reduce
       the number of non-zero.
       
      optional bool find_big_linear_overlap = 234 [default = true];
      Specified by:
      hasFindBigLinearOverlap in interface SatParametersOrBuilder
      Returns:
      Whether the findBigLinearOverlap field is set.
    • getFindBigLinearOverlap

      public boolean getFindBigLinearOverlap()
       Try to find large "rectangle" in the linear constraint matrix with
       identical lines. If such rectangle is big enough, we can introduce a new
       integer variable corresponding to the common expression and greatly reduce
       the number of non-zero.
       
      optional bool find_big_linear_overlap = 234 [default = true];
      Specified by:
      getFindBigLinearOverlap in interface SatParametersOrBuilder
      Returns:
      The findBigLinearOverlap.
    • setFindBigLinearOverlap

      public SatParameters.Builder setFindBigLinearOverlap(boolean value)
       Try to find large "rectangle" in the linear constraint matrix with
       identical lines. If such rectangle is big enough, we can introduce a new
       integer variable corresponding to the common expression and greatly reduce
       the number of non-zero.
       
      optional bool find_big_linear_overlap = 234 [default = true];
      Parameters:
      value - The findBigLinearOverlap to set.
      Returns:
      This builder for chaining.
    • clearFindBigLinearOverlap

      public SatParameters.Builder clearFindBigLinearOverlap()
       Try to find large "rectangle" in the linear constraint matrix with
       identical lines. If such rectangle is big enough, we can introduce a new
       integer variable corresponding to the common expression and greatly reduce
       the number of non-zero.
       
      optional bool find_big_linear_overlap = 234 [default = true];
      Returns:
      This builder for chaining.
    • hasUseSatInprocessing

      public boolean hasUseSatInprocessing()
       Enable or disable "inprocessing" which is some SAT presolving done at
       each restart to the root level.
       
      optional bool use_sat_inprocessing = 163 [default = true];
      Specified by:
      hasUseSatInprocessing in interface SatParametersOrBuilder
      Returns:
      Whether the useSatInprocessing field is set.
    • getUseSatInprocessing

      public boolean getUseSatInprocessing()
       Enable or disable "inprocessing" which is some SAT presolving done at
       each restart to the root level.
       
      optional bool use_sat_inprocessing = 163 [default = true];
      Specified by:
      getUseSatInprocessing in interface SatParametersOrBuilder
      Returns:
      The useSatInprocessing.
    • setUseSatInprocessing

      public SatParameters.Builder setUseSatInprocessing(boolean value)
       Enable or disable "inprocessing" which is some SAT presolving done at
       each restart to the root level.
       
      optional bool use_sat_inprocessing = 163 [default = true];
      Parameters:
      value - The useSatInprocessing to set.
      Returns:
      This builder for chaining.
    • clearUseSatInprocessing

      public SatParameters.Builder clearUseSatInprocessing()
       Enable or disable "inprocessing" which is some SAT presolving done at
       each restart to the root level.
       
      optional bool use_sat_inprocessing = 163 [default = true];
      Returns:
      This builder for chaining.
    • hasInprocessingDtimeRatio

      public boolean hasInprocessingDtimeRatio()
       Proportion of deterministic time we should spend on inprocessing.
       At each "restart", if the proportion is below this ratio, we will do some
       inprocessing, otherwise, we skip it for this restart.
       
      optional double inprocessing_dtime_ratio = 273 [default = 0.2];
      Specified by:
      hasInprocessingDtimeRatio in interface SatParametersOrBuilder
      Returns:
      Whether the inprocessingDtimeRatio field is set.
    • getInprocessingDtimeRatio

      public double getInprocessingDtimeRatio()
       Proportion of deterministic time we should spend on inprocessing.
       At each "restart", if the proportion is below this ratio, we will do some
       inprocessing, otherwise, we skip it for this restart.
       
      optional double inprocessing_dtime_ratio = 273 [default = 0.2];
      Specified by:
      getInprocessingDtimeRatio in interface SatParametersOrBuilder
      Returns:
      The inprocessingDtimeRatio.
    • setInprocessingDtimeRatio

      public SatParameters.Builder setInprocessingDtimeRatio(double value)
       Proportion of deterministic time we should spend on inprocessing.
       At each "restart", if the proportion is below this ratio, we will do some
       inprocessing, otherwise, we skip it for this restart.
       
      optional double inprocessing_dtime_ratio = 273 [default = 0.2];
      Parameters:
      value - The inprocessingDtimeRatio to set.
      Returns:
      This builder for chaining.
    • clearInprocessingDtimeRatio

      public SatParameters.Builder clearInprocessingDtimeRatio()
       Proportion of deterministic time we should spend on inprocessing.
       At each "restart", if the proportion is below this ratio, we will do some
       inprocessing, otherwise, we skip it for this restart.
       
      optional double inprocessing_dtime_ratio = 273 [default = 0.2];
      Returns:
      This builder for chaining.
    • hasInprocessingProbingDtime

      public boolean hasInprocessingProbingDtime()
       The amount of dtime we should spend on probing for each inprocessing round.
       
      optional double inprocessing_probing_dtime = 274 [default = 1];
      Specified by:
      hasInprocessingProbingDtime in interface SatParametersOrBuilder
      Returns:
      Whether the inprocessingProbingDtime field is set.
    • getInprocessingProbingDtime

      public double getInprocessingProbingDtime()
       The amount of dtime we should spend on probing for each inprocessing round.
       
      optional double inprocessing_probing_dtime = 274 [default = 1];
      Specified by:
      getInprocessingProbingDtime in interface SatParametersOrBuilder
      Returns:
      The inprocessingProbingDtime.
    • setInprocessingProbingDtime

      public SatParameters.Builder setInprocessingProbingDtime(double value)
       The amount of dtime we should spend on probing for each inprocessing round.
       
      optional double inprocessing_probing_dtime = 274 [default = 1];
      Parameters:
      value - The inprocessingProbingDtime to set.
      Returns:
      This builder for chaining.
    • clearInprocessingProbingDtime

      public SatParameters.Builder clearInprocessingProbingDtime()
       The amount of dtime we should spend on probing for each inprocessing round.
       
      optional double inprocessing_probing_dtime = 274 [default = 1];
      Returns:
      This builder for chaining.
    • hasInprocessingMinimizationDtime

      public boolean hasInprocessingMinimizationDtime()
       Parameters for an heuristic similar to the one described in "An effective
       learnt clause minimization approach for CDCL Sat Solvers",
       https://www.ijcai.org/proceedings/2017/0098.pdf
      
       This is the amount of dtime we should spend on this technique during each
       inprocessing phase.
      
       The minimization technique is the same as the one used to minimize core in
       max-sat. We also minimize problem clauses and not just the learned clause
       that we keep forever like in the paper.
       
      optional double inprocessing_minimization_dtime = 275 [default = 1];
      Specified by:
      hasInprocessingMinimizationDtime in interface SatParametersOrBuilder
      Returns:
      Whether the inprocessingMinimizationDtime field is set.
    • getInprocessingMinimizationDtime

      public double getInprocessingMinimizationDtime()
       Parameters for an heuristic similar to the one described in "An effective
       learnt clause minimization approach for CDCL Sat Solvers",
       https://www.ijcai.org/proceedings/2017/0098.pdf
      
       This is the amount of dtime we should spend on this technique during each
       inprocessing phase.
      
       The minimization technique is the same as the one used to minimize core in
       max-sat. We also minimize problem clauses and not just the learned clause
       that we keep forever like in the paper.
       
      optional double inprocessing_minimization_dtime = 275 [default = 1];
      Specified by:
      getInprocessingMinimizationDtime in interface SatParametersOrBuilder
      Returns:
      The inprocessingMinimizationDtime.
    • setInprocessingMinimizationDtime

      public SatParameters.Builder setInprocessingMinimizationDtime(double value)
       Parameters for an heuristic similar to the one described in "An effective
       learnt clause minimization approach for CDCL Sat Solvers",
       https://www.ijcai.org/proceedings/2017/0098.pdf
      
       This is the amount of dtime we should spend on this technique during each
       inprocessing phase.
      
       The minimization technique is the same as the one used to minimize core in
       max-sat. We also minimize problem clauses and not just the learned clause
       that we keep forever like in the paper.
       
      optional double inprocessing_minimization_dtime = 275 [default = 1];
      Parameters:
      value - The inprocessingMinimizationDtime to set.
      Returns:
      This builder for chaining.
    • clearInprocessingMinimizationDtime

      public SatParameters.Builder clearInprocessingMinimizationDtime()
       Parameters for an heuristic similar to the one described in "An effective
       learnt clause minimization approach for CDCL Sat Solvers",
       https://www.ijcai.org/proceedings/2017/0098.pdf
      
       This is the amount of dtime we should spend on this technique during each
       inprocessing phase.
      
       The minimization technique is the same as the one used to minimize core in
       max-sat. We also minimize problem clauses and not just the learned clause
       that we keep forever like in the paper.
       
      optional double inprocessing_minimization_dtime = 275 [default = 1];
      Returns:
      This builder for chaining.
    • hasInprocessingMinimizationUseConflictAnalysis

      public boolean hasInprocessingMinimizationUseConflictAnalysis()
      optional bool inprocessing_minimization_use_conflict_analysis = 297 [default = true];
      Specified by:
      hasInprocessingMinimizationUseConflictAnalysis in interface SatParametersOrBuilder
      Returns:
      Whether the inprocessingMinimizationUseConflictAnalysis field is set.
    • getInprocessingMinimizationUseConflictAnalysis

      public boolean getInprocessingMinimizationUseConflictAnalysis()
      optional bool inprocessing_minimization_use_conflict_analysis = 297 [default = true];
      Specified by:
      getInprocessingMinimizationUseConflictAnalysis in interface SatParametersOrBuilder
      Returns:
      The inprocessingMinimizationUseConflictAnalysis.
    • setInprocessingMinimizationUseConflictAnalysis

      public SatParameters.Builder setInprocessingMinimizationUseConflictAnalysis(boolean value)
      optional bool inprocessing_minimization_use_conflict_analysis = 297 [default = true];
      Parameters:
      value - The inprocessingMinimizationUseConflictAnalysis to set.
      Returns:
      This builder for chaining.
    • clearInprocessingMinimizationUseConflictAnalysis

      public SatParameters.Builder clearInprocessingMinimizationUseConflictAnalysis()
      optional bool inprocessing_minimization_use_conflict_analysis = 297 [default = true];
      Returns:
      This builder for chaining.
    • hasInprocessingMinimizationUseAllOrderings

      public boolean hasInprocessingMinimizationUseAllOrderings()
      optional bool inprocessing_minimization_use_all_orderings = 298 [default = false];
      Specified by:
      hasInprocessingMinimizationUseAllOrderings in interface SatParametersOrBuilder
      Returns:
      Whether the inprocessingMinimizationUseAllOrderings field is set.
    • getInprocessingMinimizationUseAllOrderings

      public boolean getInprocessingMinimizationUseAllOrderings()
      optional bool inprocessing_minimization_use_all_orderings = 298 [default = false];
      Specified by:
      getInprocessingMinimizationUseAllOrderings in interface SatParametersOrBuilder
      Returns:
      The inprocessingMinimizationUseAllOrderings.
    • setInprocessingMinimizationUseAllOrderings

      public SatParameters.Builder setInprocessingMinimizationUseAllOrderings(boolean value)
      optional bool inprocessing_minimization_use_all_orderings = 298 [default = false];
      Parameters:
      value - The inprocessingMinimizationUseAllOrderings to set.
      Returns:
      This builder for chaining.
    • clearInprocessingMinimizationUseAllOrderings

      public SatParameters.Builder clearInprocessingMinimizationUseAllOrderings()
      optional bool inprocessing_minimization_use_all_orderings = 298 [default = false];
      Returns:
      This builder for chaining.
    • hasNumWorkers

      public boolean hasNumWorkers()
       Specify the number of parallel workers (i.e. threads) to use during search.
       This should usually be lower than your number of available cpus +
       hyperthread in your machine.
      
       A value of 0 means the solver will try to use all cores on the machine.
       A number of 1 means no parallelism.
      
       Note that 'num_workers' is the preferred name, but if it is set to zero,
       we will still read the deprecated 'num_search_workers'.
      
       As of 2020-04-10, if you're using SAT via MPSolver (to solve integer
       programs) this field is overridden with a value of 8, if the field is not
       set *explicitly*. Thus, always set this field explicitly or via
       MPSolver::SetNumThreads().
       
      optional int32 num_workers = 206 [default = 0];
      Specified by:
      hasNumWorkers in interface SatParametersOrBuilder
      Returns:
      Whether the numWorkers field is set.
    • getNumWorkers

      public int getNumWorkers()
       Specify the number of parallel workers (i.e. threads) to use during search.
       This should usually be lower than your number of available cpus +
       hyperthread in your machine.
      
       A value of 0 means the solver will try to use all cores on the machine.
       A number of 1 means no parallelism.
      
       Note that 'num_workers' is the preferred name, but if it is set to zero,
       we will still read the deprecated 'num_search_workers'.
      
       As of 2020-04-10, if you're using SAT via MPSolver (to solve integer
       programs) this field is overridden with a value of 8, if the field is not
       set *explicitly*. Thus, always set this field explicitly or via
       MPSolver::SetNumThreads().
       
      optional int32 num_workers = 206 [default = 0];
      Specified by:
      getNumWorkers in interface SatParametersOrBuilder
      Returns:
      The numWorkers.
    • setNumWorkers

      public SatParameters.Builder setNumWorkers(int value)
       Specify the number of parallel workers (i.e. threads) to use during search.
       This should usually be lower than your number of available cpus +
       hyperthread in your machine.
      
       A value of 0 means the solver will try to use all cores on the machine.
       A number of 1 means no parallelism.
      
       Note that 'num_workers' is the preferred name, but if it is set to zero,
       we will still read the deprecated 'num_search_workers'.
      
       As of 2020-04-10, if you're using SAT via MPSolver (to solve integer
       programs) this field is overridden with a value of 8, if the field is not
       set *explicitly*. Thus, always set this field explicitly or via
       MPSolver::SetNumThreads().
       
      optional int32 num_workers = 206 [default = 0];
      Parameters:
      value - The numWorkers to set.
      Returns:
      This builder for chaining.
    • clearNumWorkers

      public SatParameters.Builder clearNumWorkers()
       Specify the number of parallel workers (i.e. threads) to use during search.
       This should usually be lower than your number of available cpus +
       hyperthread in your machine.
      
       A value of 0 means the solver will try to use all cores on the machine.
       A number of 1 means no parallelism.
      
       Note that 'num_workers' is the preferred name, but if it is set to zero,
       we will still read the deprecated 'num_search_workers'.
      
       As of 2020-04-10, if you're using SAT via MPSolver (to solve integer
       programs) this field is overridden with a value of 8, if the field is not
       set *explicitly*. Thus, always set this field explicitly or via
       MPSolver::SetNumThreads().
       
      optional int32 num_workers = 206 [default = 0];
      Returns:
      This builder for chaining.
    • hasNumSearchWorkers

      public boolean hasNumSearchWorkers()
      optional int32 num_search_workers = 100 [default = 0];
      Specified by:
      hasNumSearchWorkers in interface SatParametersOrBuilder
      Returns:
      Whether the numSearchWorkers field is set.
    • getNumSearchWorkers

      public int getNumSearchWorkers()
      optional int32 num_search_workers = 100 [default = 0];
      Specified by:
      getNumSearchWorkers in interface SatParametersOrBuilder
      Returns:
      The numSearchWorkers.
    • setNumSearchWorkers

      public SatParameters.Builder setNumSearchWorkers(int value)
      optional int32 num_search_workers = 100 [default = 0];
      Parameters:
      value - The numSearchWorkers to set.
      Returns:
      This builder for chaining.
    • clearNumSearchWorkers

      public SatParameters.Builder clearNumSearchWorkers()
      optional int32 num_search_workers = 100 [default = 0];
      Returns:
      This builder for chaining.
    • hasNumFullSubsolvers

      public boolean hasNumFullSubsolvers()
       We distinguish subsolvers that consume a full thread, and the ones that are
       always interleaved. If left at zero, we will fix this with a default
       formula that depends on num_workers. But if you start modifying what runs,
       you might want to fix that to a given value depending on the num_workers
       you use.
       
      optional int32 num_full_subsolvers = 294 [default = 0];
      Specified by:
      hasNumFullSubsolvers in interface SatParametersOrBuilder
      Returns:
      Whether the numFullSubsolvers field is set.
    • getNumFullSubsolvers

      public int getNumFullSubsolvers()
       We distinguish subsolvers that consume a full thread, and the ones that are
       always interleaved. If left at zero, we will fix this with a default
       formula that depends on num_workers. But if you start modifying what runs,
       you might want to fix that to a given value depending on the num_workers
       you use.
       
      optional int32 num_full_subsolvers = 294 [default = 0];
      Specified by:
      getNumFullSubsolvers in interface SatParametersOrBuilder
      Returns:
      The numFullSubsolvers.
    • setNumFullSubsolvers

      public SatParameters.Builder setNumFullSubsolvers(int value)
       We distinguish subsolvers that consume a full thread, and the ones that are
       always interleaved. If left at zero, we will fix this with a default
       formula that depends on num_workers. But if you start modifying what runs,
       you might want to fix that to a given value depending on the num_workers
       you use.
       
      optional int32 num_full_subsolvers = 294 [default = 0];
      Parameters:
      value - The numFullSubsolvers to set.
      Returns:
      This builder for chaining.
    • clearNumFullSubsolvers

      public SatParameters.Builder clearNumFullSubsolvers()
       We distinguish subsolvers that consume a full thread, and the ones that are
       always interleaved. If left at zero, we will fix this with a default
       formula that depends on num_workers. But if you start modifying what runs,
       you might want to fix that to a given value depending on the num_workers
       you use.
       
      optional int32 num_full_subsolvers = 294 [default = 0];
      Returns:
      This builder for chaining.
    • getSubsolversList

      public com.google.protobuf.ProtocolStringList getSubsolversList()
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Specified by:
      getSubsolversList in interface SatParametersOrBuilder
      Returns:
      A list containing the subsolvers.
    • getSubsolversCount

      public int getSubsolversCount()
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Specified by:
      getSubsolversCount in interface SatParametersOrBuilder
      Returns:
      The count of subsolvers.
    • getSubsolvers

      public String getSubsolvers(int index)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Specified by:
      getSubsolvers in interface SatParametersOrBuilder
      Parameters:
      index - The index of the element to return.
      Returns:
      The subsolvers at the given index.
    • getSubsolversBytes

      public com.google.protobuf.ByteString getSubsolversBytes(int index)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Specified by:
      getSubsolversBytes in interface SatParametersOrBuilder
      Parameters:
      index - The index of the value to return.
      Returns:
      The bytes of the subsolvers at the given index.
    • setSubsolvers

      public SatParameters.Builder setSubsolvers(int index, String value)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Parameters:
      index - The index to set the value at.
      value - The subsolvers to set.
      Returns:
      This builder for chaining.
    • addSubsolvers

      public SatParameters.Builder addSubsolvers(String value)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Parameters:
      value - The subsolvers to add.
      Returns:
      This builder for chaining.
    • addAllSubsolvers

      public SatParameters.Builder addAllSubsolvers(Iterable<String> values)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Parameters:
      values - The subsolvers to add.
      Returns:
      This builder for chaining.
    • clearSubsolvers

      public SatParameters.Builder clearSubsolvers()
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Returns:
      This builder for chaining.
    • addSubsolversBytes

      public SatParameters.Builder addSubsolversBytes(com.google.protobuf.ByteString value)
       In multi-thread, the solver can be mainly seen as a portfolio of solvers
       with different parameters. This field indicates the names of the parameters
       that are used in multithread. This only applies to "full" subsolvers.
      
       See cp_model_search.cc to see a list of the names and the default value (if
       left empty) that looks like:
       - default_lp           (linearization_level:1)
       - fixed                (only if fixed search specified or scheduling)
       - no_lp                (linearization_level:0)
       - max_lp               (linearization_level:2)
       - pseudo_costs         (only if objective, change search heuristic)
       - reduced_costs        (only if objective, change search heuristic)
       - quick_restart        (kind of probing)
       - quick_restart_no_lp  (kind of probing with linearization_level:0)
       - lb_tree_search       (to improve lower bound, MIP like tree search)
       - probing              (continuous probing and shaving)
      
       Also, note that some set of parameters will be ignored if they do not make
       sense. For instance if there is no objective, pseudo_cost or reduced_cost
       search will be ignored. Core based search will only work if the objective
       has many terms. If there is no fixed strategy fixed will be ignored. And so
       on.
      
       The order is important, as only the first num_full_subsolvers will be
       scheduled. You can see in the log which one are selected for a given run.
       
      repeated string subsolvers = 207;
      Parameters:
      value - The bytes of the subsolvers to add.
      Returns:
      This builder for chaining.
    • getExtraSubsolversList

      public com.google.protobuf.ProtocolStringList getExtraSubsolversList()
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Specified by:
      getExtraSubsolversList in interface SatParametersOrBuilder
      Returns:
      A list containing the extraSubsolvers.
    • getExtraSubsolversCount

      public int getExtraSubsolversCount()
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Specified by:
      getExtraSubsolversCount in interface SatParametersOrBuilder
      Returns:
      The count of extraSubsolvers.
    • getExtraSubsolvers

      public String getExtraSubsolvers(int index)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Specified by:
      getExtraSubsolvers in interface SatParametersOrBuilder
      Parameters:
      index - The index of the element to return.
      Returns:
      The extraSubsolvers at the given index.
    • getExtraSubsolversBytes

      public com.google.protobuf.ByteString getExtraSubsolversBytes(int index)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Specified by:
      getExtraSubsolversBytes in interface SatParametersOrBuilder
      Parameters:
      index - The index of the value to return.
      Returns:
      The bytes of the extraSubsolvers at the given index.
    • setExtraSubsolvers

      public SatParameters.Builder setExtraSubsolvers(int index, String value)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Parameters:
      index - The index to set the value at.
      value - The extraSubsolvers to set.
      Returns:
      This builder for chaining.
    • addExtraSubsolvers

      public SatParameters.Builder addExtraSubsolvers(String value)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Parameters:
      value - The extraSubsolvers to add.
      Returns:
      This builder for chaining.
    • addAllExtraSubsolvers

      public SatParameters.Builder addAllExtraSubsolvers(Iterable<String> values)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Parameters:
      values - The extraSubsolvers to add.
      Returns:
      This builder for chaining.
    • clearExtraSubsolvers

      public SatParameters.Builder clearExtraSubsolvers()
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Returns:
      This builder for chaining.
    • addExtraSubsolversBytes

      public SatParameters.Builder addExtraSubsolversBytes(com.google.protobuf.ByteString value)
       A convenient way to add more workers types.
       These will be added at the beginning of the list.
       
      repeated string extra_subsolvers = 219;
      Parameters:
      value - The bytes of the extraSubsolvers to add.
      Returns:
      This builder for chaining.
    • getIgnoreSubsolversList

      public com.google.protobuf.ProtocolStringList getIgnoreSubsolversList()
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Specified by:
      getIgnoreSubsolversList in interface SatParametersOrBuilder
      Returns:
      A list containing the ignoreSubsolvers.
    • getIgnoreSubsolversCount

      public int getIgnoreSubsolversCount()
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Specified by:
      getIgnoreSubsolversCount in interface SatParametersOrBuilder
      Returns:
      The count of ignoreSubsolvers.
    • getIgnoreSubsolvers

      public String getIgnoreSubsolvers(int index)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Specified by:
      getIgnoreSubsolvers in interface SatParametersOrBuilder
      Parameters:
      index - The index of the element to return.
      Returns:
      The ignoreSubsolvers at the given index.
    • getIgnoreSubsolversBytes

      public com.google.protobuf.ByteString getIgnoreSubsolversBytes(int index)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Specified by:
      getIgnoreSubsolversBytes in interface SatParametersOrBuilder
      Parameters:
      index - The index of the value to return.
      Returns:
      The bytes of the ignoreSubsolvers at the given index.
    • setIgnoreSubsolvers

      public SatParameters.Builder setIgnoreSubsolvers(int index, String value)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Parameters:
      index - The index to set the value at.
      value - The ignoreSubsolvers to set.
      Returns:
      This builder for chaining.
    • addIgnoreSubsolvers

      public SatParameters.Builder addIgnoreSubsolvers(String value)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Parameters:
      value - The ignoreSubsolvers to add.
      Returns:
      This builder for chaining.
    • addAllIgnoreSubsolvers

      public SatParameters.Builder addAllIgnoreSubsolvers(Iterable<String> values)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Parameters:
      values - The ignoreSubsolvers to add.
      Returns:
      This builder for chaining.
    • clearIgnoreSubsolvers

      public SatParameters.Builder clearIgnoreSubsolvers()
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Returns:
      This builder for chaining.
    • addIgnoreSubsolversBytes

      public SatParameters.Builder addIgnoreSubsolversBytes(com.google.protobuf.ByteString value)
       Rather than fully specifying subsolvers, it is often convenient to just
       remove the ones that are not useful on a given problem or only keep
       specific ones for testing. Each string is interpreted as a "glob", so we
       support '*' and '?'.
      
       The way this work is that we will only accept a name that match a filter
       pattern (if non-empty) and do not match an ignore pattern. Note also that
       these fields work on LNS or LS names even if these are currently not
       specified via the subsolvers field.
       
      repeated string ignore_subsolvers = 209;
      Parameters:
      value - The bytes of the ignoreSubsolvers to add.
      Returns:
      This builder for chaining.
    • getFilterSubsolversList

      public com.google.protobuf.ProtocolStringList getFilterSubsolversList()
      repeated string filter_subsolvers = 293;
      Specified by:
      getFilterSubsolversList in interface SatParametersOrBuilder
      Returns:
      A list containing the filterSubsolvers.
    • getFilterSubsolversCount

      public int getFilterSubsolversCount()
      repeated string filter_subsolvers = 293;
      Specified by:
      getFilterSubsolversCount in interface SatParametersOrBuilder
      Returns:
      The count of filterSubsolvers.
    • getFilterSubsolvers

      public String getFilterSubsolvers(int index)
      repeated string filter_subsolvers = 293;
      Specified by:
      getFilterSubsolvers in interface SatParametersOrBuilder
      Parameters:
      index - The index of the element to return.
      Returns:
      The filterSubsolvers at the given index.
    • getFilterSubsolversBytes

      public com.google.protobuf.ByteString getFilterSubsolversBytes(int index)
      repeated string filter_subsolvers = 293;
      Specified by:
      getFilterSubsolversBytes in interface SatParametersOrBuilder
      Parameters:
      index - The index of the value to return.
      Returns:
      The bytes of the filterSubsolvers at the given index.
    • setFilterSubsolvers

      public SatParameters.Builder setFilterSubsolvers(int index, String value)
      repeated string filter_subsolvers = 293;
      Parameters:
      index - The index to set the value at.
      value - The filterSubsolvers to set.
      Returns:
      This builder for chaining.
    • addFilterSubsolvers

      public SatParameters.Builder addFilterSubsolvers(String value)
      repeated string filter_subsolvers = 293;
      Parameters:
      value - The filterSubsolvers to add.
      Returns:
      This builder for chaining.
    • addAllFilterSubsolvers

      public SatParameters.Builder addAllFilterSubsolvers(Iterable<String> values)
      repeated string filter_subsolvers = 293;
      Parameters:
      values - The filterSubsolvers to add.
      Returns:
      This builder for chaining.
    • clearFilterSubsolvers

      public SatParameters.Builder clearFilterSubsolvers()
      repeated string filter_subsolvers = 293;
      Returns:
      This builder for chaining.
    • addFilterSubsolversBytes

      public SatParameters.Builder addFilterSubsolversBytes(com.google.protobuf.ByteString value)
      repeated string filter_subsolvers = 293;
      Parameters:
      value - The bytes of the filterSubsolvers to add.
      Returns:
      This builder for chaining.
    • getSubsolverParamsList

      public List<SatParameters> getSubsolverParamsList()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
      Specified by:
      getSubsolverParamsList in interface SatParametersOrBuilder
    • getSubsolverParamsCount

      public int getSubsolverParamsCount()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
      Specified by:
      getSubsolverParamsCount in interface SatParametersOrBuilder
    • getSubsolverParams

      public SatParameters getSubsolverParams(int index)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
      Specified by:
      getSubsolverParams in interface SatParametersOrBuilder
    • setSubsolverParams

      public SatParameters.Builder setSubsolverParams(int index, SatParameters value)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • setSubsolverParams

      public SatParameters.Builder setSubsolverParams(int index, SatParameters.Builder builderForValue)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addSubsolverParams

      public SatParameters.Builder addSubsolverParams(SatParameters value)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addSubsolverParams

      public SatParameters.Builder addSubsolverParams(int index, SatParameters value)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addSubsolverParams

      public SatParameters.Builder addSubsolverParams(SatParameters.Builder builderForValue)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addSubsolverParams

      public SatParameters.Builder addSubsolverParams(int index, SatParameters.Builder builderForValue)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addAllSubsolverParams

      public SatParameters.Builder addAllSubsolverParams(Iterable<? extends SatParameters> values)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • clearSubsolverParams

      public SatParameters.Builder clearSubsolverParams()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • removeSubsolverParams

      public SatParameters.Builder removeSubsolverParams(int index)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • getSubsolverParamsBuilder

      public SatParameters.Builder getSubsolverParamsBuilder(int index)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • getSubsolverParamsOrBuilder

      public SatParametersOrBuilder getSubsolverParamsOrBuilder(int index)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
      Specified by:
      getSubsolverParamsOrBuilder in interface SatParametersOrBuilder
    • getSubsolverParamsOrBuilderList

      public List<? extends SatParametersOrBuilder> getSubsolverParamsOrBuilderList()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
      Specified by:
      getSubsolverParamsOrBuilderList in interface SatParametersOrBuilder
    • addSubsolverParamsBuilder

      public SatParameters.Builder addSubsolverParamsBuilder()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • addSubsolverParamsBuilder

      public SatParameters.Builder addSubsolverParamsBuilder(int index)
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • getSubsolverParamsBuilderList

      public List<SatParameters.Builder> getSubsolverParamsBuilderList()
       It is possible to specify additional subsolver configuration. These can be
       referred by their params.name() in the fields above. Note that only the
       specified field will "overwrite" the ones of the base parameter. If a
       subsolver_params has the name of an existing subsolver configuration, the
       named parameters will be merged into the subsolver configuration.
       
      repeated .operations_research.sat.SatParameters subsolver_params = 210;
    • hasInterleaveSearch

      public boolean hasInterleaveSearch()
       Experimental. If this is true, then we interleave all our major search
       strategy and distribute the work amongst num_workers.
      
       The search is deterministic (independently of num_workers!), and we
       schedule and wait for interleave_batch_size task to be completed before
       synchronizing and scheduling the next batch of tasks.
       
      optional bool interleave_search = 136 [default = false];
      Specified by:
      hasInterleaveSearch in interface SatParametersOrBuilder
      Returns:
      Whether the interleaveSearch field is set.
    • getInterleaveSearch

      public boolean getInterleaveSearch()
       Experimental. If this is true, then we interleave all our major search
       strategy and distribute the work amongst num_workers.
      
       The search is deterministic (independently of num_workers!), and we
       schedule and wait for interleave_batch_size task to be completed before
       synchronizing and scheduling the next batch of tasks.
       
      optional bool interleave_search = 136 [default = false];
      Specified by:
      getInterleaveSearch in interface SatParametersOrBuilder
      Returns:
      The interleaveSearch.
    • setInterleaveSearch

      public SatParameters.Builder setInterleaveSearch(boolean value)
       Experimental. If this is true, then we interleave all our major search
       strategy and distribute the work amongst num_workers.
      
       The search is deterministic (independently of num_workers!), and we
       schedule and wait for interleave_batch_size task to be completed before
       synchronizing and scheduling the next batch of tasks.
       
      optional bool interleave_search = 136 [default = false];
      Parameters:
      value - The interleaveSearch to set.
      Returns:
      This builder for chaining.
    • clearInterleaveSearch

      public SatParameters.Builder clearInterleaveSearch()
       Experimental. If this is true, then we interleave all our major search
       strategy and distribute the work amongst num_workers.
      
       The search is deterministic (independently of num_workers!), and we
       schedule and wait for interleave_batch_size task to be completed before
       synchronizing and scheduling the next batch of tasks.
       
      optional bool interleave_search = 136 [default = false];
      Returns:
      This builder for chaining.
    • hasInterleaveBatchSize

      public boolean hasInterleaveBatchSize()
      optional int32 interleave_batch_size = 134 [default = 0];
      Specified by:
      hasInterleaveBatchSize in interface SatParametersOrBuilder
      Returns:
      Whether the interleaveBatchSize field is set.
    • getInterleaveBatchSize

      public int getInterleaveBatchSize()
      optional int32 interleave_batch_size = 134 [default = 0];
      Specified by:
      getInterleaveBatchSize in interface SatParametersOrBuilder
      Returns:
      The interleaveBatchSize.
    • setInterleaveBatchSize

      public SatParameters.Builder setInterleaveBatchSize(int value)
      optional int32 interleave_batch_size = 134 [default = 0];
      Parameters:
      value - The interleaveBatchSize to set.
      Returns:
      This builder for chaining.
    • clearInterleaveBatchSize

      public SatParameters.Builder clearInterleaveBatchSize()
      optional int32 interleave_batch_size = 134 [default = 0];
      Returns:
      This builder for chaining.
    • hasShareObjectiveBounds

      public boolean hasShareObjectiveBounds()
       Allows objective sharing between workers.
       
      optional bool share_objective_bounds = 113 [default = true];
      Specified by:
      hasShareObjectiveBounds in interface SatParametersOrBuilder
      Returns:
      Whether the shareObjectiveBounds field is set.
    • getShareObjectiveBounds

      public boolean getShareObjectiveBounds()
       Allows objective sharing between workers.
       
      optional bool share_objective_bounds = 113 [default = true];
      Specified by:
      getShareObjectiveBounds in interface SatParametersOrBuilder
      Returns:
      The shareObjectiveBounds.
    • setShareObjectiveBounds

      public SatParameters.Builder setShareObjectiveBounds(boolean value)
       Allows objective sharing between workers.
       
      optional bool share_objective_bounds = 113 [default = true];
      Parameters:
      value - The shareObjectiveBounds to set.
      Returns:
      This builder for chaining.
    • clearShareObjectiveBounds

      public SatParameters.Builder clearShareObjectiveBounds()
       Allows objective sharing between workers.
       
      optional bool share_objective_bounds = 113 [default = true];
      Returns:
      This builder for chaining.
    • hasShareLevelZeroBounds

      public boolean hasShareLevelZeroBounds()
       Allows sharing of the bounds of modified variables at level 0.
       
      optional bool share_level_zero_bounds = 114 [default = true];
      Specified by:
      hasShareLevelZeroBounds in interface SatParametersOrBuilder
      Returns:
      Whether the shareLevelZeroBounds field is set.
    • getShareLevelZeroBounds

      public boolean getShareLevelZeroBounds()
       Allows sharing of the bounds of modified variables at level 0.
       
      optional bool share_level_zero_bounds = 114 [default = true];
      Specified by:
      getShareLevelZeroBounds in interface SatParametersOrBuilder
      Returns:
      The shareLevelZeroBounds.
    • setShareLevelZeroBounds

      public SatParameters.Builder setShareLevelZeroBounds(boolean value)
       Allows sharing of the bounds of modified variables at level 0.
       
      optional bool share_level_zero_bounds = 114 [default = true];
      Parameters:
      value - The shareLevelZeroBounds to set.
      Returns:
      This builder for chaining.
    • clearShareLevelZeroBounds

      public SatParameters.Builder clearShareLevelZeroBounds()
       Allows sharing of the bounds of modified variables at level 0.
       
      optional bool share_level_zero_bounds = 114 [default = true];
      Returns:
      This builder for chaining.
    • hasShareBinaryClauses

      public boolean hasShareBinaryClauses()
       Allows sharing of new learned binary clause between workers.
       
      optional bool share_binary_clauses = 203 [default = true];
      Specified by:
      hasShareBinaryClauses in interface SatParametersOrBuilder
      Returns:
      Whether the shareBinaryClauses field is set.
    • getShareBinaryClauses

      public boolean getShareBinaryClauses()
       Allows sharing of new learned binary clause between workers.
       
      optional bool share_binary_clauses = 203 [default = true];
      Specified by:
      getShareBinaryClauses in interface SatParametersOrBuilder
      Returns:
      The shareBinaryClauses.
    • setShareBinaryClauses

      public SatParameters.Builder setShareBinaryClauses(boolean value)
       Allows sharing of new learned binary clause between workers.
       
      optional bool share_binary_clauses = 203 [default = true];
      Parameters:
      value - The shareBinaryClauses to set.
      Returns:
      This builder for chaining.
    • clearShareBinaryClauses

      public SatParameters.Builder clearShareBinaryClauses()
       Allows sharing of new learned binary clause between workers.
       
      optional bool share_binary_clauses = 203 [default = true];
      Returns:
      This builder for chaining.
    • hasShareGlueClauses

      public boolean hasShareGlueClauses()
       Allows sharing of short glue clauses between workers.
       Implicitly disabled if share_binary_clauses is false.
       
      optional bool share_glue_clauses = 285 [default = false];
      Specified by:
      hasShareGlueClauses in interface SatParametersOrBuilder
      Returns:
      Whether the shareGlueClauses field is set.
    • getShareGlueClauses

      public boolean getShareGlueClauses()
       Allows sharing of short glue clauses between workers.
       Implicitly disabled if share_binary_clauses is false.
       
      optional bool share_glue_clauses = 285 [default = false];
      Specified by:
      getShareGlueClauses in interface SatParametersOrBuilder
      Returns:
      The shareGlueClauses.
    • setShareGlueClauses

      public SatParameters.Builder setShareGlueClauses(boolean value)
       Allows sharing of short glue clauses between workers.
       Implicitly disabled if share_binary_clauses is false.
       
      optional bool share_glue_clauses = 285 [default = false];
      Parameters:
      value - The shareGlueClauses to set.
      Returns:
      This builder for chaining.
    • clearShareGlueClauses

      public SatParameters.Builder clearShareGlueClauses()
       Allows sharing of short glue clauses between workers.
       Implicitly disabled if share_binary_clauses is false.
       
      optional bool share_glue_clauses = 285 [default = false];
      Returns:
      This builder for chaining.
    • hasMinimizeSharedClauses

      public boolean hasMinimizeSharedClauses()
       Minimize and detect subsumption of shared clauses immediately after they
       are imported.
       
      optional bool minimize_shared_clauses = 300 [default = true];
      Specified by:
      hasMinimizeSharedClauses in interface SatParametersOrBuilder
      Returns:
      Whether the minimizeSharedClauses field is set.
    • getMinimizeSharedClauses

      public boolean getMinimizeSharedClauses()
       Minimize and detect subsumption of shared clauses immediately after they
       are imported.
       
      optional bool minimize_shared_clauses = 300 [default = true];
      Specified by:
      getMinimizeSharedClauses in interface SatParametersOrBuilder
      Returns:
      The minimizeSharedClauses.
    • setMinimizeSharedClauses

      public SatParameters.Builder setMinimizeSharedClauses(boolean value)
       Minimize and detect subsumption of shared clauses immediately after they
       are imported.
       
      optional bool minimize_shared_clauses = 300 [default = true];
      Parameters:
      value - The minimizeSharedClauses to set.
      Returns:
      This builder for chaining.
    • clearMinimizeSharedClauses

      public SatParameters.Builder clearMinimizeSharedClauses()
       Minimize and detect subsumption of shared clauses immediately after they
       are imported.
       
      optional bool minimize_shared_clauses = 300 [default = true];
      Returns:
      This builder for chaining.
    • hasShareGlueClausesDtime

      public boolean hasShareGlueClausesDtime()
       The amount of dtime between each export of shared glue clauses.
       
      optional double share_glue_clauses_dtime = 322 [default = 1];
      Specified by:
      hasShareGlueClausesDtime in interface SatParametersOrBuilder
      Returns:
      Whether the shareGlueClausesDtime field is set.
    • getShareGlueClausesDtime

      public double getShareGlueClausesDtime()
       The amount of dtime between each export of shared glue clauses.
       
      optional double share_glue_clauses_dtime = 322 [default = 1];
      Specified by:
      getShareGlueClausesDtime in interface SatParametersOrBuilder
      Returns:
      The shareGlueClausesDtime.
    • setShareGlueClausesDtime

      public SatParameters.Builder setShareGlueClausesDtime(double value)
       The amount of dtime between each export of shared glue clauses.
       
      optional double share_glue_clauses_dtime = 322 [default = 1];
      Parameters:
      value - The shareGlueClausesDtime to set.
      Returns:
      This builder for chaining.
    • clearShareGlueClausesDtime

      public SatParameters.Builder clearShareGlueClausesDtime()
       The amount of dtime between each export of shared glue clauses.
       
      optional double share_glue_clauses_dtime = 322 [default = 1];
      Returns:
      This builder for chaining.
    • hasDebugPostsolveWithFullSolver

      public boolean hasDebugPostsolveWithFullSolver()
       We have two different postsolve code. The default one should be better and
       it allows for a more powerful presolve, but it can be useful to postsolve
       using the full solver instead.
       
      optional bool debug_postsolve_with_full_solver = 162 [default = false];
      Specified by:
      hasDebugPostsolveWithFullSolver in interface SatParametersOrBuilder
      Returns:
      Whether the debugPostsolveWithFullSolver field is set.
    • getDebugPostsolveWithFullSolver

      public boolean getDebugPostsolveWithFullSolver()
       We have two different postsolve code. The default one should be better and
       it allows for a more powerful presolve, but it can be useful to postsolve
       using the full solver instead.
       
      optional bool debug_postsolve_with_full_solver = 162 [default = false];
      Specified by:
      getDebugPostsolveWithFullSolver in interface SatParametersOrBuilder
      Returns:
      The debugPostsolveWithFullSolver.
    • setDebugPostsolveWithFullSolver

      public SatParameters.Builder setDebugPostsolveWithFullSolver(boolean value)
       We have two different postsolve code. The default one should be better and
       it allows for a more powerful presolve, but it can be useful to postsolve
       using the full solver instead.
       
      optional bool debug_postsolve_with_full_solver = 162 [default = false];
      Parameters:
      value - The debugPostsolveWithFullSolver to set.
      Returns:
      This builder for chaining.
    • clearDebugPostsolveWithFullSolver

      public SatParameters.Builder clearDebugPostsolveWithFullSolver()
       We have two different postsolve code. The default one should be better and
       it allows for a more powerful presolve, but it can be useful to postsolve
       using the full solver instead.
       
      optional bool debug_postsolve_with_full_solver = 162 [default = false];
      Returns:
      This builder for chaining.
    • hasDebugMaxNumPresolveOperations

      public boolean hasDebugMaxNumPresolveOperations()
       If positive, try to stop just after that many presolve rules have been
       applied. This is mainly useful for debugging presolve.
       
      optional int32 debug_max_num_presolve_operations = 151 [default = 0];
      Specified by:
      hasDebugMaxNumPresolveOperations in interface SatParametersOrBuilder
      Returns:
      Whether the debugMaxNumPresolveOperations field is set.
    • getDebugMaxNumPresolveOperations

      public int getDebugMaxNumPresolveOperations()
       If positive, try to stop just after that many presolve rules have been
       applied. This is mainly useful for debugging presolve.
       
      optional int32 debug_max_num_presolve_operations = 151 [default = 0];
      Specified by:
      getDebugMaxNumPresolveOperations in interface SatParametersOrBuilder
      Returns:
      The debugMaxNumPresolveOperations.
    • setDebugMaxNumPresolveOperations

      public SatParameters.Builder setDebugMaxNumPresolveOperations(int value)
       If positive, try to stop just after that many presolve rules have been
       applied. This is mainly useful for debugging presolve.
       
      optional int32 debug_max_num_presolve_operations = 151 [default = 0];
      Parameters:
      value - The debugMaxNumPresolveOperations to set.
      Returns:
      This builder for chaining.
    • clearDebugMaxNumPresolveOperations

      public SatParameters.Builder clearDebugMaxNumPresolveOperations()
       If positive, try to stop just after that many presolve rules have been
       applied. This is mainly useful for debugging presolve.
       
      optional int32 debug_max_num_presolve_operations = 151 [default = 0];
      Returns:
      This builder for chaining.
    • hasDebugCrashOnBadHint

      public boolean hasDebugCrashOnBadHint()
       Crash if we do not manage to complete the hint into a full solution.
       
      optional bool debug_crash_on_bad_hint = 195 [default = false];
      Specified by:
      hasDebugCrashOnBadHint in interface SatParametersOrBuilder
      Returns:
      Whether the debugCrashOnBadHint field is set.
    • getDebugCrashOnBadHint

      public boolean getDebugCrashOnBadHint()
       Crash if we do not manage to complete the hint into a full solution.
       
      optional bool debug_crash_on_bad_hint = 195 [default = false];
      Specified by:
      getDebugCrashOnBadHint in interface SatParametersOrBuilder
      Returns:
      The debugCrashOnBadHint.
    • setDebugCrashOnBadHint

      public SatParameters.Builder setDebugCrashOnBadHint(boolean value)
       Crash if we do not manage to complete the hint into a full solution.
       
      optional bool debug_crash_on_bad_hint = 195 [default = false];
      Parameters:
      value - The debugCrashOnBadHint to set.
      Returns:
      This builder for chaining.
    • clearDebugCrashOnBadHint

      public SatParameters.Builder clearDebugCrashOnBadHint()
       Crash if we do not manage to complete the hint into a full solution.
       
      optional bool debug_crash_on_bad_hint = 195 [default = false];
      Returns:
      This builder for chaining.
    • hasDebugCrashIfPresolveBreaksHint

      public boolean hasDebugCrashIfPresolveBreaksHint()
       Crash if presolve breaks a feasible hint.
       
      optional bool debug_crash_if_presolve_breaks_hint = 306 [default = false];
      Specified by:
      hasDebugCrashIfPresolveBreaksHint in interface SatParametersOrBuilder
      Returns:
      Whether the debugCrashIfPresolveBreaksHint field is set.
    • getDebugCrashIfPresolveBreaksHint

      public boolean getDebugCrashIfPresolveBreaksHint()
       Crash if presolve breaks a feasible hint.
       
      optional bool debug_crash_if_presolve_breaks_hint = 306 [default = false];
      Specified by:
      getDebugCrashIfPresolveBreaksHint in interface SatParametersOrBuilder
      Returns:
      The debugCrashIfPresolveBreaksHint.
    • setDebugCrashIfPresolveBreaksHint

      public SatParameters.Builder setDebugCrashIfPresolveBreaksHint(boolean value)
       Crash if presolve breaks a feasible hint.
       
      optional bool debug_crash_if_presolve_breaks_hint = 306 [default = false];
      Parameters:
      value - The debugCrashIfPresolveBreaksHint to set.
      Returns:
      This builder for chaining.
    • clearDebugCrashIfPresolveBreaksHint

      public SatParameters.Builder clearDebugCrashIfPresolveBreaksHint()
       Crash if presolve breaks a feasible hint.
       
      optional bool debug_crash_if_presolve_breaks_hint = 306 [default = false];
      Returns:
      This builder for chaining.
    • hasUseOptimizationHints

      public boolean hasUseOptimizationHints()
       For an optimization problem, whether we follow some hints in order to find
       a better first solution. For a variable with hint, the solver will always
       try to follow the hint. It will revert to the variable_branching default
       otherwise.
       
      optional bool use_optimization_hints = 35 [default = true];
      Specified by:
      hasUseOptimizationHints in interface SatParametersOrBuilder
      Returns:
      Whether the useOptimizationHints field is set.
    • getUseOptimizationHints

      public boolean getUseOptimizationHints()
       For an optimization problem, whether we follow some hints in order to find
       a better first solution. For a variable with hint, the solver will always
       try to follow the hint. It will revert to the variable_branching default
       otherwise.
       
      optional bool use_optimization_hints = 35 [default = true];
      Specified by:
      getUseOptimizationHints in interface SatParametersOrBuilder
      Returns:
      The useOptimizationHints.
    • setUseOptimizationHints

      public SatParameters.Builder setUseOptimizationHints(boolean value)
       For an optimization problem, whether we follow some hints in order to find
       a better first solution. For a variable with hint, the solver will always
       try to follow the hint. It will revert to the variable_branching default
       otherwise.
       
      optional bool use_optimization_hints = 35 [default = true];
      Parameters:
      value - The useOptimizationHints to set.
      Returns:
      This builder for chaining.
    • clearUseOptimizationHints

      public SatParameters.Builder clearUseOptimizationHints()
       For an optimization problem, whether we follow some hints in order to find
       a better first solution. For a variable with hint, the solver will always
       try to follow the hint. It will revert to the variable_branching default
       otherwise.
       
      optional bool use_optimization_hints = 35 [default = true];
      Returns:
      This builder for chaining.
    • hasCoreMinimizationLevel

      public boolean hasCoreMinimizationLevel()
       If positive, we spend some effort on each core:
       - At level 1, we use a simple heuristic to try to minimize an UNSAT core.
       - At level 2, we use propagation to minimize the core but also identify
       literal in at most one relationship in this core.
       
      optional int32 core_minimization_level = 50 [default = 2];
      Specified by:
      hasCoreMinimizationLevel in interface SatParametersOrBuilder
      Returns:
      Whether the coreMinimizationLevel field is set.
    • getCoreMinimizationLevel

      public int getCoreMinimizationLevel()
       If positive, we spend some effort on each core:
       - At level 1, we use a simple heuristic to try to minimize an UNSAT core.
       - At level 2, we use propagation to minimize the core but also identify
       literal in at most one relationship in this core.
       
      optional int32 core_minimization_level = 50 [default = 2];
      Specified by:
      getCoreMinimizationLevel in interface SatParametersOrBuilder
      Returns:
      The coreMinimizationLevel.
    • setCoreMinimizationLevel

      public SatParameters.Builder setCoreMinimizationLevel(int value)
       If positive, we spend some effort on each core:
       - At level 1, we use a simple heuristic to try to minimize an UNSAT core.
       - At level 2, we use propagation to minimize the core but also identify
       literal in at most one relationship in this core.
       
      optional int32 core_minimization_level = 50 [default = 2];
      Parameters:
      value - The coreMinimizationLevel to set.
      Returns:
      This builder for chaining.
    • clearCoreMinimizationLevel

      public SatParameters.Builder clearCoreMinimizationLevel()
       If positive, we spend some effort on each core:
       - At level 1, we use a simple heuristic to try to minimize an UNSAT core.
       - At level 2, we use propagation to minimize the core but also identify
       literal in at most one relationship in this core.
       
      optional int32 core_minimization_level = 50 [default = 2];
      Returns:
      This builder for chaining.
    • hasFindMultipleCores

      public boolean hasFindMultipleCores()
       Whether we try to find more independent cores for a given set of
       assumptions in the core based max-SAT algorithms.
       
      optional bool find_multiple_cores = 84 [default = true];
      Specified by:
      hasFindMultipleCores in interface SatParametersOrBuilder
      Returns:
      Whether the findMultipleCores field is set.
    • getFindMultipleCores

      public boolean getFindMultipleCores()
       Whether we try to find more independent cores for a given set of
       assumptions in the core based max-SAT algorithms.
       
      optional bool find_multiple_cores = 84 [default = true];
      Specified by:
      getFindMultipleCores in interface SatParametersOrBuilder
      Returns:
      The findMultipleCores.
    • setFindMultipleCores

      public SatParameters.Builder setFindMultipleCores(boolean value)
       Whether we try to find more independent cores for a given set of
       assumptions in the core based max-SAT algorithms.
       
      optional bool find_multiple_cores = 84 [default = true];
      Parameters:
      value - The findMultipleCores to set.
      Returns:
      This builder for chaining.
    • clearFindMultipleCores

      public SatParameters.Builder clearFindMultipleCores()
       Whether we try to find more independent cores for a given set of
       assumptions in the core based max-SAT algorithms.
       
      optional bool find_multiple_cores = 84 [default = true];
      Returns:
      This builder for chaining.
    • hasCoverOptimization

      public boolean hasCoverOptimization()
       If true, when the max-sat algo find a core, we compute the minimal number
       of literals in the core that needs to be true to have a feasible solution.
       This is also called core exhaustion in more recent max-SAT papers.
       
      optional bool cover_optimization = 89 [default = true];
      Specified by:
      hasCoverOptimization in interface SatParametersOrBuilder
      Returns:
      Whether the coverOptimization field is set.
    • getCoverOptimization

      public boolean getCoverOptimization()
       If true, when the max-sat algo find a core, we compute the minimal number
       of literals in the core that needs to be true to have a feasible solution.
       This is also called core exhaustion in more recent max-SAT papers.
       
      optional bool cover_optimization = 89 [default = true];
      Specified by:
      getCoverOptimization in interface SatParametersOrBuilder
      Returns:
      The coverOptimization.
    • setCoverOptimization

      public SatParameters.Builder setCoverOptimization(boolean value)
       If true, when the max-sat algo find a core, we compute the minimal number
       of literals in the core that needs to be true to have a feasible solution.
       This is also called core exhaustion in more recent max-SAT papers.
       
      optional bool cover_optimization = 89 [default = true];
      Parameters:
      value - The coverOptimization to set.
      Returns:
      This builder for chaining.
    • clearCoverOptimization

      public SatParameters.Builder clearCoverOptimization()
       If true, when the max-sat algo find a core, we compute the minimal number
       of literals in the core that needs to be true to have a feasible solution.
       This is also called core exhaustion in more recent max-SAT papers.
       
      optional bool cover_optimization = 89 [default = true];
      Returns:
      This builder for chaining.
    • hasMaxSatAssumptionOrder

      public boolean hasMaxSatAssumptionOrder()
      optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [default = DEFAULT_ASSUMPTION_ORDER];
      Specified by:
      hasMaxSatAssumptionOrder in interface SatParametersOrBuilder
      Returns:
      Whether the maxSatAssumptionOrder field is set.
    • getMaxSatAssumptionOrder

      public SatParameters.MaxSatAssumptionOrder getMaxSatAssumptionOrder()
      optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [default = DEFAULT_ASSUMPTION_ORDER];
      Specified by:
      getMaxSatAssumptionOrder in interface SatParametersOrBuilder
      Returns:
      The maxSatAssumptionOrder.
    • setMaxSatAssumptionOrder

      public SatParameters.Builder setMaxSatAssumptionOrder(SatParameters.MaxSatAssumptionOrder value)
      optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [default = DEFAULT_ASSUMPTION_ORDER];
      Parameters:
      value - The maxSatAssumptionOrder to set.
      Returns:
      This builder for chaining.
    • clearMaxSatAssumptionOrder

      public SatParameters.Builder clearMaxSatAssumptionOrder()
      optional .operations_research.sat.SatParameters.MaxSatAssumptionOrder max_sat_assumption_order = 51 [default = DEFAULT_ASSUMPTION_ORDER];
      Returns:
      This builder for chaining.
    • hasMaxSatReverseAssumptionOrder

      public boolean hasMaxSatReverseAssumptionOrder()
       If true, adds the assumption in the reverse order of the one defined by
       max_sat_assumption_order.
       
      optional bool max_sat_reverse_assumption_order = 52 [default = false];
      Specified by:
      hasMaxSatReverseAssumptionOrder in interface SatParametersOrBuilder
      Returns:
      Whether the maxSatReverseAssumptionOrder field is set.
    • getMaxSatReverseAssumptionOrder

      public boolean getMaxSatReverseAssumptionOrder()
       If true, adds the assumption in the reverse order of the one defined by
       max_sat_assumption_order.
       
      optional bool max_sat_reverse_assumption_order = 52 [default = false];
      Specified by:
      getMaxSatReverseAssumptionOrder in interface SatParametersOrBuilder
      Returns:
      The maxSatReverseAssumptionOrder.
    • setMaxSatReverseAssumptionOrder

      public SatParameters.Builder setMaxSatReverseAssumptionOrder(boolean value)
       If true, adds the assumption in the reverse order of the one defined by
       max_sat_assumption_order.
       
      optional bool max_sat_reverse_assumption_order = 52 [default = false];
      Parameters:
      value - The maxSatReverseAssumptionOrder to set.
      Returns:
      This builder for chaining.
    • clearMaxSatReverseAssumptionOrder

      public SatParameters.Builder clearMaxSatReverseAssumptionOrder()
       If true, adds the assumption in the reverse order of the one defined by
       max_sat_assumption_order.
       
      optional bool max_sat_reverse_assumption_order = 52 [default = false];
      Returns:
      This builder for chaining.
    • hasMaxSatStratification

      public boolean hasMaxSatStratification()
      optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification = 53 [default = STRATIFICATION_DESCENT];
      Specified by:
      hasMaxSatStratification in interface SatParametersOrBuilder
      Returns:
      Whether the maxSatStratification field is set.
    • getMaxSatStratification

      public SatParameters.MaxSatStratificationAlgorithm getMaxSatStratification()
      optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification = 53 [default = STRATIFICATION_DESCENT];
      Specified by:
      getMaxSatStratification in interface SatParametersOrBuilder
      Returns:
      The maxSatStratification.
    • setMaxSatStratification

      optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification = 53 [default = STRATIFICATION_DESCENT];
      Parameters:
      value - The maxSatStratification to set.
      Returns:
      This builder for chaining.
    • clearMaxSatStratification

      public SatParameters.Builder clearMaxSatStratification()
      optional .operations_research.sat.SatParameters.MaxSatStratificationAlgorithm max_sat_stratification = 53 [default = STRATIFICATION_DESCENT];
      Returns:
      This builder for chaining.
    • hasPropagationLoopDetectionFactor

      public boolean hasPropagationLoopDetectionFactor()
       Some search decisions might cause a really large number of propagations to
       happen when integer variables with large domains are only reduced by 1 at
       each step. If we propagate more than the number of variable times this
       parameters we try to take counter-measure. Setting this to 0.0 disable this
       feature.
      
       TODO(user): Setting this to something like 10 helps in most cases, but the
       code is currently buggy and can cause the solve to enter a bad state where
       no progress is made.
       
      optional double propagation_loop_detection_factor = 221 [default = 10];
      Specified by:
      hasPropagationLoopDetectionFactor in interface SatParametersOrBuilder
      Returns:
      Whether the propagationLoopDetectionFactor field is set.
    • getPropagationLoopDetectionFactor

      public double getPropagationLoopDetectionFactor()
       Some search decisions might cause a really large number of propagations to
       happen when integer variables with large domains are only reduced by 1 at
       each step. If we propagate more than the number of variable times this
       parameters we try to take counter-measure. Setting this to 0.0 disable this
       feature.
      
       TODO(user): Setting this to something like 10 helps in most cases, but the
       code is currently buggy and can cause the solve to enter a bad state where
       no progress is made.
       
      optional double propagation_loop_detection_factor = 221 [default = 10];
      Specified by:
      getPropagationLoopDetectionFactor in interface SatParametersOrBuilder
      Returns:
      The propagationLoopDetectionFactor.
    • setPropagationLoopDetectionFactor

      public SatParameters.Builder setPropagationLoopDetectionFactor(double value)
       Some search decisions might cause a really large number of propagations to
       happen when integer variables with large domains are only reduced by 1 at
       each step. If we propagate more than the number of variable times this
       parameters we try to take counter-measure. Setting this to 0.0 disable this
       feature.
      
       TODO(user): Setting this to something like 10 helps in most cases, but the
       code is currently buggy and can cause the solve to enter a bad state where
       no progress is made.
       
      optional double propagation_loop_detection_factor = 221 [default = 10];
      Parameters:
      value - The propagationLoopDetectionFactor to set.
      Returns:
      This builder for chaining.
    • clearPropagationLoopDetectionFactor

      public SatParameters.Builder clearPropagationLoopDetectionFactor()
       Some search decisions might cause a really large number of propagations to
       happen when integer variables with large domains are only reduced by 1 at
       each step. If we propagate more than the number of variable times this
       parameters we try to take counter-measure. Setting this to 0.0 disable this
       feature.
      
       TODO(user): Setting this to something like 10 helps in most cases, but the
       code is currently buggy and can cause the solve to enter a bad state where
       no progress is made.
       
      optional double propagation_loop_detection_factor = 221 [default = 10];
      Returns:
      This builder for chaining.
    • hasUsePrecedencesInDisjunctiveConstraint

      public boolean hasUsePrecedencesInDisjunctiveConstraint()
       When this is true, then a disjunctive constraint will try to use the
       precedence relations between time intervals to propagate their bounds
       further. For instance if task A and B are both before C and task A and B
       are in disjunction, then we can deduce that task C must start after
       duration(A) + duration(B) instead of simply max(duration(A), duration(B)),
       provided that the start time for all task was currently zero.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
      Specified by:
      hasUsePrecedencesInDisjunctiveConstraint in interface SatParametersOrBuilder
      Returns:
      Whether the usePrecedencesInDisjunctiveConstraint field is set.
    • getUsePrecedencesInDisjunctiveConstraint

      public boolean getUsePrecedencesInDisjunctiveConstraint()
       When this is true, then a disjunctive constraint will try to use the
       precedence relations between time intervals to propagate their bounds
       further. For instance if task A and B are both before C and task A and B
       are in disjunction, then we can deduce that task C must start after
       duration(A) + duration(B) instead of simply max(duration(A), duration(B)),
       provided that the start time for all task was currently zero.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
      Specified by:
      getUsePrecedencesInDisjunctiveConstraint in interface SatParametersOrBuilder
      Returns:
      The usePrecedencesInDisjunctiveConstraint.
    • setUsePrecedencesInDisjunctiveConstraint

      public SatParameters.Builder setUsePrecedencesInDisjunctiveConstraint(boolean value)
       When this is true, then a disjunctive constraint will try to use the
       precedence relations between time intervals to propagate their bounds
       further. For instance if task A and B are both before C and task A and B
       are in disjunction, then we can deduce that task C must start after
       duration(A) + duration(B) instead of simply max(duration(A), duration(B)),
       provided that the start time for all task was currently zero.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
      Parameters:
      value - The usePrecedencesInDisjunctiveConstraint to set.
      Returns:
      This builder for chaining.
    • clearUsePrecedencesInDisjunctiveConstraint

      public SatParameters.Builder clearUsePrecedencesInDisjunctiveConstraint()
       When this is true, then a disjunctive constraint will try to use the
       precedence relations between time intervals to propagate their bounds
       further. For instance if task A and B are both before C and task A and B
       are in disjunction, then we can deduce that task C must start after
       duration(A) + duration(B) instead of simply max(duration(A), duration(B)),
       provided that the start time for all task was currently zero.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_precedences_in_disjunctive_constraint = 74 [default = true];
      Returns:
      This builder for chaining.
    • hasMaxSizeToCreatePrecedenceLiteralsInDisjunctive

      public boolean hasMaxSizeToCreatePrecedenceLiteralsInDisjunctive()
       Create one literal for each disjunction of two pairs of tasks. This slows
       down the solve time, but improves the lower bound of the objective in the
       makespan case. This will be triggered if the number of intervals is less or
       equal than the parameter and if use_strong_propagation_in_disjunctive is
       true.
       
      optional int32 max_size_to_create_precedence_literals_in_disjunctive = 229 [default = 60];
      Specified by:
      hasMaxSizeToCreatePrecedenceLiteralsInDisjunctive in interface SatParametersOrBuilder
      Returns:
      Whether the maxSizeToCreatePrecedenceLiteralsInDisjunctive field is set.
    • getMaxSizeToCreatePrecedenceLiteralsInDisjunctive

      public int getMaxSizeToCreatePrecedenceLiteralsInDisjunctive()
       Create one literal for each disjunction of two pairs of tasks. This slows
       down the solve time, but improves the lower bound of the objective in the
       makespan case. This will be triggered if the number of intervals is less or
       equal than the parameter and if use_strong_propagation_in_disjunctive is
       true.
       
      optional int32 max_size_to_create_precedence_literals_in_disjunctive = 229 [default = 60];
      Specified by:
      getMaxSizeToCreatePrecedenceLiteralsInDisjunctive in interface SatParametersOrBuilder
      Returns:
      The maxSizeToCreatePrecedenceLiteralsInDisjunctive.
    • setMaxSizeToCreatePrecedenceLiteralsInDisjunctive

      public SatParameters.Builder setMaxSizeToCreatePrecedenceLiteralsInDisjunctive(int value)
       Create one literal for each disjunction of two pairs of tasks. This slows
       down the solve time, but improves the lower bound of the objective in the
       makespan case. This will be triggered if the number of intervals is less or
       equal than the parameter and if use_strong_propagation_in_disjunctive is
       true.
       
      optional int32 max_size_to_create_precedence_literals_in_disjunctive = 229 [default = 60];
      Parameters:
      value - The maxSizeToCreatePrecedenceLiteralsInDisjunctive to set.
      Returns:
      This builder for chaining.
    • clearMaxSizeToCreatePrecedenceLiteralsInDisjunctive

      public SatParameters.Builder clearMaxSizeToCreatePrecedenceLiteralsInDisjunctive()
       Create one literal for each disjunction of two pairs of tasks. This slows
       down the solve time, but improves the lower bound of the objective in the
       makespan case. This will be triggered if the number of intervals is less or
       equal than the parameter and if use_strong_propagation_in_disjunctive is
       true.
       
      optional int32 max_size_to_create_precedence_literals_in_disjunctive = 229 [default = 60];
      Returns:
      This builder for chaining.
    • hasUseStrongPropagationInDisjunctive

      public boolean hasUseStrongPropagationInDisjunctive()
       Enable stronger and more expensive propagation on no_overlap constraint.
       
      optional bool use_strong_propagation_in_disjunctive = 230 [default = false];
      Specified by:
      hasUseStrongPropagationInDisjunctive in interface SatParametersOrBuilder
      Returns:
      Whether the useStrongPropagationInDisjunctive field is set.
    • getUseStrongPropagationInDisjunctive

      public boolean getUseStrongPropagationInDisjunctive()
       Enable stronger and more expensive propagation on no_overlap constraint.
       
      optional bool use_strong_propagation_in_disjunctive = 230 [default = false];
      Specified by:
      getUseStrongPropagationInDisjunctive in interface SatParametersOrBuilder
      Returns:
      The useStrongPropagationInDisjunctive.
    • setUseStrongPropagationInDisjunctive

      public SatParameters.Builder setUseStrongPropagationInDisjunctive(boolean value)
       Enable stronger and more expensive propagation on no_overlap constraint.
       
      optional bool use_strong_propagation_in_disjunctive = 230 [default = false];
      Parameters:
      value - The useStrongPropagationInDisjunctive to set.
      Returns:
      This builder for chaining.
    • clearUseStrongPropagationInDisjunctive

      public SatParameters.Builder clearUseStrongPropagationInDisjunctive()
       Enable stronger and more expensive propagation on no_overlap constraint.
       
      optional bool use_strong_propagation_in_disjunctive = 230 [default = false];
      Returns:
      This builder for chaining.
    • hasUseDynamicPrecedenceInDisjunctive

      public boolean hasUseDynamicPrecedenceInDisjunctive()
       Whether we try to branch on decision "interval A before interval B" rather
       than on intervals bounds. This usually works better, but slow down a bit
       the time to find the first solution.
      
       These parameters are still EXPERIMENTAL, the result should be correct, but
       it some corner cases, they can cause some failing CHECK in the solver.
       
      optional bool use_dynamic_precedence_in_disjunctive = 263 [default = false];
      Specified by:
      hasUseDynamicPrecedenceInDisjunctive in interface SatParametersOrBuilder
      Returns:
      Whether the useDynamicPrecedenceInDisjunctive field is set.
    • getUseDynamicPrecedenceInDisjunctive

      public boolean getUseDynamicPrecedenceInDisjunctive()
       Whether we try to branch on decision "interval A before interval B" rather
       than on intervals bounds. This usually works better, but slow down a bit
       the time to find the first solution.
      
       These parameters are still EXPERIMENTAL, the result should be correct, but
       it some corner cases, they can cause some failing CHECK in the solver.
       
      optional bool use_dynamic_precedence_in_disjunctive = 263 [default = false];
      Specified by:
      getUseDynamicPrecedenceInDisjunctive in interface SatParametersOrBuilder
      Returns:
      The useDynamicPrecedenceInDisjunctive.
    • setUseDynamicPrecedenceInDisjunctive

      public SatParameters.Builder setUseDynamicPrecedenceInDisjunctive(boolean value)
       Whether we try to branch on decision "interval A before interval B" rather
       than on intervals bounds. This usually works better, but slow down a bit
       the time to find the first solution.
      
       These parameters are still EXPERIMENTAL, the result should be correct, but
       it some corner cases, they can cause some failing CHECK in the solver.
       
      optional bool use_dynamic_precedence_in_disjunctive = 263 [default = false];
      Parameters:
      value - The useDynamicPrecedenceInDisjunctive to set.
      Returns:
      This builder for chaining.
    • clearUseDynamicPrecedenceInDisjunctive

      public SatParameters.Builder clearUseDynamicPrecedenceInDisjunctive()
       Whether we try to branch on decision "interval A before interval B" rather
       than on intervals bounds. This usually works better, but slow down a bit
       the time to find the first solution.
      
       These parameters are still EXPERIMENTAL, the result should be correct, but
       it some corner cases, they can cause some failing CHECK in the solver.
       
      optional bool use_dynamic_precedence_in_disjunctive = 263 [default = false];
      Returns:
      This builder for chaining.
    • hasUseDynamicPrecedenceInCumulative

      public boolean hasUseDynamicPrecedenceInCumulative()
      optional bool use_dynamic_precedence_in_cumulative = 268 [default = false];
      Specified by:
      hasUseDynamicPrecedenceInCumulative in interface SatParametersOrBuilder
      Returns:
      Whether the useDynamicPrecedenceInCumulative field is set.
    • getUseDynamicPrecedenceInCumulative

      public boolean getUseDynamicPrecedenceInCumulative()
      optional bool use_dynamic_precedence_in_cumulative = 268 [default = false];
      Specified by:
      getUseDynamicPrecedenceInCumulative in interface SatParametersOrBuilder
      Returns:
      The useDynamicPrecedenceInCumulative.
    • setUseDynamicPrecedenceInCumulative

      public SatParameters.Builder setUseDynamicPrecedenceInCumulative(boolean value)
      optional bool use_dynamic_precedence_in_cumulative = 268 [default = false];
      Parameters:
      value - The useDynamicPrecedenceInCumulative to set.
      Returns:
      This builder for chaining.
    • clearUseDynamicPrecedenceInCumulative

      public SatParameters.Builder clearUseDynamicPrecedenceInCumulative()
      optional bool use_dynamic_precedence_in_cumulative = 268 [default = false];
      Returns:
      This builder for chaining.
    • hasUseOverloadCheckerInCumulative

      public boolean hasUseOverloadCheckerInCumulative()
       When this is true, the cumulative constraint is reinforced with overload
       checking, i.e., an additional level of reasoning based on energy. This
       additional level supplements the default level of reasoning as well as
       timetable edge finding.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_overload_checker_in_cumulative = 78 [default = false];
      Specified by:
      hasUseOverloadCheckerInCumulative in interface SatParametersOrBuilder
      Returns:
      Whether the useOverloadCheckerInCumulative field is set.
    • getUseOverloadCheckerInCumulative

      public boolean getUseOverloadCheckerInCumulative()
       When this is true, the cumulative constraint is reinforced with overload
       checking, i.e., an additional level of reasoning based on energy. This
       additional level supplements the default level of reasoning as well as
       timetable edge finding.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_overload_checker_in_cumulative = 78 [default = false];
      Specified by:
      getUseOverloadCheckerInCumulative in interface SatParametersOrBuilder
      Returns:
      The useOverloadCheckerInCumulative.
    • setUseOverloadCheckerInCumulative

      public SatParameters.Builder setUseOverloadCheckerInCumulative(boolean value)
       When this is true, the cumulative constraint is reinforced with overload
       checking, i.e., an additional level of reasoning based on energy. This
       additional level supplements the default level of reasoning as well as
       timetable edge finding.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_overload_checker_in_cumulative = 78 [default = false];
      Parameters:
      value - The useOverloadCheckerInCumulative to set.
      Returns:
      This builder for chaining.
    • clearUseOverloadCheckerInCumulative

      public SatParameters.Builder clearUseOverloadCheckerInCumulative()
       When this is true, the cumulative constraint is reinforced with overload
       checking, i.e., an additional level of reasoning based on energy. This
       additional level supplements the default level of reasoning as well as
       timetable edge finding.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_overload_checker_in_cumulative = 78 [default = false];
      Returns:
      This builder for chaining.
    • hasUseConservativeScaleOverloadChecker

      public boolean hasUseConservativeScaleOverloadChecker()
       Enable a heuristic to solve cumulative constraints using a modified energy
       constraint. We modify the usual energy definition by applying a
       super-additive function (also called "conservative scale" or "dual-feasible
       function") to the demand and the durations of the tasks.
      
       This heuristic is fast but for most problems it does not help much to find
       a solution.
       
      optional bool use_conservative_scale_overload_checker = 286 [default = false];
      Specified by:
      hasUseConservativeScaleOverloadChecker in interface SatParametersOrBuilder
      Returns:
      Whether the useConservativeScaleOverloadChecker field is set.
    • getUseConservativeScaleOverloadChecker

      public boolean getUseConservativeScaleOverloadChecker()
       Enable a heuristic to solve cumulative constraints using a modified energy
       constraint. We modify the usual energy definition by applying a
       super-additive function (also called "conservative scale" or "dual-feasible
       function") to the demand and the durations of the tasks.
      
       This heuristic is fast but for most problems it does not help much to find
       a solution.
       
      optional bool use_conservative_scale_overload_checker = 286 [default = false];
      Specified by:
      getUseConservativeScaleOverloadChecker in interface SatParametersOrBuilder
      Returns:
      The useConservativeScaleOverloadChecker.
    • setUseConservativeScaleOverloadChecker

      public SatParameters.Builder setUseConservativeScaleOverloadChecker(boolean value)
       Enable a heuristic to solve cumulative constraints using a modified energy
       constraint. We modify the usual energy definition by applying a
       super-additive function (also called "conservative scale" or "dual-feasible
       function") to the demand and the durations of the tasks.
      
       This heuristic is fast but for most problems it does not help much to find
       a solution.
       
      optional bool use_conservative_scale_overload_checker = 286 [default = false];
      Parameters:
      value - The useConservativeScaleOverloadChecker to set.
      Returns:
      This builder for chaining.
    • clearUseConservativeScaleOverloadChecker

      public SatParameters.Builder clearUseConservativeScaleOverloadChecker()
       Enable a heuristic to solve cumulative constraints using a modified energy
       constraint. We modify the usual energy definition by applying a
       super-additive function (also called "conservative scale" or "dual-feasible
       function") to the demand and the durations of the tasks.
      
       This heuristic is fast but for most problems it does not help much to find
       a solution.
       
      optional bool use_conservative_scale_overload_checker = 286 [default = false];
      Returns:
      This builder for chaining.
    • hasUseTimetableEdgeFindingInCumulative

      public boolean hasUseTimetableEdgeFindingInCumulative()
       When this is true, the cumulative constraint is reinforced with timetable
       edge finding, i.e., an additional level of reasoning based on the
       conjunction of energy and mandatory parts. This additional level
       supplements the default level of reasoning as well as overload_checker.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_timetable_edge_finding_in_cumulative = 79 [default = false];
      Specified by:
      hasUseTimetableEdgeFindingInCumulative in interface SatParametersOrBuilder
      Returns:
      Whether the useTimetableEdgeFindingInCumulative field is set.
    • getUseTimetableEdgeFindingInCumulative

      public boolean getUseTimetableEdgeFindingInCumulative()
       When this is true, the cumulative constraint is reinforced with timetable
       edge finding, i.e., an additional level of reasoning based on the
       conjunction of energy and mandatory parts. This additional level
       supplements the default level of reasoning as well as overload_checker.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_timetable_edge_finding_in_cumulative = 79 [default = false];
      Specified by:
      getUseTimetableEdgeFindingInCumulative in interface SatParametersOrBuilder
      Returns:
      The useTimetableEdgeFindingInCumulative.
    • setUseTimetableEdgeFindingInCumulative

      public SatParameters.Builder setUseTimetableEdgeFindingInCumulative(boolean value)
       When this is true, the cumulative constraint is reinforced with timetable
       edge finding, i.e., an additional level of reasoning based on the
       conjunction of energy and mandatory parts. This additional level
       supplements the default level of reasoning as well as overload_checker.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_timetable_edge_finding_in_cumulative = 79 [default = false];
      Parameters:
      value - The useTimetableEdgeFindingInCumulative to set.
      Returns:
      This builder for chaining.
    • clearUseTimetableEdgeFindingInCumulative

      public SatParameters.Builder clearUseTimetableEdgeFindingInCumulative()
       When this is true, the cumulative constraint is reinforced with timetable
       edge finding, i.e., an additional level of reasoning based on the
       conjunction of energy and mandatory parts. This additional level
       supplements the default level of reasoning as well as overload_checker.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_timetable_edge_finding_in_cumulative = 79 [default = false];
      Returns:
      This builder for chaining.
    • hasMaxNumIntervalsForTimetableEdgeFinding

      public boolean hasMaxNumIntervalsForTimetableEdgeFinding()
       Max number of intervals for the timetable_edge_finding algorithm to
       propagate. A value of 0 disables the constraint.
       
      optional int32 max_num_intervals_for_timetable_edge_finding = 260 [default = 100];
      Specified by:
      hasMaxNumIntervalsForTimetableEdgeFinding in interface SatParametersOrBuilder
      Returns:
      Whether the maxNumIntervalsForTimetableEdgeFinding field is set.
    • getMaxNumIntervalsForTimetableEdgeFinding

      public int getMaxNumIntervalsForTimetableEdgeFinding()
       Max number of intervals for the timetable_edge_finding algorithm to
       propagate. A value of 0 disables the constraint.
       
      optional int32 max_num_intervals_for_timetable_edge_finding = 260 [default = 100];
      Specified by:
      getMaxNumIntervalsForTimetableEdgeFinding in interface SatParametersOrBuilder
      Returns:
      The maxNumIntervalsForTimetableEdgeFinding.
    • setMaxNumIntervalsForTimetableEdgeFinding

      public SatParameters.Builder setMaxNumIntervalsForTimetableEdgeFinding(int value)
       Max number of intervals for the timetable_edge_finding algorithm to
       propagate. A value of 0 disables the constraint.
       
      optional int32 max_num_intervals_for_timetable_edge_finding = 260 [default = 100];
      Parameters:
      value - The maxNumIntervalsForTimetableEdgeFinding to set.
      Returns:
      This builder for chaining.
    • clearMaxNumIntervalsForTimetableEdgeFinding

      public SatParameters.Builder clearMaxNumIntervalsForTimetableEdgeFinding()
       Max number of intervals for the timetable_edge_finding algorithm to
       propagate. A value of 0 disables the constraint.
       
      optional int32 max_num_intervals_for_timetable_edge_finding = 260 [default = 100];
      Returns:
      This builder for chaining.
    • hasUseHardPrecedencesInCumulative

      public boolean hasUseHardPrecedencesInCumulative()
       If true, detect and create constraint for integer variable that are "after"
       a set of intervals in the same cumulative constraint.
      
       Experimental: by default we just use "direct" precedences. If
       exploit_all_precedences is true, we explore the full precedence graph. This
       assumes we have a DAG otherwise it fails.
       
      optional bool use_hard_precedences_in_cumulative = 215 [default = false];
      Specified by:
      hasUseHardPrecedencesInCumulative in interface SatParametersOrBuilder
      Returns:
      Whether the useHardPrecedencesInCumulative field is set.
    • getUseHardPrecedencesInCumulative

      public boolean getUseHardPrecedencesInCumulative()
       If true, detect and create constraint for integer variable that are "after"
       a set of intervals in the same cumulative constraint.
      
       Experimental: by default we just use "direct" precedences. If
       exploit_all_precedences is true, we explore the full precedence graph. This
       assumes we have a DAG otherwise it fails.
       
      optional bool use_hard_precedences_in_cumulative = 215 [default = false];
      Specified by:
      getUseHardPrecedencesInCumulative in interface SatParametersOrBuilder
      Returns:
      The useHardPrecedencesInCumulative.
    • setUseHardPrecedencesInCumulative

      public SatParameters.Builder setUseHardPrecedencesInCumulative(boolean value)
       If true, detect and create constraint for integer variable that are "after"
       a set of intervals in the same cumulative constraint.
      
       Experimental: by default we just use "direct" precedences. If
       exploit_all_precedences is true, we explore the full precedence graph. This
       assumes we have a DAG otherwise it fails.
       
      optional bool use_hard_precedences_in_cumulative = 215 [default = false];
      Parameters:
      value - The useHardPrecedencesInCumulative to set.
      Returns:
      This builder for chaining.
    • clearUseHardPrecedencesInCumulative

      public SatParameters.Builder clearUseHardPrecedencesInCumulative()
       If true, detect and create constraint for integer variable that are "after"
       a set of intervals in the same cumulative constraint.
      
       Experimental: by default we just use "direct" precedences. If
       exploit_all_precedences is true, we explore the full precedence graph. This
       assumes we have a DAG otherwise it fails.
       
      optional bool use_hard_precedences_in_cumulative = 215 [default = false];
      Returns:
      This builder for chaining.
    • hasExploitAllPrecedences

      public boolean hasExploitAllPrecedences()
      optional bool exploit_all_precedences = 220 [default = false];
      Specified by:
      hasExploitAllPrecedences in interface SatParametersOrBuilder
      Returns:
      Whether the exploitAllPrecedences field is set.
    • getExploitAllPrecedences

      public boolean getExploitAllPrecedences()
      optional bool exploit_all_precedences = 220 [default = false];
      Specified by:
      getExploitAllPrecedences in interface SatParametersOrBuilder
      Returns:
      The exploitAllPrecedences.
    • setExploitAllPrecedences

      public SatParameters.Builder setExploitAllPrecedences(boolean value)
      optional bool exploit_all_precedences = 220 [default = false];
      Parameters:
      value - The exploitAllPrecedences to set.
      Returns:
      This builder for chaining.
    • clearExploitAllPrecedences

      public SatParameters.Builder clearExploitAllPrecedences()
      optional bool exploit_all_precedences = 220 [default = false];
      Returns:
      This builder for chaining.
    • hasUseDisjunctiveConstraintInCumulative

      public boolean hasUseDisjunctiveConstraintInCumulative()
       When this is true, the cumulative constraint is reinforced with propagators
       from the disjunctive constraint to improve the inference on a set of tasks
       that are disjunctive at the root of the problem. This additional level
       supplements the default level of reasoning.
      
       Propagators of the cumulative constraint will not be used at all if all the
       tasks are disjunctive at root node.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_disjunctive_constraint_in_cumulative = 80 [default = true];
      Specified by:
      hasUseDisjunctiveConstraintInCumulative in interface SatParametersOrBuilder
      Returns:
      Whether the useDisjunctiveConstraintInCumulative field is set.
    • getUseDisjunctiveConstraintInCumulative

      public boolean getUseDisjunctiveConstraintInCumulative()
       When this is true, the cumulative constraint is reinforced with propagators
       from the disjunctive constraint to improve the inference on a set of tasks
       that are disjunctive at the root of the problem. This additional level
       supplements the default level of reasoning.
      
       Propagators of the cumulative constraint will not be used at all if all the
       tasks are disjunctive at root node.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_disjunctive_constraint_in_cumulative = 80 [default = true];
      Specified by:
      getUseDisjunctiveConstraintInCumulative in interface SatParametersOrBuilder
      Returns:
      The useDisjunctiveConstraintInCumulative.
    • setUseDisjunctiveConstraintInCumulative

      public SatParameters.Builder setUseDisjunctiveConstraintInCumulative(boolean value)
       When this is true, the cumulative constraint is reinforced with propagators
       from the disjunctive constraint to improve the inference on a set of tasks
       that are disjunctive at the root of the problem. This additional level
       supplements the default level of reasoning.
      
       Propagators of the cumulative constraint will not be used at all if all the
       tasks are disjunctive at root node.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_disjunctive_constraint_in_cumulative = 80 [default = true];
      Parameters:
      value - The useDisjunctiveConstraintInCumulative to set.
      Returns:
      This builder for chaining.
    • clearUseDisjunctiveConstraintInCumulative

      public SatParameters.Builder clearUseDisjunctiveConstraintInCumulative()
       When this is true, the cumulative constraint is reinforced with propagators
       from the disjunctive constraint to improve the inference on a set of tasks
       that are disjunctive at the root of the problem. This additional level
       supplements the default level of reasoning.
      
       Propagators of the cumulative constraint will not be used at all if all the
       tasks are disjunctive at root node.
      
       This always result in better propagation, but it is usually slow, so
       depending on the problem, turning this off may lead to a faster solution.
       
      optional bool use_disjunctive_constraint_in_cumulative = 80 [default = true];
      Returns:
      This builder for chaining.
    • hasNoOverlap2DBooleanRelationsLimit

      public boolean hasNoOverlap2DBooleanRelationsLimit()
       If less than this number of boxes are present in a no-overlap 2d, we
       create 4 Booleans per pair of boxes:
       - Box 2 is after Box 1 on x.
       - Box 1 is after Box 2 on x.
       - Box 2 is after Box 1 on y.
       - Box 1 is after Box 2 on y.
      
       Note that at least one of them must be true, and at most one on x and one
       on y can be true.
      
       This can significantly help in closing small problem. The SAT reasoning
       can be a lot more powerful when we take decision on such positional
       relations.
       
      optional int32 no_overlap_2d_boolean_relations_limit = 321 [default = 10];
      Specified by:
      hasNoOverlap2DBooleanRelationsLimit in interface SatParametersOrBuilder
      Returns:
      Whether the noOverlap2dBooleanRelationsLimit field is set.
    • getNoOverlap2DBooleanRelationsLimit

      public int getNoOverlap2DBooleanRelationsLimit()
       If less than this number of boxes are present in a no-overlap 2d, we
       create 4 Booleans per pair of boxes:
       - Box 2 is after Box 1 on x.
       - Box 1 is after Box 2 on x.
       - Box 2 is after Box 1 on y.
       - Box 1 is after Box 2 on y.
      
       Note that at least one of them must be true, and at most one on x and one
       on y can be true.
      
       This can significantly help in closing small problem. The SAT reasoning
       can be a lot more powerful when we take decision on such positional
       relations.
       
      optional int32 no_overlap_2d_boolean_relations_limit = 321 [default = 10];
      Specified by:
      getNoOverlap2DBooleanRelationsLimit in interface SatParametersOrBuilder
      Returns:
      The noOverlap2dBooleanRelationsLimit.
    • setNoOverlap2DBooleanRelationsLimit

      public SatParameters.Builder setNoOverlap2DBooleanRelationsLimit(int value)
       If less than this number of boxes are present in a no-overlap 2d, we
       create 4 Booleans per pair of boxes:
       - Box 2 is after Box 1 on x.
       - Box 1 is after Box 2 on x.
       - Box 2 is after Box 1 on y.
       - Box 1 is after Box 2 on y.
      
       Note that at least one of them must be true, and at most one on x and one
       on y can be true.
      
       This can significantly help in closing small problem. The SAT reasoning
       can be a lot more powerful when we take decision on such positional
       relations.
       
      optional int32 no_overlap_2d_boolean_relations_limit = 321 [default = 10];
      Parameters:
      value - The noOverlap2dBooleanRelationsLimit to set.
      Returns:
      This builder for chaining.
    • clearNoOverlap2DBooleanRelationsLimit

      public SatParameters.Builder clearNoOverlap2DBooleanRelationsLimit()
       If less than this number of boxes are present in a no-overlap 2d, we
       create 4 Booleans per pair of boxes:
       - Box 2 is after Box 1 on x.
       - Box 1 is after Box 2 on x.
       - Box 2 is after Box 1 on y.
       - Box 1 is after Box 2 on y.
      
       Note that at least one of them must be true, and at most one on x and one
       on y can be true.
      
       This can significantly help in closing small problem. The SAT reasoning
       can be a lot more powerful when we take decision on such positional
       relations.
       
      optional int32 no_overlap_2d_boolean_relations_limit = 321 [default = 10];
      Returns:
      This builder for chaining.
    • hasUseTimetablingInNoOverlap2D

      public boolean hasUseTimetablingInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       propagators from the cumulative constraints. It consists of ignoring the
       position of rectangles in one position and projecting the no_overlap_2d on
       the other dimension to create a cumulative constraint. This is done on both
       axis. This additional level supplements the default level of reasoning.
       
      optional bool use_timetabling_in_no_overlap_2d = 200 [default = false];
      Specified by:
      hasUseTimetablingInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the useTimetablingInNoOverlap2d field is set.
    • getUseTimetablingInNoOverlap2D

      public boolean getUseTimetablingInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       propagators from the cumulative constraints. It consists of ignoring the
       position of rectangles in one position and projecting the no_overlap_2d on
       the other dimension to create a cumulative constraint. This is done on both
       axis. This additional level supplements the default level of reasoning.
       
      optional bool use_timetabling_in_no_overlap_2d = 200 [default = false];
      Specified by:
      getUseTimetablingInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The useTimetablingInNoOverlap2d.
    • setUseTimetablingInNoOverlap2D

      public SatParameters.Builder setUseTimetablingInNoOverlap2D(boolean value)
       When this is true, the no_overlap_2d constraint is reinforced with
       propagators from the cumulative constraints. It consists of ignoring the
       position of rectangles in one position and projecting the no_overlap_2d on
       the other dimension to create a cumulative constraint. This is done on both
       axis. This additional level supplements the default level of reasoning.
       
      optional bool use_timetabling_in_no_overlap_2d = 200 [default = false];
      Parameters:
      value - The useTimetablingInNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearUseTimetablingInNoOverlap2D

      public SatParameters.Builder clearUseTimetablingInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       propagators from the cumulative constraints. It consists of ignoring the
       position of rectangles in one position and projecting the no_overlap_2d on
       the other dimension to create a cumulative constraint. This is done on both
       axis. This additional level supplements the default level of reasoning.
       
      optional bool use_timetabling_in_no_overlap_2d = 200 [default = false];
      Returns:
      This builder for chaining.
    • hasUseEnergeticReasoningInNoOverlap2D

      public boolean hasUseEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       energetic reasoning. This additional level supplements the default level of
       reasoning.
       
      optional bool use_energetic_reasoning_in_no_overlap_2d = 213 [default = false];
      Specified by:
      hasUseEnergeticReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the useEnergeticReasoningInNoOverlap2d field is set.
    • getUseEnergeticReasoningInNoOverlap2D

      public boolean getUseEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       energetic reasoning. This additional level supplements the default level of
       reasoning.
       
      optional bool use_energetic_reasoning_in_no_overlap_2d = 213 [default = false];
      Specified by:
      getUseEnergeticReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The useEnergeticReasoningInNoOverlap2d.
    • setUseEnergeticReasoningInNoOverlap2D

      public SatParameters.Builder setUseEnergeticReasoningInNoOverlap2D(boolean value)
       When this is true, the no_overlap_2d constraint is reinforced with
       energetic reasoning. This additional level supplements the default level of
       reasoning.
       
      optional bool use_energetic_reasoning_in_no_overlap_2d = 213 [default = false];
      Parameters:
      value - The useEnergeticReasoningInNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearUseEnergeticReasoningInNoOverlap2D

      public SatParameters.Builder clearUseEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       energetic reasoning. This additional level supplements the default level of
       reasoning.
       
      optional bool use_energetic_reasoning_in_no_overlap_2d = 213 [default = false];
      Returns:
      This builder for chaining.
    • hasUseAreaEnergeticReasoningInNoOverlap2D

      public boolean hasUseAreaEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       an energetic reasoning that uses an area-based energy. This can be combined
       with the two other overlap heuristics above.
       
      optional bool use_area_energetic_reasoning_in_no_overlap_2d = 271 [default = false];
      Specified by:
      hasUseAreaEnergeticReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the useAreaEnergeticReasoningInNoOverlap2d field is set.
    • getUseAreaEnergeticReasoningInNoOverlap2D

      public boolean getUseAreaEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       an energetic reasoning that uses an area-based energy. This can be combined
       with the two other overlap heuristics above.
       
      optional bool use_area_energetic_reasoning_in_no_overlap_2d = 271 [default = false];
      Specified by:
      getUseAreaEnergeticReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The useAreaEnergeticReasoningInNoOverlap2d.
    • setUseAreaEnergeticReasoningInNoOverlap2D

      public SatParameters.Builder setUseAreaEnergeticReasoningInNoOverlap2D(boolean value)
       When this is true, the no_overlap_2d constraint is reinforced with
       an energetic reasoning that uses an area-based energy. This can be combined
       with the two other overlap heuristics above.
       
      optional bool use_area_energetic_reasoning_in_no_overlap_2d = 271 [default = false];
      Parameters:
      value - The useAreaEnergeticReasoningInNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearUseAreaEnergeticReasoningInNoOverlap2D

      public SatParameters.Builder clearUseAreaEnergeticReasoningInNoOverlap2D()
       When this is true, the no_overlap_2d constraint is reinforced with
       an energetic reasoning that uses an area-based energy. This can be combined
       with the two other overlap heuristics above.
       
      optional bool use_area_energetic_reasoning_in_no_overlap_2d = 271 [default = false];
      Returns:
      This builder for chaining.
    • hasUseTryEdgeReasoningInNoOverlap2D

      public boolean hasUseTryEdgeReasoningInNoOverlap2D()
      optional bool use_try_edge_reasoning_in_no_overlap_2d = 299 [default = false];
      Specified by:
      hasUseTryEdgeReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the useTryEdgeReasoningInNoOverlap2d field is set.
    • getUseTryEdgeReasoningInNoOverlap2D

      public boolean getUseTryEdgeReasoningInNoOverlap2D()
      optional bool use_try_edge_reasoning_in_no_overlap_2d = 299 [default = false];
      Specified by:
      getUseTryEdgeReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The useTryEdgeReasoningInNoOverlap2d.
    • setUseTryEdgeReasoningInNoOverlap2D

      public SatParameters.Builder setUseTryEdgeReasoningInNoOverlap2D(boolean value)
      optional bool use_try_edge_reasoning_in_no_overlap_2d = 299 [default = false];
      Parameters:
      value - The useTryEdgeReasoningInNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearUseTryEdgeReasoningInNoOverlap2D

      public SatParameters.Builder clearUseTryEdgeReasoningInNoOverlap2D()
      optional bool use_try_edge_reasoning_in_no_overlap_2d = 299 [default = false];
      Returns:
      This builder for chaining.
    • hasMaxPairsPairwiseReasoningInNoOverlap2D

      public boolean hasMaxPairsPairwiseReasoningInNoOverlap2D()
       If the number of pairs to look is below this threshold, do an extra step of
       propagation in the no_overlap_2d constraint by looking at all pairs of
       intervals.
       
      optional int32 max_pairs_pairwise_reasoning_in_no_overlap_2d = 276 [default = 1250];
      Specified by:
      hasMaxPairsPairwiseReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the maxPairsPairwiseReasoningInNoOverlap2d field is set.
    • getMaxPairsPairwiseReasoningInNoOverlap2D

      public int getMaxPairsPairwiseReasoningInNoOverlap2D()
       If the number of pairs to look is below this threshold, do an extra step of
       propagation in the no_overlap_2d constraint by looking at all pairs of
       intervals.
       
      optional int32 max_pairs_pairwise_reasoning_in_no_overlap_2d = 276 [default = 1250];
      Specified by:
      getMaxPairsPairwiseReasoningInNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The maxPairsPairwiseReasoningInNoOverlap2d.
    • setMaxPairsPairwiseReasoningInNoOverlap2D

      public SatParameters.Builder setMaxPairsPairwiseReasoningInNoOverlap2D(int value)
       If the number of pairs to look is below this threshold, do an extra step of
       propagation in the no_overlap_2d constraint by looking at all pairs of
       intervals.
       
      optional int32 max_pairs_pairwise_reasoning_in_no_overlap_2d = 276 [default = 1250];
      Parameters:
      value - The maxPairsPairwiseReasoningInNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearMaxPairsPairwiseReasoningInNoOverlap2D

      public SatParameters.Builder clearMaxPairsPairwiseReasoningInNoOverlap2D()
       If the number of pairs to look is below this threshold, do an extra step of
       propagation in the no_overlap_2d constraint by looking at all pairs of
       intervals.
       
      optional int32 max_pairs_pairwise_reasoning_in_no_overlap_2d = 276 [default = 1250];
      Returns:
      This builder for chaining.
    • hasMaximumRegionsToSplitInDisconnectedNoOverlap2D

      public boolean hasMaximumRegionsToSplitInDisconnectedNoOverlap2D()
       Detects when the space where items of a no_overlap_2d constraint can placed
       is disjoint (ie., fixed boxes split the domain). When it is the case, we
       can introduce a boolean for each pair <item, component> encoding whether
       the item is in the component or not. Then we replace the original
       no_overlap_2d constraint by one no_overlap_2d constraint for each
       component, with the new booleans as the enforcement_literal of the
       intervals. This is equivalent to expanding the original no_overlap_2d
       constraint into a bin packing problem with each connected component being a
       bin. This heuristic is only done when the number of regions to split
       is less than this parameter and <= 1 disables it.
       
      optional int32 maximum_regions_to_split_in_disconnected_no_overlap_2d = 315 [default = 0];
      Specified by:
      hasMaximumRegionsToSplitInDisconnectedNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      Whether the maximumRegionsToSplitInDisconnectedNoOverlap2d field is set.
    • getMaximumRegionsToSplitInDisconnectedNoOverlap2D

      public int getMaximumRegionsToSplitInDisconnectedNoOverlap2D()
       Detects when the space where items of a no_overlap_2d constraint can placed
       is disjoint (ie., fixed boxes split the domain). When it is the case, we
       can introduce a boolean for each pair <item, component> encoding whether
       the item is in the component or not. Then we replace the original
       no_overlap_2d constraint by one no_overlap_2d constraint for each
       component, with the new booleans as the enforcement_literal of the
       intervals. This is equivalent to expanding the original no_overlap_2d
       constraint into a bin packing problem with each connected component being a
       bin. This heuristic is only done when the number of regions to split
       is less than this parameter and <= 1 disables it.
       
      optional int32 maximum_regions_to_split_in_disconnected_no_overlap_2d = 315 [default = 0];
      Specified by:
      getMaximumRegionsToSplitInDisconnectedNoOverlap2D in interface SatParametersOrBuilder
      Returns:
      The maximumRegionsToSplitInDisconnectedNoOverlap2d.
    • setMaximumRegionsToSplitInDisconnectedNoOverlap2D

      public SatParameters.Builder setMaximumRegionsToSplitInDisconnectedNoOverlap2D(int value)
       Detects when the space where items of a no_overlap_2d constraint can placed
       is disjoint (ie., fixed boxes split the domain). When it is the case, we
       can introduce a boolean for each pair <item, component> encoding whether
       the item is in the component or not. Then we replace the original
       no_overlap_2d constraint by one no_overlap_2d constraint for each
       component, with the new booleans as the enforcement_literal of the
       intervals. This is equivalent to expanding the original no_overlap_2d
       constraint into a bin packing problem with each connected component being a
       bin. This heuristic is only done when the number of regions to split
       is less than this parameter and <= 1 disables it.
       
      optional int32 maximum_regions_to_split_in_disconnected_no_overlap_2d = 315 [default = 0];
      Parameters:
      value - The maximumRegionsToSplitInDisconnectedNoOverlap2d to set.
      Returns:
      This builder for chaining.
    • clearMaximumRegionsToSplitInDisconnectedNoOverlap2D

      public SatParameters.Builder clearMaximumRegionsToSplitInDisconnectedNoOverlap2D()
       Detects when the space where items of a no_overlap_2d constraint can placed
       is disjoint (ie., fixed boxes split the domain). When it is the case, we
       can introduce a boolean for each pair <item, component> encoding whether
       the item is in the component or not. Then we replace the original
       no_overlap_2d constraint by one no_overlap_2d constraint for each
       component, with the new booleans as the enforcement_literal of the
       intervals. This is equivalent to expanding the original no_overlap_2d
       constraint into a bin packing problem with each connected component being a
       bin. This heuristic is only done when the number of regions to split
       is less than this parameter and <= 1 disables it.
       
      optional int32 maximum_regions_to_split_in_disconnected_no_overlap_2d = 315 [default = 0];
      Returns:
      This builder for chaining.
    • hasUseLinear3ForNoOverlap2DPrecedences

      public boolean hasUseLinear3ForNoOverlap2DPrecedences()
       When set, this activates a propagator for the no_overlap_2d constraint that
       uses any eventual linear constraints of the model in the form
       `{start interval 1} - {end interval 2} + c*w <= ub` to detect that two
       intervals must overlap in one dimension for some values of `w`. This is
       particularly useful for problems where the distance between two boxes is
       part of the model.
       
      optional bool use_linear3_for_no_overlap_2d_precedences = 323 [default = true];
      Specified by:
      hasUseLinear3ForNoOverlap2DPrecedences in interface SatParametersOrBuilder
      Returns:
      Whether the useLinear3ForNoOverlap2dPrecedences field is set.
    • getUseLinear3ForNoOverlap2DPrecedences

      public boolean getUseLinear3ForNoOverlap2DPrecedences()
       When set, this activates a propagator for the no_overlap_2d constraint that
       uses any eventual linear constraints of the model in the form
       `{start interval 1} - {end interval 2} + c*w <= ub` to detect that two
       intervals must overlap in one dimension for some values of `w`. This is
       particularly useful for problems where the distance between two boxes is
       part of the model.
       
      optional bool use_linear3_for_no_overlap_2d_precedences = 323 [default = true];
      Specified by:
      getUseLinear3ForNoOverlap2DPrecedences in interface SatParametersOrBuilder
      Returns:
      The useLinear3ForNoOverlap2dPrecedences.
    • setUseLinear3ForNoOverlap2DPrecedences

      public SatParameters.Builder setUseLinear3ForNoOverlap2DPrecedences(boolean value)
       When set, this activates a propagator for the no_overlap_2d constraint that
       uses any eventual linear constraints of the model in the form
       `{start interval 1} - {end interval 2} + c*w <= ub` to detect that two
       intervals must overlap in one dimension for some values of `w`. This is
       particularly useful for problems where the distance between two boxes is
       part of the model.
       
      optional bool use_linear3_for_no_overlap_2d_precedences = 323 [default = true];
      Parameters:
      value - The useLinear3ForNoOverlap2dPrecedences to set.
      Returns:
      This builder for chaining.
    • clearUseLinear3ForNoOverlap2DPrecedences

      public SatParameters.Builder clearUseLinear3ForNoOverlap2DPrecedences()
       When set, this activates a propagator for the no_overlap_2d constraint that
       uses any eventual linear constraints of the model in the form
       `{start interval 1} - {end interval 2} + c*w <= ub` to detect that two
       intervals must overlap in one dimension for some values of `w`. This is
       particularly useful for problems where the distance between two boxes is
       part of the model.
       
      optional bool use_linear3_for_no_overlap_2d_precedences = 323 [default = true];
      Returns:
      This builder for chaining.
    • hasUseDualSchedulingHeuristics

      public boolean hasUseDualSchedulingHeuristics()
       When set, it activates a few scheduling parameters to improve the lower
       bound of scheduling problems. This is only effective with multiple workers
       as it modifies the reduced_cost, lb_tree_search, and probing workers.
       
      optional bool use_dual_scheduling_heuristics = 214 [default = true];
      Specified by:
      hasUseDualSchedulingHeuristics in interface SatParametersOrBuilder
      Returns:
      Whether the useDualSchedulingHeuristics field is set.
    • getUseDualSchedulingHeuristics

      public boolean getUseDualSchedulingHeuristics()
       When set, it activates a few scheduling parameters to improve the lower
       bound of scheduling problems. This is only effective with multiple workers
       as it modifies the reduced_cost, lb_tree_search, and probing workers.
       
      optional bool use_dual_scheduling_heuristics = 214 [default = true];
      Specified by:
      getUseDualSchedulingHeuristics in interface SatParametersOrBuilder
      Returns:
      The useDualSchedulingHeuristics.
    • setUseDualSchedulingHeuristics

      public SatParameters.Builder setUseDualSchedulingHeuristics(boolean value)
       When set, it activates a few scheduling parameters to improve the lower
       bound of scheduling problems. This is only effective with multiple workers
       as it modifies the reduced_cost, lb_tree_search, and probing workers.
       
      optional bool use_dual_scheduling_heuristics = 214 [default = true];
      Parameters:
      value - The useDualSchedulingHeuristics to set.
      Returns:
      This builder for chaining.
    • clearUseDualSchedulingHeuristics

      public SatParameters.Builder clearUseDualSchedulingHeuristics()
       When set, it activates a few scheduling parameters to improve the lower
       bound of scheduling problems. This is only effective with multiple workers
       as it modifies the reduced_cost, lb_tree_search, and probing workers.
       
      optional bool use_dual_scheduling_heuristics = 214 [default = true];
      Returns:
      This builder for chaining.
    • hasUseAllDifferentForCircuit

      public boolean hasUseAllDifferentForCircuit()
       Turn on extra propagation for the circuit constraint.
       This can be quite slow.
       
      optional bool use_all_different_for_circuit = 311 [default = false];
      Specified by:
      hasUseAllDifferentForCircuit in interface SatParametersOrBuilder
      Returns:
      Whether the useAllDifferentForCircuit field is set.
    • getUseAllDifferentForCircuit

      public boolean getUseAllDifferentForCircuit()
       Turn on extra propagation for the circuit constraint.
       This can be quite slow.
       
      optional bool use_all_different_for_circuit = 311 [default = false];
      Specified by:
      getUseAllDifferentForCircuit in interface SatParametersOrBuilder
      Returns:
      The useAllDifferentForCircuit.
    • setUseAllDifferentForCircuit

      public SatParameters.Builder setUseAllDifferentForCircuit(boolean value)
       Turn on extra propagation for the circuit constraint.
       This can be quite slow.
       
      optional bool use_all_different_for_circuit = 311 [default = false];
      Parameters:
      value - The useAllDifferentForCircuit to set.
      Returns:
      This builder for chaining.
    • clearUseAllDifferentForCircuit

      public SatParameters.Builder clearUseAllDifferentForCircuit()
       Turn on extra propagation for the circuit constraint.
       This can be quite slow.
       
      optional bool use_all_different_for_circuit = 311 [default = false];
      Returns:
      This builder for chaining.
    • hasRoutingCutSubsetSizeForBinaryRelationBound

      public boolean hasRoutingCutSubsetSizeForBinaryRelationBound()
       If the size of a subset of nodes of a RoutesConstraint is less than this
       value, use linear constraints of size 1 and 2 (such as capacity and time
       window constraints) enforced by the arc literals to compute cuts for this
       subset (unless the subset size is less than
       routing_cut_subset_size_for_tight_binary_relation_bound, in which case the
       corresponding algorithm is used instead). The algorithm for these cuts has
       a O(n^3) complexity, where n is the subset size. Hence the value of this
       parameter should not be too large (e.g. 10 or 20).
       
      optional int32 routing_cut_subset_size_for_binary_relation_bound = 312 [default = 0];
      Specified by:
      hasRoutingCutSubsetSizeForBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutSubsetSizeForBinaryRelationBound field is set.
    • getRoutingCutSubsetSizeForBinaryRelationBound

      public int getRoutingCutSubsetSizeForBinaryRelationBound()
       If the size of a subset of nodes of a RoutesConstraint is less than this
       value, use linear constraints of size 1 and 2 (such as capacity and time
       window constraints) enforced by the arc literals to compute cuts for this
       subset (unless the subset size is less than
       routing_cut_subset_size_for_tight_binary_relation_bound, in which case the
       corresponding algorithm is used instead). The algorithm for these cuts has
       a O(n^3) complexity, where n is the subset size. Hence the value of this
       parameter should not be too large (e.g. 10 or 20).
       
      optional int32 routing_cut_subset_size_for_binary_relation_bound = 312 [default = 0];
      Specified by:
      getRoutingCutSubsetSizeForBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      The routingCutSubsetSizeForBinaryRelationBound.
    • setRoutingCutSubsetSizeForBinaryRelationBound

      public SatParameters.Builder setRoutingCutSubsetSizeForBinaryRelationBound(int value)
       If the size of a subset of nodes of a RoutesConstraint is less than this
       value, use linear constraints of size 1 and 2 (such as capacity and time
       window constraints) enforced by the arc literals to compute cuts for this
       subset (unless the subset size is less than
       routing_cut_subset_size_for_tight_binary_relation_bound, in which case the
       corresponding algorithm is used instead). The algorithm for these cuts has
       a O(n^3) complexity, where n is the subset size. Hence the value of this
       parameter should not be too large (e.g. 10 or 20).
       
      optional int32 routing_cut_subset_size_for_binary_relation_bound = 312 [default = 0];
      Parameters:
      value - The routingCutSubsetSizeForBinaryRelationBound to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutSubsetSizeForBinaryRelationBound

      public SatParameters.Builder clearRoutingCutSubsetSizeForBinaryRelationBound()
       If the size of a subset of nodes of a RoutesConstraint is less than this
       value, use linear constraints of size 1 and 2 (such as capacity and time
       window constraints) enforced by the arc literals to compute cuts for this
       subset (unless the subset size is less than
       routing_cut_subset_size_for_tight_binary_relation_bound, in which case the
       corresponding algorithm is used instead). The algorithm for these cuts has
       a O(n^3) complexity, where n is the subset size. Hence the value of this
       parameter should not be too large (e.g. 10 or 20).
       
      optional int32 routing_cut_subset_size_for_binary_relation_bound = 312 [default = 0];
      Returns:
      This builder for chaining.
    • hasRoutingCutSubsetSizeForTightBinaryRelationBound

      public boolean hasRoutingCutSubsetSizeForTightBinaryRelationBound()
       Similar to above, but with a different algorithm producing better cuts, at
       the price of a higher O(2^n) complexity, where n is the subset size. Hence
       the value of this parameter should be small (e.g. less than 10).
       
      optional int32 routing_cut_subset_size_for_tight_binary_relation_bound = 313 [default = 0];
      Specified by:
      hasRoutingCutSubsetSizeForTightBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutSubsetSizeForTightBinaryRelationBound field is set.
    • getRoutingCutSubsetSizeForTightBinaryRelationBound

      public int getRoutingCutSubsetSizeForTightBinaryRelationBound()
       Similar to above, but with a different algorithm producing better cuts, at
       the price of a higher O(2^n) complexity, where n is the subset size. Hence
       the value of this parameter should be small (e.g. less than 10).
       
      optional int32 routing_cut_subset_size_for_tight_binary_relation_bound = 313 [default = 0];
      Specified by:
      getRoutingCutSubsetSizeForTightBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      The routingCutSubsetSizeForTightBinaryRelationBound.
    • setRoutingCutSubsetSizeForTightBinaryRelationBound

      public SatParameters.Builder setRoutingCutSubsetSizeForTightBinaryRelationBound(int value)
       Similar to above, but with a different algorithm producing better cuts, at
       the price of a higher O(2^n) complexity, where n is the subset size. Hence
       the value of this parameter should be small (e.g. less than 10).
       
      optional int32 routing_cut_subset_size_for_tight_binary_relation_bound = 313 [default = 0];
      Parameters:
      value - The routingCutSubsetSizeForTightBinaryRelationBound to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutSubsetSizeForTightBinaryRelationBound

      public SatParameters.Builder clearRoutingCutSubsetSizeForTightBinaryRelationBound()
       Similar to above, but with a different algorithm producing better cuts, at
       the price of a higher O(2^n) complexity, where n is the subset size. Hence
       the value of this parameter should be small (e.g. less than 10).
       
      optional int32 routing_cut_subset_size_for_tight_binary_relation_bound = 313 [default = 0];
      Returns:
      This builder for chaining.
    • hasRoutingCutSubsetSizeForExactBinaryRelationBound

      public boolean hasRoutingCutSubsetSizeForExactBinaryRelationBound()
       Similar to above, but with an even stronger algorithm in O(n!). We try to
       be defensive and abort early or not run that often. Still the value of
       that parameter shouldn't really be much more than 10.
       
      optional int32 routing_cut_subset_size_for_exact_binary_relation_bound = 316 [default = 8];
      Specified by:
      hasRoutingCutSubsetSizeForExactBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutSubsetSizeForExactBinaryRelationBound field is set.
    • getRoutingCutSubsetSizeForExactBinaryRelationBound

      public int getRoutingCutSubsetSizeForExactBinaryRelationBound()
       Similar to above, but with an even stronger algorithm in O(n!). We try to
       be defensive and abort early or not run that often. Still the value of
       that parameter shouldn't really be much more than 10.
       
      optional int32 routing_cut_subset_size_for_exact_binary_relation_bound = 316 [default = 8];
      Specified by:
      getRoutingCutSubsetSizeForExactBinaryRelationBound in interface SatParametersOrBuilder
      Returns:
      The routingCutSubsetSizeForExactBinaryRelationBound.
    • setRoutingCutSubsetSizeForExactBinaryRelationBound

      public SatParameters.Builder setRoutingCutSubsetSizeForExactBinaryRelationBound(int value)
       Similar to above, but with an even stronger algorithm in O(n!). We try to
       be defensive and abort early or not run that often. Still the value of
       that parameter shouldn't really be much more than 10.
       
      optional int32 routing_cut_subset_size_for_exact_binary_relation_bound = 316 [default = 8];
      Parameters:
      value - The routingCutSubsetSizeForExactBinaryRelationBound to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutSubsetSizeForExactBinaryRelationBound

      public SatParameters.Builder clearRoutingCutSubsetSizeForExactBinaryRelationBound()
       Similar to above, but with an even stronger algorithm in O(n!). We try to
       be defensive and abort early or not run that often. Still the value of
       that parameter shouldn't really be much more than 10.
       
      optional int32 routing_cut_subset_size_for_exact_binary_relation_bound = 316 [default = 8];
      Returns:
      This builder for chaining.
    • hasRoutingCutSubsetSizeForShortestPathsBound

      public boolean hasRoutingCutSubsetSizeForShortestPathsBound()
       Similar to routing_cut_subset_size_for_exact_binary_relation_bound but
       use a bound based on shortest path distances (which respect triangular
       inequality). This allows to derive bounds that are valid for any superset
       of a given subset. This is slow, so it shouldn't really be larger than 10.
       
      optional int32 routing_cut_subset_size_for_shortest_paths_bound = 318 [default = 8];
      Specified by:
      hasRoutingCutSubsetSizeForShortestPathsBound in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutSubsetSizeForShortestPathsBound field is set.
    • getRoutingCutSubsetSizeForShortestPathsBound

      public int getRoutingCutSubsetSizeForShortestPathsBound()
       Similar to routing_cut_subset_size_for_exact_binary_relation_bound but
       use a bound based on shortest path distances (which respect triangular
       inequality). This allows to derive bounds that are valid for any superset
       of a given subset. This is slow, so it shouldn't really be larger than 10.
       
      optional int32 routing_cut_subset_size_for_shortest_paths_bound = 318 [default = 8];
      Specified by:
      getRoutingCutSubsetSizeForShortestPathsBound in interface SatParametersOrBuilder
      Returns:
      The routingCutSubsetSizeForShortestPathsBound.
    • setRoutingCutSubsetSizeForShortestPathsBound

      public SatParameters.Builder setRoutingCutSubsetSizeForShortestPathsBound(int value)
       Similar to routing_cut_subset_size_for_exact_binary_relation_bound but
       use a bound based on shortest path distances (which respect triangular
       inequality). This allows to derive bounds that are valid for any superset
       of a given subset. This is slow, so it shouldn't really be larger than 10.
       
      optional int32 routing_cut_subset_size_for_shortest_paths_bound = 318 [default = 8];
      Parameters:
      value - The routingCutSubsetSizeForShortestPathsBound to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutSubsetSizeForShortestPathsBound

      public SatParameters.Builder clearRoutingCutSubsetSizeForShortestPathsBound()
       Similar to routing_cut_subset_size_for_exact_binary_relation_bound but
       use a bound based on shortest path distances (which respect triangular
       inequality). This allows to derive bounds that are valid for any superset
       of a given subset. This is slow, so it shouldn't really be larger than 10.
       
      optional int32 routing_cut_subset_size_for_shortest_paths_bound = 318 [default = 8];
      Returns:
      This builder for chaining.
    • hasRoutingCutDpEffort

      public boolean hasRoutingCutDpEffort()
       The amount of "effort" to spend in dynamic programming for computing
       routing cuts. This is in term of basic operations needed by the algorithm
       in the worst case, so a value like 1e8 should take less than a second to
       compute.
       
      optional double routing_cut_dp_effort = 314 [default = 10000000];
      Specified by:
      hasRoutingCutDpEffort in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutDpEffort field is set.
    • getRoutingCutDpEffort

      public double getRoutingCutDpEffort()
       The amount of "effort" to spend in dynamic programming for computing
       routing cuts. This is in term of basic operations needed by the algorithm
       in the worst case, so a value like 1e8 should take less than a second to
       compute.
       
      optional double routing_cut_dp_effort = 314 [default = 10000000];
      Specified by:
      getRoutingCutDpEffort in interface SatParametersOrBuilder
      Returns:
      The routingCutDpEffort.
    • setRoutingCutDpEffort

      public SatParameters.Builder setRoutingCutDpEffort(double value)
       The amount of "effort" to spend in dynamic programming for computing
       routing cuts. This is in term of basic operations needed by the algorithm
       in the worst case, so a value like 1e8 should take less than a second to
       compute.
       
      optional double routing_cut_dp_effort = 314 [default = 10000000];
      Parameters:
      value - The routingCutDpEffort to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutDpEffort

      public SatParameters.Builder clearRoutingCutDpEffort()
       The amount of "effort" to spend in dynamic programming for computing
       routing cuts. This is in term of basic operations needed by the algorithm
       in the worst case, so a value like 1e8 should take less than a second to
       compute.
       
      optional double routing_cut_dp_effort = 314 [default = 10000000];
      Returns:
      This builder for chaining.
    • hasRoutingCutMaxInfeasiblePathLength

      public boolean hasRoutingCutMaxInfeasiblePathLength()
       If the length of an infeasible path is less than this value, a cut will be
       added to exclude it.
       
      optional int32 routing_cut_max_infeasible_path_length = 317 [default = 6];
      Specified by:
      hasRoutingCutMaxInfeasiblePathLength in interface SatParametersOrBuilder
      Returns:
      Whether the routingCutMaxInfeasiblePathLength field is set.
    • getRoutingCutMaxInfeasiblePathLength

      public int getRoutingCutMaxInfeasiblePathLength()
       If the length of an infeasible path is less than this value, a cut will be
       added to exclude it.
       
      optional int32 routing_cut_max_infeasible_path_length = 317 [default = 6];
      Specified by:
      getRoutingCutMaxInfeasiblePathLength in interface SatParametersOrBuilder
      Returns:
      The routingCutMaxInfeasiblePathLength.
    • setRoutingCutMaxInfeasiblePathLength

      public SatParameters.Builder setRoutingCutMaxInfeasiblePathLength(int value)
       If the length of an infeasible path is less than this value, a cut will be
       added to exclude it.
       
      optional int32 routing_cut_max_infeasible_path_length = 317 [default = 6];
      Parameters:
      value - The routingCutMaxInfeasiblePathLength to set.
      Returns:
      This builder for chaining.
    • clearRoutingCutMaxInfeasiblePathLength

      public SatParameters.Builder clearRoutingCutMaxInfeasiblePathLength()
       If the length of an infeasible path is less than this value, a cut will be
       added to exclude it.
       
      optional int32 routing_cut_max_infeasible_path_length = 317 [default = 6];
      Returns:
      This builder for chaining.
    • hasSearchBranching

      public boolean hasSearchBranching()
      optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTOMATIC_SEARCH];
      Specified by:
      hasSearchBranching in interface SatParametersOrBuilder
      Returns:
      Whether the searchBranching field is set.
    • getSearchBranching

      public SatParameters.SearchBranching getSearchBranching()
      optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTOMATIC_SEARCH];
      Specified by:
      getSearchBranching in interface SatParametersOrBuilder
      Returns:
      The searchBranching.
    • setSearchBranching

      public SatParameters.Builder setSearchBranching(SatParameters.SearchBranching value)
      optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTOMATIC_SEARCH];
      Parameters:
      value - The searchBranching to set.
      Returns:
      This builder for chaining.
    • clearSearchBranching

      public SatParameters.Builder clearSearchBranching()
      optional .operations_research.sat.SatParameters.SearchBranching search_branching = 82 [default = AUTOMATIC_SEARCH];
      Returns:
      This builder for chaining.
    • hasHintConflictLimit

      public boolean hasHintConflictLimit()
       Conflict limit used in the phase that exploit the solution hint.
       
      optional int32 hint_conflict_limit = 153 [default = 10];
      Specified by:
      hasHintConflictLimit in interface SatParametersOrBuilder
      Returns:
      Whether the hintConflictLimit field is set.
    • getHintConflictLimit

      public int getHintConflictLimit()
       Conflict limit used in the phase that exploit the solution hint.
       
      optional int32 hint_conflict_limit = 153 [default = 10];
      Specified by:
      getHintConflictLimit in interface SatParametersOrBuilder
      Returns:
      The hintConflictLimit.
    • setHintConflictLimit

      public SatParameters.Builder setHintConflictLimit(int value)
       Conflict limit used in the phase that exploit the solution hint.
       
      optional int32 hint_conflict_limit = 153 [default = 10];
      Parameters:
      value - The hintConflictLimit to set.
      Returns:
      This builder for chaining.
    • clearHintConflictLimit

      public SatParameters.Builder clearHintConflictLimit()
       Conflict limit used in the phase that exploit the solution hint.
       
      optional int32 hint_conflict_limit = 153 [default = 10];
      Returns:
      This builder for chaining.
    • hasRepairHint

      public boolean hasRepairHint()
       If true, the solver tries to repair the solution given in the hint. This
       search terminates after the 'hint_conflict_limit' is reached and the solver
       switches to regular search. If false, then  we do a FIXED_SEARCH using the
       hint until the hint_conflict_limit is reached.
       
      optional bool repair_hint = 167 [default = false];
      Specified by:
      hasRepairHint in interface SatParametersOrBuilder
      Returns:
      Whether the repairHint field is set.
    • getRepairHint

      public boolean getRepairHint()
       If true, the solver tries to repair the solution given in the hint. This
       search terminates after the 'hint_conflict_limit' is reached and the solver
       switches to regular search. If false, then  we do a FIXED_SEARCH using the
       hint until the hint_conflict_limit is reached.
       
      optional bool repair_hint = 167 [default = false];
      Specified by:
      getRepairHint in interface SatParametersOrBuilder
      Returns:
      The repairHint.
    • setRepairHint

      public SatParameters.Builder setRepairHint(boolean value)
       If true, the solver tries to repair the solution given in the hint. This
       search terminates after the 'hint_conflict_limit' is reached and the solver
       switches to regular search. If false, then  we do a FIXED_SEARCH using the
       hint until the hint_conflict_limit is reached.
       
      optional bool repair_hint = 167 [default = false];
      Parameters:
      value - The repairHint to set.
      Returns:
      This builder for chaining.
    • clearRepairHint

      public SatParameters.Builder clearRepairHint()
       If true, the solver tries to repair the solution given in the hint. This
       search terminates after the 'hint_conflict_limit' is reached and the solver
       switches to regular search. If false, then  we do a FIXED_SEARCH using the
       hint until the hint_conflict_limit is reached.
       
      optional bool repair_hint = 167 [default = false];
      Returns:
      This builder for chaining.
    • hasFixVariablesToTheirHintedValue

      public boolean hasFixVariablesToTheirHintedValue()
       If true, variables appearing in the solution hints will be fixed to their
       hinted value.
       
      optional bool fix_variables_to_their_hinted_value = 192 [default = false];
      Specified by:
      hasFixVariablesToTheirHintedValue in interface SatParametersOrBuilder
      Returns:
      Whether the fixVariablesToTheirHintedValue field is set.
    • getFixVariablesToTheirHintedValue

      public boolean getFixVariablesToTheirHintedValue()
       If true, variables appearing in the solution hints will be fixed to their
       hinted value.
       
      optional bool fix_variables_to_their_hinted_value = 192 [default = false];
      Specified by:
      getFixVariablesToTheirHintedValue in interface SatParametersOrBuilder
      Returns:
      The fixVariablesToTheirHintedValue.
    • setFixVariablesToTheirHintedValue

      public SatParameters.Builder setFixVariablesToTheirHintedValue(boolean value)
       If true, variables appearing in the solution hints will be fixed to their
       hinted value.
       
      optional bool fix_variables_to_their_hinted_value = 192 [default = false];
      Parameters:
      value - The fixVariablesToTheirHintedValue to set.
      Returns:
      This builder for chaining.
    • clearFixVariablesToTheirHintedValue

      public SatParameters.Builder clearFixVariablesToTheirHintedValue()
       If true, variables appearing in the solution hints will be fixed to their
       hinted value.
       
      optional bool fix_variables_to_their_hinted_value = 192 [default = false];
      Returns:
      This builder for chaining.
    • hasUseProbingSearch

      public boolean hasUseProbingSearch()
       If true, search will continuously probe Boolean variables, and integer
       variable bounds. This parameter is set to true in parallel on the probing
       worker.
       
      optional bool use_probing_search = 176 [default = false];
      Specified by:
      hasUseProbingSearch in interface SatParametersOrBuilder
      Returns:
      Whether the useProbingSearch field is set.
    • getUseProbingSearch

      public boolean getUseProbingSearch()
       If true, search will continuously probe Boolean variables, and integer
       variable bounds. This parameter is set to true in parallel on the probing
       worker.
       
      optional bool use_probing_search = 176 [default = false];
      Specified by:
      getUseProbingSearch in interface SatParametersOrBuilder
      Returns:
      The useProbingSearch.
    • setUseProbingSearch

      public SatParameters.Builder setUseProbingSearch(boolean value)
       If true, search will continuously probe Boolean variables, and integer
       variable bounds. This parameter is set to true in parallel on the probing
       worker.
       
      optional bool use_probing_search = 176 [default = false];
      Parameters:
      value - The useProbingSearch to set.
      Returns:
      This builder for chaining.
    • clearUseProbingSearch

      public SatParameters.Builder clearUseProbingSearch()
       If true, search will continuously probe Boolean variables, and integer
       variable bounds. This parameter is set to true in parallel on the probing
       worker.
       
      optional bool use_probing_search = 176 [default = false];
      Returns:
      This builder for chaining.
    • hasUseExtendedProbing

      public boolean hasUseExtendedProbing()
       Use extended probing (probe bool_or, at_most_one, exactly_one).
       
      optional bool use_extended_probing = 269 [default = true];
      Specified by:
      hasUseExtendedProbing in interface SatParametersOrBuilder
      Returns:
      Whether the useExtendedProbing field is set.
    • getUseExtendedProbing

      public boolean getUseExtendedProbing()
       Use extended probing (probe bool_or, at_most_one, exactly_one).
       
      optional bool use_extended_probing = 269 [default = true];
      Specified by:
      getUseExtendedProbing in interface SatParametersOrBuilder
      Returns:
      The useExtendedProbing.
    • setUseExtendedProbing

      public SatParameters.Builder setUseExtendedProbing(boolean value)
       Use extended probing (probe bool_or, at_most_one, exactly_one).
       
      optional bool use_extended_probing = 269 [default = true];
      Parameters:
      value - The useExtendedProbing to set.
      Returns:
      This builder for chaining.
    • clearUseExtendedProbing

      public SatParameters.Builder clearUseExtendedProbing()
       Use extended probing (probe bool_or, at_most_one, exactly_one).
       
      optional bool use_extended_probing = 269 [default = true];
      Returns:
      This builder for chaining.
    • hasProbingNumCombinationsLimit

      public boolean hasProbingNumCombinationsLimit()
       How many combinations of pairs or triplets of variables we want to scan.
       
      optional int32 probing_num_combinations_limit = 272 [default = 20000];
      Specified by:
      hasProbingNumCombinationsLimit in interface SatParametersOrBuilder
      Returns:
      Whether the probingNumCombinationsLimit field is set.
    • getProbingNumCombinationsLimit

      public int getProbingNumCombinationsLimit()
       How many combinations of pairs or triplets of variables we want to scan.
       
      optional int32 probing_num_combinations_limit = 272 [default = 20000];
      Specified by:
      getProbingNumCombinationsLimit in interface SatParametersOrBuilder
      Returns:
      The probingNumCombinationsLimit.
    • setProbingNumCombinationsLimit

      public SatParameters.Builder setProbingNumCombinationsLimit(int value)
       How many combinations of pairs or triplets of variables we want to scan.
       
      optional int32 probing_num_combinations_limit = 272 [default = 20000];
      Parameters:
      value - The probingNumCombinationsLimit to set.
      Returns:
      This builder for chaining.
    • clearProbingNumCombinationsLimit

      public SatParameters.Builder clearProbingNumCombinationsLimit()
       How many combinations of pairs or triplets of variables we want to scan.
       
      optional int32 probing_num_combinations_limit = 272 [default = 20000];
      Returns:
      This builder for chaining.
    • hasShavingDeterministicTimeInProbingSearch

      public boolean hasShavingDeterministicTimeInProbingSearch()
       Add a shaving phase (where the solver tries to prove that the lower or
       upper bound of a variable are infeasible) to the probing search. (<= 0
       disables it).
       
      optional double shaving_deterministic_time_in_probing_search = 204 [default = 0.001];
      Specified by:
      hasShavingDeterministicTimeInProbingSearch in interface SatParametersOrBuilder
      Returns:
      Whether the shavingDeterministicTimeInProbingSearch field is set.
    • getShavingDeterministicTimeInProbingSearch

      public double getShavingDeterministicTimeInProbingSearch()
       Add a shaving phase (where the solver tries to prove that the lower or
       upper bound of a variable are infeasible) to the probing search. (<= 0
       disables it).
       
      optional double shaving_deterministic_time_in_probing_search = 204 [default = 0.001];
      Specified by:
      getShavingDeterministicTimeInProbingSearch in interface SatParametersOrBuilder
      Returns:
      The shavingDeterministicTimeInProbingSearch.
    • setShavingDeterministicTimeInProbingSearch

      public SatParameters.Builder setShavingDeterministicTimeInProbingSearch(double value)
       Add a shaving phase (where the solver tries to prove that the lower or
       upper bound of a variable are infeasible) to the probing search. (<= 0
       disables it).
       
      optional double shaving_deterministic_time_in_probing_search = 204 [default = 0.001];
      Parameters:
      value - The shavingDeterministicTimeInProbingSearch to set.
      Returns:
      This builder for chaining.
    • clearShavingDeterministicTimeInProbingSearch

      public SatParameters.Builder clearShavingDeterministicTimeInProbingSearch()
       Add a shaving phase (where the solver tries to prove that the lower or
       upper bound of a variable are infeasible) to the probing search. (<= 0
       disables it).
       
      optional double shaving_deterministic_time_in_probing_search = 204 [default = 0.001];
      Returns:
      This builder for chaining.
    • hasShavingSearchDeterministicTime

      public boolean hasShavingSearchDeterministicTime()
       Specifies the amount of deterministic time spent of each try at shaving a
       bound in the shaving search.
       
      optional double shaving_search_deterministic_time = 205 [default = 0.1];
      Specified by:
      hasShavingSearchDeterministicTime in interface SatParametersOrBuilder
      Returns:
      Whether the shavingSearchDeterministicTime field is set.
    • getShavingSearchDeterministicTime

      public double getShavingSearchDeterministicTime()
       Specifies the amount of deterministic time spent of each try at shaving a
       bound in the shaving search.
       
      optional double shaving_search_deterministic_time = 205 [default = 0.1];
      Specified by:
      getShavingSearchDeterministicTime in interface SatParametersOrBuilder
      Returns:
      The shavingSearchDeterministicTime.
    • setShavingSearchDeterministicTime

      public SatParameters.Builder setShavingSearchDeterministicTime(double value)
       Specifies the amount of deterministic time spent of each try at shaving a
       bound in the shaving search.
       
      optional double shaving_search_deterministic_time = 205 [default = 0.1];
      Parameters:
      value - The shavingSearchDeterministicTime to set.
      Returns:
      This builder for chaining.
    • clearShavingSearchDeterministicTime

      public SatParameters.Builder clearShavingSearchDeterministicTime()
       Specifies the amount of deterministic time spent of each try at shaving a
       bound in the shaving search.
       
      optional double shaving_search_deterministic_time = 205 [default = 0.1];
      Returns:
      This builder for chaining.
    • hasShavingSearchThreshold

      public boolean hasShavingSearchThreshold()
       Specifies the threshold between two modes in the shaving procedure.
       If the range of the variable/objective is less than this threshold, then
       the shaving procedure will try to remove values one by one. Otherwise, it
       will try to remove one range at a time.
       
      optional int64 shaving_search_threshold = 290 [default = 64];
      Specified by:
      hasShavingSearchThreshold in interface SatParametersOrBuilder
      Returns:
      Whether the shavingSearchThreshold field is set.
    • getShavingSearchThreshold

      public long getShavingSearchThreshold()
       Specifies the threshold between two modes in the shaving procedure.
       If the range of the variable/objective is less than this threshold, then
       the shaving procedure will try to remove values one by one. Otherwise, it
       will try to remove one range at a time.
       
      optional int64 shaving_search_threshold = 290 [default = 64];
      Specified by:
      getShavingSearchThreshold in interface SatParametersOrBuilder
      Returns:
      The shavingSearchThreshold.
    • setShavingSearchThreshold

      public SatParameters.Builder setShavingSearchThreshold(long value)
       Specifies the threshold between two modes in the shaving procedure.
       If the range of the variable/objective is less than this threshold, then
       the shaving procedure will try to remove values one by one. Otherwise, it
       will try to remove one range at a time.
       
      optional int64 shaving_search_threshold = 290 [default = 64];
      Parameters:
      value - The shavingSearchThreshold to set.
      Returns:
      This builder for chaining.
    • clearShavingSearchThreshold

      public SatParameters.Builder clearShavingSearchThreshold()
       Specifies the threshold between two modes in the shaving procedure.
       If the range of the variable/objective is less than this threshold, then
       the shaving procedure will try to remove values one by one. Otherwise, it
       will try to remove one range at a time.
       
      optional int64 shaving_search_threshold = 290 [default = 64];
      Returns:
      This builder for chaining.
    • hasUseObjectiveLbSearch

      public boolean hasUseObjectiveLbSearch()
       If true, search will search in ascending max objective value (when
       minimizing) starting from the lower bound of the objective.
       
      optional bool use_objective_lb_search = 228 [default = false];
      Specified by:
      hasUseObjectiveLbSearch in interface SatParametersOrBuilder
      Returns:
      Whether the useObjectiveLbSearch field is set.
    • getUseObjectiveLbSearch

      public boolean getUseObjectiveLbSearch()
       If true, search will search in ascending max objective value (when
       minimizing) starting from the lower bound of the objective.
       
      optional bool use_objective_lb_search = 228 [default = false];
      Specified by:
      getUseObjectiveLbSearch in interface SatParametersOrBuilder
      Returns:
      The useObjectiveLbSearch.
    • setUseObjectiveLbSearch

      public SatParameters.Builder setUseObjectiveLbSearch(boolean value)
       If true, search will search in ascending max objective value (when
       minimizing) starting from the lower bound of the objective.
       
      optional bool use_objective_lb_search = 228 [default = false];
      Parameters:
      value - The useObjectiveLbSearch to set.
      Returns:
      This builder for chaining.
    • clearUseObjectiveLbSearch

      public SatParameters.Builder clearUseObjectiveLbSearch()
       If true, search will search in ascending max objective value (when
       minimizing) starting from the lower bound of the objective.
       
      optional bool use_objective_lb_search = 228 [default = false];
      Returns:
      This builder for chaining.
    • hasUseObjectiveShavingSearch

      public boolean hasUseObjectiveShavingSearch()
       This search differs from the previous search as it will not use assumptions
       to bound the objective, and it will recreate a full model with the
       hardcoded objective value.
       
      optional bool use_objective_shaving_search = 253 [default = false];
      Specified by:
      hasUseObjectiveShavingSearch in interface SatParametersOrBuilder
      Returns:
      Whether the useObjectiveShavingSearch field is set.
    • getUseObjectiveShavingSearch

      public boolean getUseObjectiveShavingSearch()
       This search differs from the previous search as it will not use assumptions
       to bound the objective, and it will recreate a full model with the
       hardcoded objective value.
       
      optional bool use_objective_shaving_search = 253 [default = false];
      Specified by:
      getUseObjectiveShavingSearch in interface SatParametersOrBuilder
      Returns:
      The useObjectiveShavingSearch.
    • setUseObjectiveShavingSearch

      public SatParameters.Builder setUseObjectiveShavingSearch(boolean value)
       This search differs from the previous search as it will not use assumptions
       to bound the objective, and it will recreate a full model with the
       hardcoded objective value.
       
      optional bool use_objective_shaving_search = 253 [default = false];
      Parameters:
      value - The useObjectiveShavingSearch to set.
      Returns:
      This builder for chaining.
    • clearUseObjectiveShavingSearch

      public SatParameters.Builder clearUseObjectiveShavingSearch()
       This search differs from the previous search as it will not use assumptions
       to bound the objective, and it will recreate a full model with the
       hardcoded objective value.
       
      optional bool use_objective_shaving_search = 253 [default = false];
      Returns:
      This builder for chaining.
    • hasVariablesShavingLevel

      public boolean hasVariablesShavingLevel()
       This search takes all Boolean or integer variables, and maximize or
       minimize them in order to reduce their domain. -1 is automatic, otherwise
       value 0 disables it, and 1, 2, or 3 changes something.
       
      optional int32 variables_shaving_level = 289 [default = -1];
      Specified by:
      hasVariablesShavingLevel in interface SatParametersOrBuilder
      Returns:
      Whether the variablesShavingLevel field is set.
    • getVariablesShavingLevel

      public int getVariablesShavingLevel()
       This search takes all Boolean or integer variables, and maximize or
       minimize them in order to reduce their domain. -1 is automatic, otherwise
       value 0 disables it, and 1, 2, or 3 changes something.
       
      optional int32 variables_shaving_level = 289 [default = -1];
      Specified by:
      getVariablesShavingLevel in interface SatParametersOrBuilder
      Returns:
      The variablesShavingLevel.
    • setVariablesShavingLevel

      public SatParameters.Builder setVariablesShavingLevel(int value)
       This search takes all Boolean or integer variables, and maximize or
       minimize them in order to reduce their domain. -1 is automatic, otherwise
       value 0 disables it, and 1, 2, or 3 changes something.
       
      optional int32 variables_shaving_level = 289 [default = -1];
      Parameters:
      value - The variablesShavingLevel to set.
      Returns:
      This builder for chaining.
    • clearVariablesShavingLevel

      public SatParameters.Builder clearVariablesShavingLevel()
       This search takes all Boolean or integer variables, and maximize or
       minimize them in order to reduce their domain. -1 is automatic, otherwise
       value 0 disables it, and 1, 2, or 3 changes something.
       
      optional int32 variables_shaving_level = 289 [default = -1];
      Returns:
      This builder for chaining.
    • hasPseudoCostReliabilityThreshold

      public boolean hasPseudoCostReliabilityThreshold()
       The solver ignores the pseudo costs of variables with number of recordings
       less than this threshold.
       
      optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
      Specified by:
      hasPseudoCostReliabilityThreshold in interface SatParametersOrBuilder
      Returns:
      Whether the pseudoCostReliabilityThreshold field is set.
    • getPseudoCostReliabilityThreshold

      public long getPseudoCostReliabilityThreshold()
       The solver ignores the pseudo costs of variables with number of recordings
       less than this threshold.
       
      optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
      Specified by:
      getPseudoCostReliabilityThreshold in interface SatParametersOrBuilder
      Returns:
      The pseudoCostReliabilityThreshold.
    • setPseudoCostReliabilityThreshold

      public SatParameters.Builder setPseudoCostReliabilityThreshold(long value)
       The solver ignores the pseudo costs of variables with number of recordings
       less than this threshold.
       
      optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
      Parameters:
      value - The pseudoCostReliabilityThreshold to set.
      Returns:
      This builder for chaining.
    • clearPseudoCostReliabilityThreshold

      public SatParameters.Builder clearPseudoCostReliabilityThreshold()
       The solver ignores the pseudo costs of variables with number of recordings
       less than this threshold.
       
      optional int64 pseudo_cost_reliability_threshold = 123 [default = 100];
      Returns:
      This builder for chaining.
    • hasOptimizeWithCore

      public boolean hasOptimizeWithCore()
       The default optimization method is a simple "linear scan", each time trying
       to find a better solution than the previous one. If this is true, then we
       use a core-based approach (like in max-SAT) when we try to increase the
       lower bound instead.
       
      optional bool optimize_with_core = 83 [default = false];
      Specified by:
      hasOptimizeWithCore in interface SatParametersOrBuilder
      Returns:
      Whether the optimizeWithCore field is set.
    • getOptimizeWithCore

      public boolean getOptimizeWithCore()
       The default optimization method is a simple "linear scan", each time trying
       to find a better solution than the previous one. If this is true, then we
       use a core-based approach (like in max-SAT) when we try to increase the
       lower bound instead.
       
      optional bool optimize_with_core = 83 [default = false];
      Specified by:
      getOptimizeWithCore in interface SatParametersOrBuilder
      Returns:
      The optimizeWithCore.
    • setOptimizeWithCore

      public SatParameters.Builder setOptimizeWithCore(boolean value)
       The default optimization method is a simple "linear scan", each time trying
       to find a better solution than the previous one. If this is true, then we
       use a core-based approach (like in max-SAT) when we try to increase the
       lower bound instead.
       
      optional bool optimize_with_core = 83 [default = false];
      Parameters:
      value - The optimizeWithCore to set.
      Returns:
      This builder for chaining.
    • clearOptimizeWithCore

      public SatParameters.Builder clearOptimizeWithCore()
       The default optimization method is a simple "linear scan", each time trying
       to find a better solution than the previous one. If this is true, then we
       use a core-based approach (like in max-SAT) when we try to increase the
       lower bound instead.
       
      optional bool optimize_with_core = 83 [default = false];
      Returns:
      This builder for chaining.
    • hasOptimizeWithLbTreeSearch

      public boolean hasOptimizeWithLbTreeSearch()
       Do a more conventional tree search (by opposition to SAT based one) where
       we keep all the explored node in a tree. This is meant to be used in a
       portfolio and focus on improving the objective lower bound. Keeping the
       whole tree allow us to report a better objective lower bound coming from
       the worst open node in the tree.
       
      optional bool optimize_with_lb_tree_search = 188 [default = false];
      Specified by:
      hasOptimizeWithLbTreeSearch in interface SatParametersOrBuilder
      Returns:
      Whether the optimizeWithLbTreeSearch field is set.
    • getOptimizeWithLbTreeSearch

      public boolean getOptimizeWithLbTreeSearch()
       Do a more conventional tree search (by opposition to SAT based one) where
       we keep all the explored node in a tree. This is meant to be used in a
       portfolio and focus on improving the objective lower bound. Keeping the
       whole tree allow us to report a better objective lower bound coming from
       the worst open node in the tree.
       
      optional bool optimize_with_lb_tree_search = 188 [default = false];
      Specified by:
      getOptimizeWithLbTreeSearch in interface SatParametersOrBuilder
      Returns:
      The optimizeWithLbTreeSearch.
    • setOptimizeWithLbTreeSearch

      public SatParameters.Builder setOptimizeWithLbTreeSearch(boolean value)
       Do a more conventional tree search (by opposition to SAT based one) where
       we keep all the explored node in a tree. This is meant to be used in a
       portfolio and focus on improving the objective lower bound. Keeping the
       whole tree allow us to report a better objective lower bound coming from
       the worst open node in the tree.
       
      optional bool optimize_with_lb_tree_search = 188 [default = false];
      Parameters:
      value - The optimizeWithLbTreeSearch to set.
      Returns:
      This builder for chaining.
    • clearOptimizeWithLbTreeSearch

      public SatParameters.Builder clearOptimizeWithLbTreeSearch()
       Do a more conventional tree search (by opposition to SAT based one) where
       we keep all the explored node in a tree. This is meant to be used in a
       portfolio and focus on improving the objective lower bound. Keeping the
       whole tree allow us to report a better objective lower bound coming from
       the worst open node in the tree.
       
      optional bool optimize_with_lb_tree_search = 188 [default = false];
      Returns:
      This builder for chaining.
    • hasSaveLpBasisInLbTreeSearch

      public boolean hasSaveLpBasisInLbTreeSearch()
       Experimental. Save the current LP basis at each node of the search tree so
       that when we jump around, we can load it and reduce the number of LP
       iterations needed.
      
       It currently works okay if we do not change the lp with cuts or
       simplification... More work is needed to make it robust in all cases.
       
      optional bool save_lp_basis_in_lb_tree_search = 284 [default = false];
      Specified by:
      hasSaveLpBasisInLbTreeSearch in interface SatParametersOrBuilder
      Returns:
      Whether the saveLpBasisInLbTreeSearch field is set.
    • getSaveLpBasisInLbTreeSearch

      public boolean getSaveLpBasisInLbTreeSearch()
       Experimental. Save the current LP basis at each node of the search tree so
       that when we jump around, we can load it and reduce the number of LP
       iterations needed.
      
       It currently works okay if we do not change the lp with cuts or
       simplification... More work is needed to make it robust in all cases.
       
      optional bool save_lp_basis_in_lb_tree_search = 284 [default = false];
      Specified by:
      getSaveLpBasisInLbTreeSearch in interface SatParametersOrBuilder
      Returns:
      The saveLpBasisInLbTreeSearch.
    • setSaveLpBasisInLbTreeSearch

      public SatParameters.Builder setSaveLpBasisInLbTreeSearch(boolean value)
       Experimental. Save the current LP basis at each node of the search tree so
       that when we jump around, we can load it and reduce the number of LP
       iterations needed.
      
       It currently works okay if we do not change the lp with cuts or
       simplification... More work is needed to make it robust in all cases.
       
      optional bool save_lp_basis_in_lb_tree_search = 284 [default = false];
      Parameters:
      value - The saveLpBasisInLbTreeSearch to set.
      Returns:
      This builder for chaining.
    • clearSaveLpBasisInLbTreeSearch

      public SatParameters.Builder clearSaveLpBasisInLbTreeSearch()
       Experimental. Save the current LP basis at each node of the search tree so
       that when we jump around, we can load it and reduce the number of LP
       iterations needed.
      
       It currently works okay if we do not change the lp with cuts or
       simplification... More work is needed to make it robust in all cases.
       
      optional bool save_lp_basis_in_lb_tree_search = 284 [default = false];
      Returns:
      This builder for chaining.
    • hasBinarySearchNumConflicts

      public boolean hasBinarySearchNumConflicts()
       If non-negative, perform a binary search on the objective variable in order
       to find an [min, max] interval outside of which the solver proved unsat/sat
       under this amount of conflict. This can quickly reduce the objective domain
       on some problems.
       
      optional int32 binary_search_num_conflicts = 99 [default = -1];
      Specified by:
      hasBinarySearchNumConflicts in interface SatParametersOrBuilder
      Returns:
      Whether the binarySearchNumConflicts field is set.
    • getBinarySearchNumConflicts

      public int getBinarySearchNumConflicts()
       If non-negative, perform a binary search on the objective variable in order
       to find an [min, max] interval outside of which the solver proved unsat/sat
       under this amount of conflict. This can quickly reduce the objective domain
       on some problems.
       
      optional int32 binary_search_num_conflicts = 99 [default = -1];
      Specified by:
      getBinarySearchNumConflicts in interface SatParametersOrBuilder
      Returns:
      The binarySearchNumConflicts.
    • setBinarySearchNumConflicts

      public SatParameters.Builder setBinarySearchNumConflicts(int value)
       If non-negative, perform a binary search on the objective variable in order
       to find an [min, max] interval outside of which the solver proved unsat/sat
       under this amount of conflict. This can quickly reduce the objective domain
       on some problems.
       
      optional int32 binary_search_num_conflicts = 99 [default = -1];
      Parameters:
      value - The binarySearchNumConflicts to set.
      Returns:
      This builder for chaining.
    • clearBinarySearchNumConflicts

      public SatParameters.Builder clearBinarySearchNumConflicts()
       If non-negative, perform a binary search on the objective variable in order
       to find an [min, max] interval outside of which the solver proved unsat/sat
       under this amount of conflict. This can quickly reduce the objective domain
       on some problems.
       
      optional int32 binary_search_num_conflicts = 99 [default = -1];
      Returns:
      This builder for chaining.
    • hasOptimizeWithMaxHs

      public boolean hasOptimizeWithMaxHs()
       This has no effect if optimize_with_core is false. If true, use a different
       core-based algorithm similar to the max-HS algo for max-SAT. This is a
       hybrid MIP/CP approach and it uses a MIP solver in addition to the CP/SAT
       one. This is also related to the PhD work of tobyodavies@
       "Automatic Logic-Based Benders Decomposition with MiniZinc"
       http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14489
       
      optional bool optimize_with_max_hs = 85 [default = false];
      Specified by:
      hasOptimizeWithMaxHs in interface SatParametersOrBuilder
      Returns:
      Whether the optimizeWithMaxHs field is set.
    • getOptimizeWithMaxHs

      public boolean getOptimizeWithMaxHs()
       This has no effect if optimize_with_core is false. If true, use a different
       core-based algorithm similar to the max-HS algo for max-SAT. This is a
       hybrid MIP/CP approach and it uses a MIP solver in addition to the CP/SAT
       one. This is also related to the PhD work of tobyodavies@
       "Automatic Logic-Based Benders Decomposition with MiniZinc"
       http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14489
       
      optional bool optimize_with_max_hs = 85 [default = false];
      Specified by:
      getOptimizeWithMaxHs in interface SatParametersOrBuilder
      Returns:
      The optimizeWithMaxHs.
    • setOptimizeWithMaxHs

      public SatParameters.Builder setOptimizeWithMaxHs(boolean value)
       This has no effect if optimize_with_core is false. If true, use a different
       core-based algorithm similar to the max-HS algo for max-SAT. This is a
       hybrid MIP/CP approach and it uses a MIP solver in addition to the CP/SAT
       one. This is also related to the PhD work of tobyodavies@
       "Automatic Logic-Based Benders Decomposition with MiniZinc"
       http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14489
       
      optional bool optimize_with_max_hs = 85 [default = false];
      Parameters:
      value - The optimizeWithMaxHs to set.
      Returns:
      This builder for chaining.
    • clearOptimizeWithMaxHs

      public SatParameters.Builder clearOptimizeWithMaxHs()
       This has no effect if optimize_with_core is false. If true, use a different
       core-based algorithm similar to the max-HS algo for max-SAT. This is a
       hybrid MIP/CP approach and it uses a MIP solver in addition to the CP/SAT
       one. This is also related to the PhD work of tobyodavies@
       "Automatic Logic-Based Benders Decomposition with MiniZinc"
       http://aaai.org/ocs/index.php/AAAI/AAAI17/paper/view/14489
       
      optional bool optimize_with_max_hs = 85 [default = false];
      Returns:
      This builder for chaining.
    • hasUseFeasibilityJump

      public boolean hasUseFeasibilityJump()
       Parameters for an heuristic similar to the one described in the paper:
       "Feasibility Jump: an LP-free Lagrangian MIP heuristic", Bjørnar
       Luteberget, Giorgio Sartor, 2023, Mathematical Programming Computation.
       
      optional bool use_feasibility_jump = 265 [default = true];
      Specified by:
      hasUseFeasibilityJump in interface SatParametersOrBuilder
      Returns:
      Whether the useFeasibilityJump field is set.
    • getUseFeasibilityJump

      public boolean getUseFeasibilityJump()
       Parameters for an heuristic similar to the one described in the paper:
       "Feasibility Jump: an LP-free Lagrangian MIP heuristic", Bjørnar
       Luteberget, Giorgio Sartor, 2023, Mathematical Programming Computation.
       
      optional bool use_feasibility_jump = 265 [default = true];
      Specified by:
      getUseFeasibilityJump in interface SatParametersOrBuilder
      Returns:
      The useFeasibilityJump.
    • setUseFeasibilityJump

      public SatParameters.Builder setUseFeasibilityJump(boolean value)
       Parameters for an heuristic similar to the one described in the paper:
       "Feasibility Jump: an LP-free Lagrangian MIP heuristic", Bjørnar
       Luteberget, Giorgio Sartor, 2023, Mathematical Programming Computation.
       
      optional bool use_feasibility_jump = 265 [default = true];
      Parameters:
      value - The useFeasibilityJump to set.
      Returns:
      This builder for chaining.
    • clearUseFeasibilityJump

      public SatParameters.Builder clearUseFeasibilityJump()
       Parameters for an heuristic similar to the one described in the paper:
       "Feasibility Jump: an LP-free Lagrangian MIP heuristic", Bjørnar
       Luteberget, Giorgio Sartor, 2023, Mathematical Programming Computation.
       
      optional bool use_feasibility_jump = 265 [default = true];
      Returns:
      This builder for chaining.
    • hasUseLsOnly

      public boolean hasUseLsOnly()
       Disable every other type of subsolver, setting this turns CP-SAT into a
       pure local-search solver.
       
      optional bool use_ls_only = 240 [default = false];
      Specified by:
      hasUseLsOnly in interface SatParametersOrBuilder
      Returns:
      Whether the useLsOnly field is set.
    • getUseLsOnly

      public boolean getUseLsOnly()
       Disable every other type of subsolver, setting this turns CP-SAT into a
       pure local-search solver.
       
      optional bool use_ls_only = 240 [default = false];
      Specified by:
      getUseLsOnly in interface SatParametersOrBuilder
      Returns:
      The useLsOnly.
    • setUseLsOnly

      public SatParameters.Builder setUseLsOnly(boolean value)
       Disable every other type of subsolver, setting this turns CP-SAT into a
       pure local-search solver.
       
      optional bool use_ls_only = 240 [default = false];
      Parameters:
      value - The useLsOnly to set.
      Returns:
      This builder for chaining.
    • clearUseLsOnly

      public SatParameters.Builder clearUseLsOnly()
       Disable every other type of subsolver, setting this turns CP-SAT into a
       pure local-search solver.
       
      optional bool use_ls_only = 240 [default = false];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpDecay

      public boolean hasFeasibilityJumpDecay()
       On each restart, we randomly choose if we use decay (with this parameter)
       or no decay.
       
      optional double feasibility_jump_decay = 242 [default = 0.95];
      Specified by:
      hasFeasibilityJumpDecay in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpDecay field is set.
    • getFeasibilityJumpDecay

      public double getFeasibilityJumpDecay()
       On each restart, we randomly choose if we use decay (with this parameter)
       or no decay.
       
      optional double feasibility_jump_decay = 242 [default = 0.95];
      Specified by:
      getFeasibilityJumpDecay in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpDecay.
    • setFeasibilityJumpDecay

      public SatParameters.Builder setFeasibilityJumpDecay(double value)
       On each restart, we randomly choose if we use decay (with this parameter)
       or no decay.
       
      optional double feasibility_jump_decay = 242 [default = 0.95];
      Parameters:
      value - The feasibilityJumpDecay to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpDecay

      public SatParameters.Builder clearFeasibilityJumpDecay()
       On each restart, we randomly choose if we use decay (with this parameter)
       or no decay.
       
      optional double feasibility_jump_decay = 242 [default = 0.95];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpLinearizationLevel

      public boolean hasFeasibilityJumpLinearizationLevel()
       How much do we linearize the problem in the local search code.
       
      optional int32 feasibility_jump_linearization_level = 257 [default = 2];
      Specified by:
      hasFeasibilityJumpLinearizationLevel in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpLinearizationLevel field is set.
    • getFeasibilityJumpLinearizationLevel

      public int getFeasibilityJumpLinearizationLevel()
       How much do we linearize the problem in the local search code.
       
      optional int32 feasibility_jump_linearization_level = 257 [default = 2];
      Specified by:
      getFeasibilityJumpLinearizationLevel in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpLinearizationLevel.
    • setFeasibilityJumpLinearizationLevel

      public SatParameters.Builder setFeasibilityJumpLinearizationLevel(int value)
       How much do we linearize the problem in the local search code.
       
      optional int32 feasibility_jump_linearization_level = 257 [default = 2];
      Parameters:
      value - The feasibilityJumpLinearizationLevel to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpLinearizationLevel

      public SatParameters.Builder clearFeasibilityJumpLinearizationLevel()
       How much do we linearize the problem in the local search code.
       
      optional int32 feasibility_jump_linearization_level = 257 [default = 2];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpRestartFactor

      public boolean hasFeasibilityJumpRestartFactor()
       This is a factor that directly influence the work before each restart.
       Increasing it leads to longer restart.
       
      optional int32 feasibility_jump_restart_factor = 258 [default = 1];
      Specified by:
      hasFeasibilityJumpRestartFactor in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpRestartFactor field is set.
    • getFeasibilityJumpRestartFactor

      public int getFeasibilityJumpRestartFactor()
       This is a factor that directly influence the work before each restart.
       Increasing it leads to longer restart.
       
      optional int32 feasibility_jump_restart_factor = 258 [default = 1];
      Specified by:
      getFeasibilityJumpRestartFactor in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpRestartFactor.
    • setFeasibilityJumpRestartFactor

      public SatParameters.Builder setFeasibilityJumpRestartFactor(int value)
       This is a factor that directly influence the work before each restart.
       Increasing it leads to longer restart.
       
      optional int32 feasibility_jump_restart_factor = 258 [default = 1];
      Parameters:
      value - The feasibilityJumpRestartFactor to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpRestartFactor

      public SatParameters.Builder clearFeasibilityJumpRestartFactor()
       This is a factor that directly influence the work before each restart.
       Increasing it leads to longer restart.
       
      optional int32 feasibility_jump_restart_factor = 258 [default = 1];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpBatchDtime

      public boolean hasFeasibilityJumpBatchDtime()
       How much dtime for each LS batch.
       
      optional double feasibility_jump_batch_dtime = 292 [default = 0.1];
      Specified by:
      hasFeasibilityJumpBatchDtime in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpBatchDtime field is set.
    • getFeasibilityJumpBatchDtime

      public double getFeasibilityJumpBatchDtime()
       How much dtime for each LS batch.
       
      optional double feasibility_jump_batch_dtime = 292 [default = 0.1];
      Specified by:
      getFeasibilityJumpBatchDtime in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpBatchDtime.
    • setFeasibilityJumpBatchDtime

      public SatParameters.Builder setFeasibilityJumpBatchDtime(double value)
       How much dtime for each LS batch.
       
      optional double feasibility_jump_batch_dtime = 292 [default = 0.1];
      Parameters:
      value - The feasibilityJumpBatchDtime to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpBatchDtime

      public SatParameters.Builder clearFeasibilityJumpBatchDtime()
       How much dtime for each LS batch.
       
      optional double feasibility_jump_batch_dtime = 292 [default = 0.1];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpVarRandomizationProbability

      public boolean hasFeasibilityJumpVarRandomizationProbability()
       Probability for a variable to have a non default value upon restarts or
       perturbations.
       
      optional double feasibility_jump_var_randomization_probability = 247 [default = 0.05];
      Specified by:
      hasFeasibilityJumpVarRandomizationProbability in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpVarRandomizationProbability field is set.
    • getFeasibilityJumpVarRandomizationProbability

      public double getFeasibilityJumpVarRandomizationProbability()
       Probability for a variable to have a non default value upon restarts or
       perturbations.
       
      optional double feasibility_jump_var_randomization_probability = 247 [default = 0.05];
      Specified by:
      getFeasibilityJumpVarRandomizationProbability in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpVarRandomizationProbability.
    • setFeasibilityJumpVarRandomizationProbability

      public SatParameters.Builder setFeasibilityJumpVarRandomizationProbability(double value)
       Probability for a variable to have a non default value upon restarts or
       perturbations.
       
      optional double feasibility_jump_var_randomization_probability = 247 [default = 0.05];
      Parameters:
      value - The feasibilityJumpVarRandomizationProbability to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpVarRandomizationProbability

      public SatParameters.Builder clearFeasibilityJumpVarRandomizationProbability()
       Probability for a variable to have a non default value upon restarts or
       perturbations.
       
      optional double feasibility_jump_var_randomization_probability = 247 [default = 0.05];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpVarPerburbationRangeRatio

      public boolean hasFeasibilityJumpVarPerburbationRangeRatio()
       Max distance between the default value and the pertubated value relative to
       the range of the domain of the variable.
       
      optional double feasibility_jump_var_perburbation_range_ratio = 248 [default = 0.2];
      Specified by:
      hasFeasibilityJumpVarPerburbationRangeRatio in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpVarPerburbationRangeRatio field is set.
    • getFeasibilityJumpVarPerburbationRangeRatio

      public double getFeasibilityJumpVarPerburbationRangeRatio()
       Max distance between the default value and the pertubated value relative to
       the range of the domain of the variable.
       
      optional double feasibility_jump_var_perburbation_range_ratio = 248 [default = 0.2];
      Specified by:
      getFeasibilityJumpVarPerburbationRangeRatio in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpVarPerburbationRangeRatio.
    • setFeasibilityJumpVarPerburbationRangeRatio

      public SatParameters.Builder setFeasibilityJumpVarPerburbationRangeRatio(double value)
       Max distance between the default value and the pertubated value relative to
       the range of the domain of the variable.
       
      optional double feasibility_jump_var_perburbation_range_ratio = 248 [default = 0.2];
      Parameters:
      value - The feasibilityJumpVarPerburbationRangeRatio to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpVarPerburbationRangeRatio

      public SatParameters.Builder clearFeasibilityJumpVarPerburbationRangeRatio()
       Max distance between the default value and the pertubated value relative to
       the range of the domain of the variable.
       
      optional double feasibility_jump_var_perburbation_range_ratio = 248 [default = 0.2];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpEnableRestarts

      public boolean hasFeasibilityJumpEnableRestarts()
       When stagnating, feasibility jump will either restart from a default
       solution (with some possible randomization), or randomly pertubate the
       current solution. This parameter selects the first option.
       
      optional bool feasibility_jump_enable_restarts = 250 [default = true];
      Specified by:
      hasFeasibilityJumpEnableRestarts in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpEnableRestarts field is set.
    • getFeasibilityJumpEnableRestarts

      public boolean getFeasibilityJumpEnableRestarts()
       When stagnating, feasibility jump will either restart from a default
       solution (with some possible randomization), or randomly pertubate the
       current solution. This parameter selects the first option.
       
      optional bool feasibility_jump_enable_restarts = 250 [default = true];
      Specified by:
      getFeasibilityJumpEnableRestarts in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpEnableRestarts.
    • setFeasibilityJumpEnableRestarts

      public SatParameters.Builder setFeasibilityJumpEnableRestarts(boolean value)
       When stagnating, feasibility jump will either restart from a default
       solution (with some possible randomization), or randomly pertubate the
       current solution. This parameter selects the first option.
       
      optional bool feasibility_jump_enable_restarts = 250 [default = true];
      Parameters:
      value - The feasibilityJumpEnableRestarts to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpEnableRestarts

      public SatParameters.Builder clearFeasibilityJumpEnableRestarts()
       When stagnating, feasibility jump will either restart from a default
       solution (with some possible randomization), or randomly pertubate the
       current solution. This parameter selects the first option.
       
      optional bool feasibility_jump_enable_restarts = 250 [default = true];
      Returns:
      This builder for chaining.
    • hasFeasibilityJumpMaxExpandedConstraintSize

      public boolean hasFeasibilityJumpMaxExpandedConstraintSize()
       Maximum size of no_overlap or no_overlap_2d constraint for a quadratic
       expansion. This might look a lot, but by expanding such constraint, we get
       a linear time evaluation per single variable moves instead of a slow O(n
       log n) one.
       
      optional int32 feasibility_jump_max_expanded_constraint_size = 264 [default = 500];
      Specified by:
      hasFeasibilityJumpMaxExpandedConstraintSize in interface SatParametersOrBuilder
      Returns:
      Whether the feasibilityJumpMaxExpandedConstraintSize field is set.
    • getFeasibilityJumpMaxExpandedConstraintSize

      public int getFeasibilityJumpMaxExpandedConstraintSize()
       Maximum size of no_overlap or no_overlap_2d constraint for a quadratic
       expansion. This might look a lot, but by expanding such constraint, we get
       a linear time evaluation per single variable moves instead of a slow O(n
       log n) one.
       
      optional int32 feasibility_jump_max_expanded_constraint_size = 264 [default = 500];
      Specified by:
      getFeasibilityJumpMaxExpandedConstraintSize in interface SatParametersOrBuilder
      Returns:
      The feasibilityJumpMaxExpandedConstraintSize.
    • setFeasibilityJumpMaxExpandedConstraintSize

      public SatParameters.Builder setFeasibilityJumpMaxExpandedConstraintSize(int value)
       Maximum size of no_overlap or no_overlap_2d constraint for a quadratic
       expansion. This might look a lot, but by expanding such constraint, we get
       a linear time evaluation per single variable moves instead of a slow O(n
       log n) one.
       
      optional int32 feasibility_jump_max_expanded_constraint_size = 264 [default = 500];
      Parameters:
      value - The feasibilityJumpMaxExpandedConstraintSize to set.
      Returns:
      This builder for chaining.
    • clearFeasibilityJumpMaxExpandedConstraintSize

      public SatParameters.Builder clearFeasibilityJumpMaxExpandedConstraintSize()
       Maximum size of no_overlap or no_overlap_2d constraint for a quadratic
       expansion. This might look a lot, but by expanding such constraint, we get
       a linear time evaluation per single variable moves instead of a slow O(n
       log n) one.
       
      optional int32 feasibility_jump_max_expanded_constraint_size = 264 [default = 500];
      Returns:
      This builder for chaining.
    • hasNumViolationLs

      public boolean hasNumViolationLs()
       This will create incomplete subsolvers (that are not LNS subsolvers)
       that use the feasibility jump code to find improving solution, treating
       the objective improvement as a hard constraint.
       
      optional int32 num_violation_ls = 244 [default = 0];
      Specified by:
      hasNumViolationLs in interface SatParametersOrBuilder
      Returns:
      Whether the numViolationLs field is set.
    • getNumViolationLs

      public int getNumViolationLs()
       This will create incomplete subsolvers (that are not LNS subsolvers)
       that use the feasibility jump code to find improving solution, treating
       the objective improvement as a hard constraint.
       
      optional int32 num_violation_ls = 244 [default = 0];
      Specified by:
      getNumViolationLs in interface SatParametersOrBuilder
      Returns:
      The numViolationLs.
    • setNumViolationLs

      public SatParameters.Builder setNumViolationLs(int value)
       This will create incomplete subsolvers (that are not LNS subsolvers)
       that use the feasibility jump code to find improving solution, treating
       the objective improvement as a hard constraint.
       
      optional int32 num_violation_ls = 244 [default = 0];
      Parameters:
      value - The numViolationLs to set.
      Returns:
      This builder for chaining.
    • clearNumViolationLs

      public SatParameters.Builder clearNumViolationLs()
       This will create incomplete subsolvers (that are not LNS subsolvers)
       that use the feasibility jump code to find improving solution, treating
       the objective improvement as a hard constraint.
       
      optional int32 num_violation_ls = 244 [default = 0];
      Returns:
      This builder for chaining.
    • hasViolationLsPerturbationPeriod

      public boolean hasViolationLsPerturbationPeriod()
       How long violation_ls should wait before perturbating a solution.
       
      optional int32 violation_ls_perturbation_period = 249 [default = 100];
      Specified by:
      hasViolationLsPerturbationPeriod in interface SatParametersOrBuilder
      Returns:
      Whether the violationLsPerturbationPeriod field is set.
    • getViolationLsPerturbationPeriod

      public int getViolationLsPerturbationPeriod()
       How long violation_ls should wait before perturbating a solution.
       
      optional int32 violation_ls_perturbation_period = 249 [default = 100];
      Specified by:
      getViolationLsPerturbationPeriod in interface SatParametersOrBuilder
      Returns:
      The violationLsPerturbationPeriod.
    • setViolationLsPerturbationPeriod

      public SatParameters.Builder setViolationLsPerturbationPeriod(int value)
       How long violation_ls should wait before perturbating a solution.
       
      optional int32 violation_ls_perturbation_period = 249 [default = 100];
      Parameters:
      value - The violationLsPerturbationPeriod to set.
      Returns:
      This builder for chaining.
    • clearViolationLsPerturbationPeriod

      public SatParameters.Builder clearViolationLsPerturbationPeriod()
       How long violation_ls should wait before perturbating a solution.
       
      optional int32 violation_ls_perturbation_period = 249 [default = 100];
      Returns:
      This builder for chaining.
    • hasViolationLsCompoundMoveProbability

      public boolean hasViolationLsCompoundMoveProbability()
       Probability of using compound move search each restart.
       TODO(user): Add reference to paper when published.
       
      optional double violation_ls_compound_move_probability = 259 [default = 0.5];
      Specified by:
      hasViolationLsCompoundMoveProbability in interface SatParametersOrBuilder
      Returns:
      Whether the violationLsCompoundMoveProbability field is set.
    • getViolationLsCompoundMoveProbability

      public double getViolationLsCompoundMoveProbability()
       Probability of using compound move search each restart.
       TODO(user): Add reference to paper when published.
       
      optional double violation_ls_compound_move_probability = 259 [default = 0.5];
      Specified by:
      getViolationLsCompoundMoveProbability in interface SatParametersOrBuilder
      Returns:
      The violationLsCompoundMoveProbability.
    • setViolationLsCompoundMoveProbability

      public SatParameters.Builder setViolationLsCompoundMoveProbability(double value)
       Probability of using compound move search each restart.
       TODO(user): Add reference to paper when published.
       
      optional double violation_ls_compound_move_probability = 259 [default = 0.5];
      Parameters:
      value - The violationLsCompoundMoveProbability to set.
      Returns:
      This builder for chaining.
    • clearViolationLsCompoundMoveProbability

      public SatParameters.Builder clearViolationLsCompoundMoveProbability()
       Probability of using compound move search each restart.
       TODO(user): Add reference to paper when published.
       
      optional double violation_ls_compound_move_probability = 259 [default = 0.5];
      Returns:
      This builder for chaining.
    • hasSharedTreeNumWorkers

      public boolean hasSharedTreeNumWorkers()
       Enables shared tree search.
       If positive, start this many complete worker threads to explore a shared
       search tree. These workers communicate objective bounds and simple decision
       nogoods relating to the shared prefix of the tree, and will avoid exploring
       the same subtrees as one another.
       Specifying a negative number uses a heuristic to select an appropriate
       number of shared tree workeres based on the total number of workers.
       
      optional int32 shared_tree_num_workers = 235 [default = 0];
      Specified by:
      hasSharedTreeNumWorkers in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeNumWorkers field is set.
    • getSharedTreeNumWorkers

      public int getSharedTreeNumWorkers()
       Enables shared tree search.
       If positive, start this many complete worker threads to explore a shared
       search tree. These workers communicate objective bounds and simple decision
       nogoods relating to the shared prefix of the tree, and will avoid exploring
       the same subtrees as one another.
       Specifying a negative number uses a heuristic to select an appropriate
       number of shared tree workeres based on the total number of workers.
       
      optional int32 shared_tree_num_workers = 235 [default = 0];
      Specified by:
      getSharedTreeNumWorkers in interface SatParametersOrBuilder
      Returns:
      The sharedTreeNumWorkers.
    • setSharedTreeNumWorkers

      public SatParameters.Builder setSharedTreeNumWorkers(int value)
       Enables shared tree search.
       If positive, start this many complete worker threads to explore a shared
       search tree. These workers communicate objective bounds and simple decision
       nogoods relating to the shared prefix of the tree, and will avoid exploring
       the same subtrees as one another.
       Specifying a negative number uses a heuristic to select an appropriate
       number of shared tree workeres based on the total number of workers.
       
      optional int32 shared_tree_num_workers = 235 [default = 0];
      Parameters:
      value - The sharedTreeNumWorkers to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeNumWorkers

      public SatParameters.Builder clearSharedTreeNumWorkers()
       Enables shared tree search.
       If positive, start this many complete worker threads to explore a shared
       search tree. These workers communicate objective bounds and simple decision
       nogoods relating to the shared prefix of the tree, and will avoid exploring
       the same subtrees as one another.
       Specifying a negative number uses a heuristic to select an appropriate
       number of shared tree workeres based on the total number of workers.
       
      optional int32 shared_tree_num_workers = 235 [default = 0];
      Returns:
      This builder for chaining.
    • hasUseSharedTreeSearch

      public boolean hasUseSharedTreeSearch()
       Set on shared subtree workers. Users should not set this directly.
       
      optional bool use_shared_tree_search = 236 [default = false];
      Specified by:
      hasUseSharedTreeSearch in interface SatParametersOrBuilder
      Returns:
      Whether the useSharedTreeSearch field is set.
    • getUseSharedTreeSearch

      public boolean getUseSharedTreeSearch()
       Set on shared subtree workers. Users should not set this directly.
       
      optional bool use_shared_tree_search = 236 [default = false];
      Specified by:
      getUseSharedTreeSearch in interface SatParametersOrBuilder
      Returns:
      The useSharedTreeSearch.
    • setUseSharedTreeSearch

      public SatParameters.Builder setUseSharedTreeSearch(boolean value)
       Set on shared subtree workers. Users should not set this directly.
       
      optional bool use_shared_tree_search = 236 [default = false];
      Parameters:
      value - The useSharedTreeSearch to set.
      Returns:
      This builder for chaining.
    • clearUseSharedTreeSearch

      public SatParameters.Builder clearUseSharedTreeSearch()
       Set on shared subtree workers. Users should not set this directly.
       
      optional bool use_shared_tree_search = 236 [default = false];
      Returns:
      This builder for chaining.
    • hasSharedTreeWorkerMinRestartsPerSubtree

      public boolean hasSharedTreeWorkerMinRestartsPerSubtree()
       Minimum restarts before a worker will replace a subtree
       that looks "bad" based on the average LBD of learned clauses.
       
      optional int32 shared_tree_worker_min_restarts_per_subtree = 282 [default = 1];
      Specified by:
      hasSharedTreeWorkerMinRestartsPerSubtree in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeWorkerMinRestartsPerSubtree field is set.
    • getSharedTreeWorkerMinRestartsPerSubtree

      public int getSharedTreeWorkerMinRestartsPerSubtree()
       Minimum restarts before a worker will replace a subtree
       that looks "bad" based on the average LBD of learned clauses.
       
      optional int32 shared_tree_worker_min_restarts_per_subtree = 282 [default = 1];
      Specified by:
      getSharedTreeWorkerMinRestartsPerSubtree in interface SatParametersOrBuilder
      Returns:
      The sharedTreeWorkerMinRestartsPerSubtree.
    • setSharedTreeWorkerMinRestartsPerSubtree

      public SatParameters.Builder setSharedTreeWorkerMinRestartsPerSubtree(int value)
       Minimum restarts before a worker will replace a subtree
       that looks "bad" based on the average LBD of learned clauses.
       
      optional int32 shared_tree_worker_min_restarts_per_subtree = 282 [default = 1];
      Parameters:
      value - The sharedTreeWorkerMinRestartsPerSubtree to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeWorkerMinRestartsPerSubtree

      public SatParameters.Builder clearSharedTreeWorkerMinRestartsPerSubtree()
       Minimum restarts before a worker will replace a subtree
       that looks "bad" based on the average LBD of learned clauses.
       
      optional int32 shared_tree_worker_min_restarts_per_subtree = 282 [default = 1];
      Returns:
      This builder for chaining.
    • hasSharedTreeWorkerEnableTrailSharing

      public boolean hasSharedTreeWorkerEnableTrailSharing()
       If true, workers share more of the information from their local trail.
       Specifically, literals implied by the shared tree decisions.
       
      optional bool shared_tree_worker_enable_trail_sharing = 295 [default = true];
      Specified by:
      hasSharedTreeWorkerEnableTrailSharing in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeWorkerEnableTrailSharing field is set.
    • getSharedTreeWorkerEnableTrailSharing

      public boolean getSharedTreeWorkerEnableTrailSharing()
       If true, workers share more of the information from their local trail.
       Specifically, literals implied by the shared tree decisions.
       
      optional bool shared_tree_worker_enable_trail_sharing = 295 [default = true];
      Specified by:
      getSharedTreeWorkerEnableTrailSharing in interface SatParametersOrBuilder
      Returns:
      The sharedTreeWorkerEnableTrailSharing.
    • setSharedTreeWorkerEnableTrailSharing

      public SatParameters.Builder setSharedTreeWorkerEnableTrailSharing(boolean value)
       If true, workers share more of the information from their local trail.
       Specifically, literals implied by the shared tree decisions.
       
      optional bool shared_tree_worker_enable_trail_sharing = 295 [default = true];
      Parameters:
      value - The sharedTreeWorkerEnableTrailSharing to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeWorkerEnableTrailSharing

      public SatParameters.Builder clearSharedTreeWorkerEnableTrailSharing()
       If true, workers share more of the information from their local trail.
       Specifically, literals implied by the shared tree decisions.
       
      optional bool shared_tree_worker_enable_trail_sharing = 295 [default = true];
      Returns:
      This builder for chaining.
    • hasSharedTreeWorkerEnablePhaseSharing

      public boolean hasSharedTreeWorkerEnablePhaseSharing()
       If true, shared tree workers share their target phase when returning an
       assigned subtree for the next worker to use.
       
      optional bool shared_tree_worker_enable_phase_sharing = 304 [default = true];
      Specified by:
      hasSharedTreeWorkerEnablePhaseSharing in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeWorkerEnablePhaseSharing field is set.
    • getSharedTreeWorkerEnablePhaseSharing

      public boolean getSharedTreeWorkerEnablePhaseSharing()
       If true, shared tree workers share their target phase when returning an
       assigned subtree for the next worker to use.
       
      optional bool shared_tree_worker_enable_phase_sharing = 304 [default = true];
      Specified by:
      getSharedTreeWorkerEnablePhaseSharing in interface SatParametersOrBuilder
      Returns:
      The sharedTreeWorkerEnablePhaseSharing.
    • setSharedTreeWorkerEnablePhaseSharing

      public SatParameters.Builder setSharedTreeWorkerEnablePhaseSharing(boolean value)
       If true, shared tree workers share their target phase when returning an
       assigned subtree for the next worker to use.
       
      optional bool shared_tree_worker_enable_phase_sharing = 304 [default = true];
      Parameters:
      value - The sharedTreeWorkerEnablePhaseSharing to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeWorkerEnablePhaseSharing

      public SatParameters.Builder clearSharedTreeWorkerEnablePhaseSharing()
       If true, shared tree workers share their target phase when returning an
       assigned subtree for the next worker to use.
       
      optional bool shared_tree_worker_enable_phase_sharing = 304 [default = true];
      Returns:
      This builder for chaining.
    • hasSharedTreeOpenLeavesPerWorker

      public boolean hasSharedTreeOpenLeavesPerWorker()
       How many open leaf nodes should the shared tree maintain per worker.
       
      optional double shared_tree_open_leaves_per_worker = 281 [default = 2];
      Specified by:
      hasSharedTreeOpenLeavesPerWorker in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeOpenLeavesPerWorker field is set.
    • getSharedTreeOpenLeavesPerWorker

      public double getSharedTreeOpenLeavesPerWorker()
       How many open leaf nodes should the shared tree maintain per worker.
       
      optional double shared_tree_open_leaves_per_worker = 281 [default = 2];
      Specified by:
      getSharedTreeOpenLeavesPerWorker in interface SatParametersOrBuilder
      Returns:
      The sharedTreeOpenLeavesPerWorker.
    • setSharedTreeOpenLeavesPerWorker

      public SatParameters.Builder setSharedTreeOpenLeavesPerWorker(double value)
       How many open leaf nodes should the shared tree maintain per worker.
       
      optional double shared_tree_open_leaves_per_worker = 281 [default = 2];
      Parameters:
      value - The sharedTreeOpenLeavesPerWorker to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeOpenLeavesPerWorker

      public SatParameters.Builder clearSharedTreeOpenLeavesPerWorker()
       How many open leaf nodes should the shared tree maintain per worker.
       
      optional double shared_tree_open_leaves_per_worker = 281 [default = 2];
      Returns:
      This builder for chaining.
    • hasSharedTreeMaxNodesPerWorker

      public boolean hasSharedTreeMaxNodesPerWorker()
       In order to limit total shared memory and communication overhead, limit the
       total number of nodes that may be generated in the shared tree. If the
       shared tree runs out of unassigned leaves, workers act as portfolio
       workers. Note: this limit includes interior nodes, not just leaves.
       
      optional int32 shared_tree_max_nodes_per_worker = 238 [default = 10000];
      Specified by:
      hasSharedTreeMaxNodesPerWorker in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeMaxNodesPerWorker field is set.
    • getSharedTreeMaxNodesPerWorker

      public int getSharedTreeMaxNodesPerWorker()
       In order to limit total shared memory and communication overhead, limit the
       total number of nodes that may be generated in the shared tree. If the
       shared tree runs out of unassigned leaves, workers act as portfolio
       workers. Note: this limit includes interior nodes, not just leaves.
       
      optional int32 shared_tree_max_nodes_per_worker = 238 [default = 10000];
      Specified by:
      getSharedTreeMaxNodesPerWorker in interface SatParametersOrBuilder
      Returns:
      The sharedTreeMaxNodesPerWorker.
    • setSharedTreeMaxNodesPerWorker

      public SatParameters.Builder setSharedTreeMaxNodesPerWorker(int value)
       In order to limit total shared memory and communication overhead, limit the
       total number of nodes that may be generated in the shared tree. If the
       shared tree runs out of unassigned leaves, workers act as portfolio
       workers. Note: this limit includes interior nodes, not just leaves.
       
      optional int32 shared_tree_max_nodes_per_worker = 238 [default = 10000];
      Parameters:
      value - The sharedTreeMaxNodesPerWorker to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeMaxNodesPerWorker

      public SatParameters.Builder clearSharedTreeMaxNodesPerWorker()
       In order to limit total shared memory and communication overhead, limit the
       total number of nodes that may be generated in the shared tree. If the
       shared tree runs out of unassigned leaves, workers act as portfolio
       workers. Note: this limit includes interior nodes, not just leaves.
       
      optional int32 shared_tree_max_nodes_per_worker = 238 [default = 10000];
      Returns:
      This builder for chaining.
    • hasSharedTreeSplitStrategy

      public boolean hasSharedTreeSplitStrategy()
      optional .operations_research.sat.SatParameters.SharedTreeSplitStrategy shared_tree_split_strategy = 239 [default = SPLIT_STRATEGY_AUTO];
      Specified by:
      hasSharedTreeSplitStrategy in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeSplitStrategy field is set.
    • getSharedTreeSplitStrategy

      public SatParameters.SharedTreeSplitStrategy getSharedTreeSplitStrategy()
      optional .operations_research.sat.SatParameters.SharedTreeSplitStrategy shared_tree_split_strategy = 239 [default = SPLIT_STRATEGY_AUTO];
      Specified by:
      getSharedTreeSplitStrategy in interface SatParametersOrBuilder
      Returns:
      The sharedTreeSplitStrategy.
    • setSharedTreeSplitStrategy

      public SatParameters.Builder setSharedTreeSplitStrategy(SatParameters.SharedTreeSplitStrategy value)
      optional .operations_research.sat.SatParameters.SharedTreeSplitStrategy shared_tree_split_strategy = 239 [default = SPLIT_STRATEGY_AUTO];
      Parameters:
      value - The sharedTreeSplitStrategy to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeSplitStrategy

      public SatParameters.Builder clearSharedTreeSplitStrategy()
      optional .operations_research.sat.SatParameters.SharedTreeSplitStrategy shared_tree_split_strategy = 239 [default = SPLIT_STRATEGY_AUTO];
      Returns:
      This builder for chaining.
    • hasSharedTreeBalanceTolerance

      public boolean hasSharedTreeBalanceTolerance()
       How much deeper compared to the ideal max depth of the tree is considered
       "balanced" enough to still accept a split. Without such a tolerance,
       sometimes the tree can only be split by a single worker, and they may not
       generate a split for some time. In contrast, with a tolerance of 1, at
       least half of all workers should be able to split the tree as soon as a
       split becomes required. This only has an effect on
       SPLIT_STRATEGY_BALANCED_TREE and SPLIT_STRATEGY_DISCREPANCY.
       
      optional int32 shared_tree_balance_tolerance = 305 [default = 1];
      Specified by:
      hasSharedTreeBalanceTolerance in interface SatParametersOrBuilder
      Returns:
      Whether the sharedTreeBalanceTolerance field is set.
    • getSharedTreeBalanceTolerance

      public int getSharedTreeBalanceTolerance()
       How much deeper compared to the ideal max depth of the tree is considered
       "balanced" enough to still accept a split. Without such a tolerance,
       sometimes the tree can only be split by a single worker, and they may not
       generate a split for some time. In contrast, with a tolerance of 1, at
       least half of all workers should be able to split the tree as soon as a
       split becomes required. This only has an effect on
       SPLIT_STRATEGY_BALANCED_TREE and SPLIT_STRATEGY_DISCREPANCY.
       
      optional int32 shared_tree_balance_tolerance = 305 [default = 1];
      Specified by:
      getSharedTreeBalanceTolerance in interface SatParametersOrBuilder
      Returns:
      The sharedTreeBalanceTolerance.
    • setSharedTreeBalanceTolerance

      public SatParameters.Builder setSharedTreeBalanceTolerance(int value)
       How much deeper compared to the ideal max depth of the tree is considered
       "balanced" enough to still accept a split. Without such a tolerance,
       sometimes the tree can only be split by a single worker, and they may not
       generate a split for some time. In contrast, with a tolerance of 1, at
       least half of all workers should be able to split the tree as soon as a
       split becomes required. This only has an effect on
       SPLIT_STRATEGY_BALANCED_TREE and SPLIT_STRATEGY_DISCREPANCY.
       
      optional int32 shared_tree_balance_tolerance = 305 [default = 1];
      Parameters:
      value - The sharedTreeBalanceTolerance to set.
      Returns:
      This builder for chaining.
    • clearSharedTreeBalanceTolerance

      public SatParameters.Builder clearSharedTreeBalanceTolerance()
       How much deeper compared to the ideal max depth of the tree is considered
       "balanced" enough to still accept a split. Without such a tolerance,
       sometimes the tree can only be split by a single worker, and they may not
       generate a split for some time. In contrast, with a tolerance of 1, at
       least half of all workers should be able to split the tree as soon as a
       split becomes required. This only has an effect on
       SPLIT_STRATEGY_BALANCED_TREE and SPLIT_STRATEGY_DISCREPANCY.
       
      optional int32 shared_tree_balance_tolerance = 305 [default = 1];
      Returns:
      This builder for chaining.
    • hasEnumerateAllSolutions

      public boolean hasEnumerateAllSolutions()
       Whether we enumerate all solutions of a problem without objective. Note
       that setting this to true automatically disable some presolve reduction
       that can remove feasible solution. That is it has the same effect as
       setting keep_all_feasible_solutions_in_presolve.
      
       TODO(user): Do not do that and let the user choose what behavior is best by
       setting keep_all_feasible_solutions_in_presolve ?
       
      optional bool enumerate_all_solutions = 87 [default = false];
      Specified by:
      hasEnumerateAllSolutions in interface SatParametersOrBuilder
      Returns:
      Whether the enumerateAllSolutions field is set.
    • getEnumerateAllSolutions

      public boolean getEnumerateAllSolutions()
       Whether we enumerate all solutions of a problem without objective. Note
       that setting this to true automatically disable some presolve reduction
       that can remove feasible solution. That is it has the same effect as
       setting keep_all_feasible_solutions_in_presolve.
      
       TODO(user): Do not do that and let the user choose what behavior is best by
       setting keep_all_feasible_solutions_in_presolve ?
       
      optional bool enumerate_all_solutions = 87 [default = false];
      Specified by:
      getEnumerateAllSolutions in interface SatParametersOrBuilder
      Returns:
      The enumerateAllSolutions.
    • setEnumerateAllSolutions

      public SatParameters.Builder setEnumerateAllSolutions(boolean value)
       Whether we enumerate all solutions of a problem without objective. Note
       that setting this to true automatically disable some presolve reduction
       that can remove feasible solution. That is it has the same effect as
       setting keep_all_feasible_solutions_in_presolve.
      
       TODO(user): Do not do that and let the user choose what behavior is best by
       setting keep_all_feasible_solutions_in_presolve ?
       
      optional bool enumerate_all_solutions = 87 [default = false];
      Parameters:
      value - The enumerateAllSolutions to set.
      Returns:
      This builder for chaining.
    • clearEnumerateAllSolutions

      public SatParameters.Builder clearEnumerateAllSolutions()
       Whether we enumerate all solutions of a problem without objective. Note
       that setting this to true automatically disable some presolve reduction
       that can remove feasible solution. That is it has the same effect as
       setting keep_all_feasible_solutions_in_presolve.
      
       TODO(user): Do not do that and let the user choose what behavior is best by
       setting keep_all_feasible_solutions_in_presolve ?
       
      optional bool enumerate_all_solutions = 87 [default = false];
      Returns:
      This builder for chaining.
    • hasKeepAllFeasibleSolutionsInPresolve

      public boolean hasKeepAllFeasibleSolutionsInPresolve()
       If true, we disable the presolve reductions that remove feasible solutions
       from the search space. Such solution are usually dominated by a "better"
       solution that is kept, but depending on the situation, we might want to
       keep all solutions.
      
       A trivial example is when a variable is unused. If this is true, then the
       presolve will not fix it to an arbitrary value and it will stay in the
       search space.
       
      optional bool keep_all_feasible_solutions_in_presolve = 173 [default = false];
      Specified by:
      hasKeepAllFeasibleSolutionsInPresolve in interface SatParametersOrBuilder
      Returns:
      Whether the keepAllFeasibleSolutionsInPresolve field is set.
    • getKeepAllFeasibleSolutionsInPresolve

      public boolean getKeepAllFeasibleSolutionsInPresolve()
       If true, we disable the presolve reductions that remove feasible solutions
       from the search space. Such solution are usually dominated by a "better"
       solution that is kept, but depending on the situation, we might want to
       keep all solutions.
      
       A trivial example is when a variable is unused. If this is true, then the
       presolve will not fix it to an arbitrary value and it will stay in the
       search space.
       
      optional bool keep_all_feasible_solutions_in_presolve = 173 [default = false];
      Specified by:
      getKeepAllFeasibleSolutionsInPresolve in interface SatParametersOrBuilder
      Returns:
      The keepAllFeasibleSolutionsInPresolve.
    • setKeepAllFeasibleSolutionsInPresolve

      public SatParameters.Builder setKeepAllFeasibleSolutionsInPresolve(boolean value)
       If true, we disable the presolve reductions that remove feasible solutions
       from the search space. Such solution are usually dominated by a "better"
       solution that is kept, but depending on the situation, we might want to
       keep all solutions.
      
       A trivial example is when a variable is unused. If this is true, then the
       presolve will not fix it to an arbitrary value and it will stay in the
       search space.
       
      optional bool keep_all_feasible_solutions_in_presolve = 173 [default = false];
      Parameters:
      value - The keepAllFeasibleSolutionsInPresolve to set.
      Returns:
      This builder for chaining.
    • clearKeepAllFeasibleSolutionsInPresolve

      public SatParameters.Builder clearKeepAllFeasibleSolutionsInPresolve()
       If true, we disable the presolve reductions that remove feasible solutions
       from the search space. Such solution are usually dominated by a "better"
       solution that is kept, but depending on the situation, we might want to
       keep all solutions.
      
       A trivial example is when a variable is unused. If this is true, then the
       presolve will not fix it to an arbitrary value and it will stay in the
       search space.
       
      optional bool keep_all_feasible_solutions_in_presolve = 173 [default = false];
      Returns:
      This builder for chaining.
    • hasFillTightenedDomainsInResponse

      public boolean hasFillTightenedDomainsInResponse()
       If true, add information about the derived variable domains to the
       CpSolverResponse. It is an option because it makes the response slighly
       bigger and there is a bit more work involved during the postsolve to
       construct it, but it should still have a low overhead. See the
       tightened_variables field in CpSolverResponse for more details.
       
      optional bool fill_tightened_domains_in_response = 132 [default = false];
      Specified by:
      hasFillTightenedDomainsInResponse in interface SatParametersOrBuilder
      Returns:
      Whether the fillTightenedDomainsInResponse field is set.
    • getFillTightenedDomainsInResponse

      public boolean getFillTightenedDomainsInResponse()
       If true, add information about the derived variable domains to the
       CpSolverResponse. It is an option because it makes the response slighly
       bigger and there is a bit more work involved during the postsolve to
       construct it, but it should still have a low overhead. See the
       tightened_variables field in CpSolverResponse for more details.
       
      optional bool fill_tightened_domains_in_response = 132 [default = false];
      Specified by:
      getFillTightenedDomainsInResponse in interface SatParametersOrBuilder
      Returns:
      The fillTightenedDomainsInResponse.
    • setFillTightenedDomainsInResponse

      public SatParameters.Builder setFillTightenedDomainsInResponse(boolean value)
       If true, add information about the derived variable domains to the
       CpSolverResponse. It is an option because it makes the response slighly
       bigger and there is a bit more work involved during the postsolve to
       construct it, but it should still have a low overhead. See the
       tightened_variables field in CpSolverResponse for more details.
       
      optional bool fill_tightened_domains_in_response = 132 [default = false];
      Parameters:
      value - The fillTightenedDomainsInResponse to set.
      Returns:
      This builder for chaining.
    • clearFillTightenedDomainsInResponse

      public SatParameters.Builder clearFillTightenedDomainsInResponse()
       If true, add information about the derived variable domains to the
       CpSolverResponse. It is an option because it makes the response slighly
       bigger and there is a bit more work involved during the postsolve to
       construct it, but it should still have a low overhead. See the
       tightened_variables field in CpSolverResponse for more details.
       
      optional bool fill_tightened_domains_in_response = 132 [default = false];
      Returns:
      This builder for chaining.
    • hasFillAdditionalSolutionsInResponse

      public boolean hasFillAdditionalSolutionsInResponse()
       If true, the final response addition_solutions field will be filled with
       all solutions from our solutions pool.
      
       Note that if both this field and enumerate_all_solutions is true, we will
       copy to the pool all of the solution found. So if solution_pool_size is big
       enough, you can get all solutions this way instead of using the solution
       callback.
      
       Note that this only affect the "final" solution, not the one passed to the
       solution callbacks.
       
      optional bool fill_additional_solutions_in_response = 194 [default = false];
      Specified by:
      hasFillAdditionalSolutionsInResponse in interface SatParametersOrBuilder
      Returns:
      Whether the fillAdditionalSolutionsInResponse field is set.
    • getFillAdditionalSolutionsInResponse

      public boolean getFillAdditionalSolutionsInResponse()
       If true, the final response addition_solutions field will be filled with
       all solutions from our solutions pool.
      
       Note that if both this field and enumerate_all_solutions is true, we will
       copy to the pool all of the solution found. So if solution_pool_size is big
       enough, you can get all solutions this way instead of using the solution
       callback.
      
       Note that this only affect the "final" solution, not the one passed to the
       solution callbacks.
       
      optional bool fill_additional_solutions_in_response = 194 [default = false];
      Specified by:
      getFillAdditionalSolutionsInResponse in interface SatParametersOrBuilder
      Returns:
      The fillAdditionalSolutionsInResponse.
    • setFillAdditionalSolutionsInResponse

      public SatParameters.Builder setFillAdditionalSolutionsInResponse(boolean value)
       If true, the final response addition_solutions field will be filled with
       all solutions from our solutions pool.
      
       Note that if both this field and enumerate_all_solutions is true, we will
       copy to the pool all of the solution found. So if solution_pool_size is big
       enough, you can get all solutions this way instead of using the solution
       callback.
      
       Note that this only affect the "final" solution, not the one passed to the
       solution callbacks.
       
      optional bool fill_additional_solutions_in_response = 194 [default = false];
      Parameters:
      value - The fillAdditionalSolutionsInResponse to set.
      Returns:
      This builder for chaining.
    • clearFillAdditionalSolutionsInResponse

      public SatParameters.Builder clearFillAdditionalSolutionsInResponse()
       If true, the final response addition_solutions field will be filled with
       all solutions from our solutions pool.
      
       Note that if both this field and enumerate_all_solutions is true, we will
       copy to the pool all of the solution found. So if solution_pool_size is big
       enough, you can get all solutions this way instead of using the solution
       callback.
      
       Note that this only affect the "final" solution, not the one passed to the
       solution callbacks.
       
      optional bool fill_additional_solutions_in_response = 194 [default = false];
      Returns:
      This builder for chaining.
    • hasInstantiateAllVariables

      public boolean hasInstantiateAllVariables()
       If true, the solver will add a default integer branching strategy to the
       already defined search strategy. If not, some variable might still not be
       fixed at the end of the search. For now we assume these variable can just
       be set to their lower bound.
       
      optional bool instantiate_all_variables = 106 [default = true];
      Specified by:
      hasInstantiateAllVariables in interface SatParametersOrBuilder
      Returns:
      Whether the instantiateAllVariables field is set.
    • getInstantiateAllVariables

      public boolean getInstantiateAllVariables()
       If true, the solver will add a default integer branching strategy to the
       already defined search strategy. If not, some variable might still not be
       fixed at the end of the search. For now we assume these variable can just
       be set to their lower bound.
       
      optional bool instantiate_all_variables = 106 [default = true];
      Specified by:
      getInstantiateAllVariables in interface SatParametersOrBuilder
      Returns:
      The instantiateAllVariables.
    • setInstantiateAllVariables

      public SatParameters.Builder setInstantiateAllVariables(boolean value)
       If true, the solver will add a default integer branching strategy to the
       already defined search strategy. If not, some variable might still not be
       fixed at the end of the search. For now we assume these variable can just
       be set to their lower bound.
       
      optional bool instantiate_all_variables = 106 [default = true];
      Parameters:
      value - The instantiateAllVariables to set.
      Returns:
      This builder for chaining.
    • clearInstantiateAllVariables

      public SatParameters.Builder clearInstantiateAllVariables()
       If true, the solver will add a default integer branching strategy to the
       already defined search strategy. If not, some variable might still not be
       fixed at the end of the search. For now we assume these variable can just
       be set to their lower bound.
       
      optional bool instantiate_all_variables = 106 [default = true];
      Returns:
      This builder for chaining.
    • hasAutoDetectGreaterThanAtLeastOneOf

      public boolean hasAutoDetectGreaterThanAtLeastOneOf()
       If true, then the precedences propagator try to detect for each variable if
       it has a set of "optional incoming arc" for which at least one of them is
       present. This is usually useful to have but can be slow on model with a lot
       of precedence.
       
      optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
      Specified by:
      hasAutoDetectGreaterThanAtLeastOneOf in interface SatParametersOrBuilder
      Returns:
      Whether the autoDetectGreaterThanAtLeastOneOf field is set.
    • getAutoDetectGreaterThanAtLeastOneOf

      public boolean getAutoDetectGreaterThanAtLeastOneOf()
       If true, then the precedences propagator try to detect for each variable if
       it has a set of "optional incoming arc" for which at least one of them is
       present. This is usually useful to have but can be slow on model with a lot
       of precedence.
       
      optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
      Specified by:
      getAutoDetectGreaterThanAtLeastOneOf in interface SatParametersOrBuilder
      Returns:
      The autoDetectGreaterThanAtLeastOneOf.
    • setAutoDetectGreaterThanAtLeastOneOf

      public SatParameters.Builder setAutoDetectGreaterThanAtLeastOneOf(boolean value)
       If true, then the precedences propagator try to detect for each variable if
       it has a set of "optional incoming arc" for which at least one of them is
       present. This is usually useful to have but can be slow on model with a lot
       of precedence.
       
      optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
      Parameters:
      value - The autoDetectGreaterThanAtLeastOneOf to set.
      Returns:
      This builder for chaining.
    • clearAutoDetectGreaterThanAtLeastOneOf

      public SatParameters.Builder clearAutoDetectGreaterThanAtLeastOneOf()
       If true, then the precedences propagator try to detect for each variable if
       it has a set of "optional incoming arc" for which at least one of them is
       present. This is usually useful to have but can be slow on model with a lot
       of precedence.
       
      optional bool auto_detect_greater_than_at_least_one_of = 95 [default = true];
      Returns:
      This builder for chaining.
    • hasStopAfterFirstSolution

      public boolean hasStopAfterFirstSolution()
       For an optimization problem, stop the solver as soon as we have a solution.
       
      optional bool stop_after_first_solution = 98 [default = false];
      Specified by:
      hasStopAfterFirstSolution in interface SatParametersOrBuilder
      Returns:
      Whether the stopAfterFirstSolution field is set.
    • getStopAfterFirstSolution

      public boolean getStopAfterFirstSolution()
       For an optimization problem, stop the solver as soon as we have a solution.
       
      optional bool stop_after_first_solution = 98 [default = false];
      Specified by:
      getStopAfterFirstSolution in interface SatParametersOrBuilder
      Returns:
      The stopAfterFirstSolution.
    • setStopAfterFirstSolution

      public SatParameters.Builder setStopAfterFirstSolution(boolean value)
       For an optimization problem, stop the solver as soon as we have a solution.
       
      optional bool stop_after_first_solution = 98 [default = false];
      Parameters:
      value - The stopAfterFirstSolution to set.
      Returns:
      This builder for chaining.
    • clearStopAfterFirstSolution

      public SatParameters.Builder clearStopAfterFirstSolution()
       For an optimization problem, stop the solver as soon as we have a solution.
       
      optional bool stop_after_first_solution = 98 [default = false];
      Returns:
      This builder for chaining.
    • hasStopAfterPresolve

      public boolean hasStopAfterPresolve()
       Mainly used when improving the presolver. When true, stops the solver after
       the presolve is complete (or after loading and root level propagation).
       
      optional bool stop_after_presolve = 149 [default = false];
      Specified by:
      hasStopAfterPresolve in interface SatParametersOrBuilder
      Returns:
      Whether the stopAfterPresolve field is set.
    • getStopAfterPresolve

      public boolean getStopAfterPresolve()
       Mainly used when improving the presolver. When true, stops the solver after
       the presolve is complete (or after loading and root level propagation).
       
      optional bool stop_after_presolve = 149 [default = false];
      Specified by:
      getStopAfterPresolve in interface SatParametersOrBuilder
      Returns:
      The stopAfterPresolve.
    • setStopAfterPresolve

      public SatParameters.Builder setStopAfterPresolve(boolean value)
       Mainly used when improving the presolver. When true, stops the solver after
       the presolve is complete (or after loading and root level propagation).
       
      optional bool stop_after_presolve = 149 [default = false];
      Parameters:
      value - The stopAfterPresolve to set.
      Returns:
      This builder for chaining.
    • clearStopAfterPresolve

      public SatParameters.Builder clearStopAfterPresolve()
       Mainly used when improving the presolver. When true, stops the solver after
       the presolve is complete (or after loading and root level propagation).
       
      optional bool stop_after_presolve = 149 [default = false];
      Returns:
      This builder for chaining.
    • hasStopAfterRootPropagation

      public boolean hasStopAfterRootPropagation()
      optional bool stop_after_root_propagation = 252 [default = false];
      Specified by:
      hasStopAfterRootPropagation in interface SatParametersOrBuilder
      Returns:
      Whether the stopAfterRootPropagation field is set.
    • getStopAfterRootPropagation

      public boolean getStopAfterRootPropagation()
      optional bool stop_after_root_propagation = 252 [default = false];
      Specified by:
      getStopAfterRootPropagation in interface SatParametersOrBuilder
      Returns:
      The stopAfterRootPropagation.
    • setStopAfterRootPropagation

      public SatParameters.Builder setStopAfterRootPropagation(boolean value)
      optional bool stop_after_root_propagation = 252 [default = false];
      Parameters:
      value - The stopAfterRootPropagation to set.
      Returns:
      This builder for chaining.
    • clearStopAfterRootPropagation

      public SatParameters.Builder clearStopAfterRootPropagation()
      optional bool stop_after_root_propagation = 252 [default = false];
      Returns:
      This builder for chaining.
    • hasLnsInitialDifficulty

      public boolean hasLnsInitialDifficulty()
       Initial parameters for neighborhood generation.
       
      optional double lns_initial_difficulty = 307 [default = 0.5];
      Specified by:
      hasLnsInitialDifficulty in interface SatParametersOrBuilder
      Returns:
      Whether the lnsInitialDifficulty field is set.
    • getLnsInitialDifficulty

      public double getLnsInitialDifficulty()
       Initial parameters for neighborhood generation.
       
      optional double lns_initial_difficulty = 307 [default = 0.5];
      Specified by:
      getLnsInitialDifficulty in interface SatParametersOrBuilder
      Returns:
      The lnsInitialDifficulty.
    • setLnsInitialDifficulty

      public SatParameters.Builder setLnsInitialDifficulty(double value)
       Initial parameters for neighborhood generation.
       
      optional double lns_initial_difficulty = 307 [default = 0.5];
      Parameters:
      value - The lnsInitialDifficulty to set.
      Returns:
      This builder for chaining.
    • clearLnsInitialDifficulty

      public SatParameters.Builder clearLnsInitialDifficulty()
       Initial parameters for neighborhood generation.
       
      optional double lns_initial_difficulty = 307 [default = 0.5];
      Returns:
      This builder for chaining.
    • hasLnsInitialDeterministicLimit

      public boolean hasLnsInitialDeterministicLimit()
      optional double lns_initial_deterministic_limit = 308 [default = 0.1];
      Specified by:
      hasLnsInitialDeterministicLimit in interface SatParametersOrBuilder
      Returns:
      Whether the lnsInitialDeterministicLimit field is set.
    • getLnsInitialDeterministicLimit

      public double getLnsInitialDeterministicLimit()
      optional double lns_initial_deterministic_limit = 308 [default = 0.1];
      Specified by:
      getLnsInitialDeterministicLimit in interface SatParametersOrBuilder
      Returns:
      The lnsInitialDeterministicLimit.
    • setLnsInitialDeterministicLimit

      public SatParameters.Builder setLnsInitialDeterministicLimit(double value)
      optional double lns_initial_deterministic_limit = 308 [default = 0.1];
      Parameters:
      value - The lnsInitialDeterministicLimit to set.
      Returns:
      This builder for chaining.
    • clearLnsInitialDeterministicLimit

      public SatParameters.Builder clearLnsInitialDeterministicLimit()
      optional double lns_initial_deterministic_limit = 308 [default = 0.1];
      Returns:
      This builder for chaining.
    • hasUseLns

      public boolean hasUseLns()
       Testing parameters used to disable all lns workers.
       
      optional bool use_lns = 283 [default = true];
      Specified by:
      hasUseLns in interface SatParametersOrBuilder
      Returns:
      Whether the useLns field is set.
    • getUseLns

      public boolean getUseLns()
       Testing parameters used to disable all lns workers.
       
      optional bool use_lns = 283 [default = true];
      Specified by:
      getUseLns in interface SatParametersOrBuilder
      Returns:
      The useLns.
    • setUseLns

      public SatParameters.Builder setUseLns(boolean value)
       Testing parameters used to disable all lns workers.
       
      optional bool use_lns = 283 [default = true];
      Parameters:
      value - The useLns to set.
      Returns:
      This builder for chaining.
    • clearUseLns

      public SatParameters.Builder clearUseLns()
       Testing parameters used to disable all lns workers.
       
      optional bool use_lns = 283 [default = true];
      Returns:
      This builder for chaining.
    • hasUseLnsOnly

      public boolean hasUseLnsOnly()
       Experimental parameters to disable everything but lns.
       
      optional bool use_lns_only = 101 [default = false];
      Specified by:
      hasUseLnsOnly in interface SatParametersOrBuilder
      Returns:
      Whether the useLnsOnly field is set.
    • getUseLnsOnly

      public boolean getUseLnsOnly()
       Experimental parameters to disable everything but lns.
       
      optional bool use_lns_only = 101 [default = false];
      Specified by:
      getUseLnsOnly in interface SatParametersOrBuilder
      Returns:
      The useLnsOnly.
    • setUseLnsOnly

      public SatParameters.Builder setUseLnsOnly(boolean value)
       Experimental parameters to disable everything but lns.
       
      optional bool use_lns_only = 101 [default = false];
      Parameters:
      value - The useLnsOnly to set.
      Returns:
      This builder for chaining.
    • clearUseLnsOnly

      public SatParameters.Builder clearUseLnsOnly()
       Experimental parameters to disable everything but lns.
       
      optional bool use_lns_only = 101 [default = false];
      Returns:
      This builder for chaining.
    • hasSolutionPoolSize

      public boolean hasSolutionPoolSize()
       Size of the top-n different solutions kept by the solver.
       This parameter must be > 0.
       Currently this only impact the "base" solution chosen for a LNS fragment.
       
      optional int32 solution_pool_size = 193 [default = 3];
      Specified by:
      hasSolutionPoolSize in interface SatParametersOrBuilder
      Returns:
      Whether the solutionPoolSize field is set.
    • getSolutionPoolSize

      public int getSolutionPoolSize()
       Size of the top-n different solutions kept by the solver.
       This parameter must be > 0.
       Currently this only impact the "base" solution chosen for a LNS fragment.
       
      optional int32 solution_pool_size = 193 [default = 3];
      Specified by:
      getSolutionPoolSize in interface SatParametersOrBuilder
      Returns:
      The solutionPoolSize.
    • setSolutionPoolSize

      public SatParameters.Builder setSolutionPoolSize(int value)
       Size of the top-n different solutions kept by the solver.
       This parameter must be > 0.
       Currently this only impact the "base" solution chosen for a LNS fragment.
       
      optional int32 solution_pool_size = 193 [default = 3];
      Parameters:
      value - The solutionPoolSize to set.
      Returns:
      This builder for chaining.
    • clearSolutionPoolSize

      public SatParameters.Builder clearSolutionPoolSize()
       Size of the top-n different solutions kept by the solver.
       This parameter must be > 0.
       Currently this only impact the "base" solution chosen for a LNS fragment.
       
      optional int32 solution_pool_size = 193 [default = 3];
      Returns:
      This builder for chaining.
    • hasUseRinsLns

      public boolean hasUseRinsLns()
       Turns on relaxation induced neighborhood generator.
       
      optional bool use_rins_lns = 129 [default = true];
      Specified by:
      hasUseRinsLns in interface SatParametersOrBuilder
      Returns:
      Whether the useRinsLns field is set.
    • getUseRinsLns

      public boolean getUseRinsLns()
       Turns on relaxation induced neighborhood generator.
       
      optional bool use_rins_lns = 129 [default = true];
      Specified by:
      getUseRinsLns in interface SatParametersOrBuilder
      Returns:
      The useRinsLns.
    • setUseRinsLns

      public SatParameters.Builder setUseRinsLns(boolean value)
       Turns on relaxation induced neighborhood generator.
       
      optional bool use_rins_lns = 129 [default = true];
      Parameters:
      value - The useRinsLns to set.
      Returns:
      This builder for chaining.
    • clearUseRinsLns

      public SatParameters.Builder clearUseRinsLns()
       Turns on relaxation induced neighborhood generator.
       
      optional bool use_rins_lns = 129 [default = true];
      Returns:
      This builder for chaining.
    • hasUseFeasibilityPump

      public boolean hasUseFeasibilityPump()
       Adds a feasibility pump subsolver along with lns subsolvers.
       
      optional bool use_feasibility_pump = 164 [default = true];
      Specified by:
      hasUseFeasibilityPump in interface SatParametersOrBuilder
      Returns:
      Whether the useFeasibilityPump field is set.
    • getUseFeasibilityPump

      public boolean getUseFeasibilityPump()
       Adds a feasibility pump subsolver along with lns subsolvers.
       
      optional bool use_feasibility_pump = 164 [default = true];
      Specified by:
      getUseFeasibilityPump in interface SatParametersOrBuilder
      Returns:
      The useFeasibilityPump.
    • setUseFeasibilityPump

      public SatParameters.Builder setUseFeasibilityPump(boolean value)
       Adds a feasibility pump subsolver along with lns subsolvers.
       
      optional bool use_feasibility_pump = 164 [default = true];
      Parameters:
      value - The useFeasibilityPump to set.
      Returns:
      This builder for chaining.
    • clearUseFeasibilityPump

      public SatParameters.Builder clearUseFeasibilityPump()
       Adds a feasibility pump subsolver along with lns subsolvers.
       
      optional bool use_feasibility_pump = 164 [default = true];
      Returns:
      This builder for chaining.
    • hasUseLbRelaxLns

      public boolean hasUseLbRelaxLns()
       Turns on neighborhood generator based on local branching LP. Based on Huang
       et al., "Local Branching Relaxation Heuristics for Integer Linear
       Programs", 2023.
       
      optional bool use_lb_relax_lns = 255 [default = true];
      Specified by:
      hasUseLbRelaxLns in interface SatParametersOrBuilder
      Returns:
      Whether the useLbRelaxLns field is set.
    • getUseLbRelaxLns

      public boolean getUseLbRelaxLns()
       Turns on neighborhood generator based on local branching LP. Based on Huang
       et al., "Local Branching Relaxation Heuristics for Integer Linear
       Programs", 2023.
       
      optional bool use_lb_relax_lns = 255 [default = true];
      Specified by:
      getUseLbRelaxLns in interface SatParametersOrBuilder
      Returns:
      The useLbRelaxLns.
    • setUseLbRelaxLns

      public SatParameters.Builder setUseLbRelaxLns(boolean value)
       Turns on neighborhood generator based on local branching LP. Based on Huang
       et al., "Local Branching Relaxation Heuristics for Integer Linear
       Programs", 2023.
       
      optional bool use_lb_relax_lns = 255 [default = true];
      Parameters:
      value - The useLbRelaxLns to set.
      Returns:
      This builder for chaining.
    • clearUseLbRelaxLns

      public SatParameters.Builder clearUseLbRelaxLns()
       Turns on neighborhood generator based on local branching LP. Based on Huang
       et al., "Local Branching Relaxation Heuristics for Integer Linear
       Programs", 2023.
       
      optional bool use_lb_relax_lns = 255 [default = true];
      Returns:
      This builder for chaining.
    • hasLbRelaxNumWorkersThreshold

      public boolean hasLbRelaxNumWorkersThreshold()
       Only use lb-relax if we have at least that many workers.
       
      optional int32 lb_relax_num_workers_threshold = 296 [default = 16];
      Specified by:
      hasLbRelaxNumWorkersThreshold in interface SatParametersOrBuilder
      Returns:
      Whether the lbRelaxNumWorkersThreshold field is set.
    • getLbRelaxNumWorkersThreshold

      public int getLbRelaxNumWorkersThreshold()
       Only use lb-relax if we have at least that many workers.
       
      optional int32 lb_relax_num_workers_threshold = 296 [default = 16];
      Specified by:
      getLbRelaxNumWorkersThreshold in interface SatParametersOrBuilder
      Returns:
      The lbRelaxNumWorkersThreshold.
    • setLbRelaxNumWorkersThreshold

      public SatParameters.Builder setLbRelaxNumWorkersThreshold(int value)
       Only use lb-relax if we have at least that many workers.
       
      optional int32 lb_relax_num_workers_threshold = 296 [default = 16];
      Parameters:
      value - The lbRelaxNumWorkersThreshold to set.
      Returns:
      This builder for chaining.
    • clearLbRelaxNumWorkersThreshold

      public SatParameters.Builder clearLbRelaxNumWorkersThreshold()
       Only use lb-relax if we have at least that many workers.
       
      optional int32 lb_relax_num_workers_threshold = 296 [default = 16];
      Returns:
      This builder for chaining.
    • hasFpRounding

      public boolean hasFpRounding()
      optional .operations_research.sat.SatParameters.FPRoundingMethod fp_rounding = 165 [default = PROPAGATION_ASSISTED];
      Specified by:
      hasFpRounding in interface SatParametersOrBuilder
      Returns:
      Whether the fpRounding field is set.
    • getFpRounding

      public SatParameters.FPRoundingMethod getFpRounding()
      optional .operations_research.sat.SatParameters.FPRoundingMethod fp_rounding = 165 [default = PROPAGATION_ASSISTED];
      Specified by:
      getFpRounding in interface SatParametersOrBuilder
      Returns:
      The fpRounding.
    • setFpRounding

      optional .operations_research.sat.SatParameters.FPRoundingMethod fp_rounding = 165 [default = PROPAGATION_ASSISTED];
      Parameters:
      value - The fpRounding to set.
      Returns:
      This builder for chaining.
    • clearFpRounding

      public SatParameters.Builder clearFpRounding()
      optional .operations_research.sat.SatParameters.FPRoundingMethod fp_rounding = 165 [default = PROPAGATION_ASSISTED];
      Returns:
      This builder for chaining.
    • hasDiversifyLnsParams

      public boolean hasDiversifyLnsParams()
       If true, registers more lns subsolvers with different parameters.
       
      optional bool diversify_lns_params = 137 [default = false];
      Specified by:
      hasDiversifyLnsParams in interface SatParametersOrBuilder
      Returns:
      Whether the diversifyLnsParams field is set.
    • getDiversifyLnsParams

      public boolean getDiversifyLnsParams()
       If true, registers more lns subsolvers with different parameters.
       
      optional bool diversify_lns_params = 137 [default = false];
      Specified by:
      getDiversifyLnsParams in interface SatParametersOrBuilder
      Returns:
      The diversifyLnsParams.
    • setDiversifyLnsParams

      public SatParameters.Builder setDiversifyLnsParams(boolean value)
       If true, registers more lns subsolvers with different parameters.
       
      optional bool diversify_lns_params = 137 [default = false];
      Parameters:
      value - The diversifyLnsParams to set.
      Returns:
      This builder for chaining.
    • clearDiversifyLnsParams

      public SatParameters.Builder clearDiversifyLnsParams()
       If true, registers more lns subsolvers with different parameters.
       
      optional bool diversify_lns_params = 137 [default = false];
      Returns:
      This builder for chaining.
    • hasRandomizeSearch

      public boolean hasRandomizeSearch()
       Randomize fixed search.
       
      optional bool randomize_search = 103 [default = false];
      Specified by:
      hasRandomizeSearch in interface SatParametersOrBuilder
      Returns:
      Whether the randomizeSearch field is set.
    • getRandomizeSearch

      public boolean getRandomizeSearch()
       Randomize fixed search.
       
      optional bool randomize_search = 103 [default = false];
      Specified by:
      getRandomizeSearch in interface SatParametersOrBuilder
      Returns:
      The randomizeSearch.
    • setRandomizeSearch

      public SatParameters.Builder setRandomizeSearch(boolean value)
       Randomize fixed search.
       
      optional bool randomize_search = 103 [default = false];
      Parameters:
      value - The randomizeSearch to set.
      Returns:
      This builder for chaining.
    • clearRandomizeSearch

      public SatParameters.Builder clearRandomizeSearch()
       Randomize fixed search.
       
      optional bool randomize_search = 103 [default = false];
      Returns:
      This builder for chaining.
    • hasSearchRandomVariablePoolSize

      public boolean hasSearchRandomVariablePoolSize()
       Search randomization will collect the top
       'search_random_variable_pool_size' valued variables, and pick one randomly.
       The value of the variable is specific to each strategy.
       
      optional int64 search_random_variable_pool_size = 104 [default = 0];
      Specified by:
      hasSearchRandomVariablePoolSize in interface SatParametersOrBuilder
      Returns:
      Whether the searchRandomVariablePoolSize field is set.
    • getSearchRandomVariablePoolSize

      public long getSearchRandomVariablePoolSize()
       Search randomization will collect the top
       'search_random_variable_pool_size' valued variables, and pick one randomly.
       The value of the variable is specific to each strategy.
       
      optional int64 search_random_variable_pool_size = 104 [default = 0];
      Specified by:
      getSearchRandomVariablePoolSize in interface SatParametersOrBuilder
      Returns:
      The searchRandomVariablePoolSize.
    • setSearchRandomVariablePoolSize

      public SatParameters.Builder setSearchRandomVariablePoolSize(long value)
       Search randomization will collect the top
       'search_random_variable_pool_size' valued variables, and pick one randomly.
       The value of the variable is specific to each strategy.
       
      optional int64 search_random_variable_pool_size = 104 [default = 0];
      Parameters:
      value - The searchRandomVariablePoolSize to set.
      Returns:
      This builder for chaining.
    • clearSearchRandomVariablePoolSize

      public SatParameters.Builder clearSearchRandomVariablePoolSize()
       Search randomization will collect the top
       'search_random_variable_pool_size' valued variables, and pick one randomly.
       The value of the variable is specific to each strategy.
       
      optional int64 search_random_variable_pool_size = 104 [default = 0];
      Returns:
      This builder for chaining.
    • hasPushAllTasksTowardStart

      public boolean hasPushAllTasksTowardStart()
       Experimental code: specify if the objective pushes all tasks toward the
       start of the schedule.
       
      optional bool push_all_tasks_toward_start = 262 [default = false];
      Specified by:
      hasPushAllTasksTowardStart in interface SatParametersOrBuilder
      Returns:
      Whether the pushAllTasksTowardStart field is set.
    • getPushAllTasksTowardStart

      public boolean getPushAllTasksTowardStart()
       Experimental code: specify if the objective pushes all tasks toward the
       start of the schedule.
       
      optional bool push_all_tasks_toward_start = 262 [default = false];
      Specified by:
      getPushAllTasksTowardStart in interface SatParametersOrBuilder
      Returns:
      The pushAllTasksTowardStart.
    • setPushAllTasksTowardStart

      public SatParameters.Builder setPushAllTasksTowardStart(boolean value)
       Experimental code: specify if the objective pushes all tasks toward the
       start of the schedule.
       
      optional bool push_all_tasks_toward_start = 262 [default = false];
      Parameters:
      value - The pushAllTasksTowardStart to set.
      Returns:
      This builder for chaining.
    • clearPushAllTasksTowardStart

      public SatParameters.Builder clearPushAllTasksTowardStart()
       Experimental code: specify if the objective pushes all tasks toward the
       start of the schedule.
       
      optional bool push_all_tasks_toward_start = 262 [default = false];
      Returns:
      This builder for chaining.
    • hasUseOptionalVariables

      public boolean hasUseOptionalVariables()
       If true, we automatically detect variables whose constraint are always
       enforced by the same literal and we mark them as optional. This allows
       to propagate them as if they were present in some situation.
      
       TODO(user): This is experimental and seems to lead to wrong optimal in
       some situation. It should however gives correct solutions. Fix.
       
      optional bool use_optional_variables = 108 [default = false];
      Specified by:
      hasUseOptionalVariables in interface SatParametersOrBuilder
      Returns:
      Whether the useOptionalVariables field is set.
    • getUseOptionalVariables

      public boolean getUseOptionalVariables()
       If true, we automatically detect variables whose constraint are always
       enforced by the same literal and we mark them as optional. This allows
       to propagate them as if they were present in some situation.
      
       TODO(user): This is experimental and seems to lead to wrong optimal in
       some situation. It should however gives correct solutions. Fix.
       
      optional bool use_optional_variables = 108 [default = false];
      Specified by:
      getUseOptionalVariables in interface SatParametersOrBuilder
      Returns:
      The useOptionalVariables.
    • setUseOptionalVariables

      public SatParameters.Builder setUseOptionalVariables(boolean value)
       If true, we automatically detect variables whose constraint are always
       enforced by the same literal and we mark them as optional. This allows
       to propagate them as if they were present in some situation.
      
       TODO(user): This is experimental and seems to lead to wrong optimal in
       some situation. It should however gives correct solutions. Fix.
       
      optional bool use_optional_variables = 108 [default = false];
      Parameters:
      value - The useOptionalVariables to set.
      Returns:
      This builder for chaining.
    • clearUseOptionalVariables

      public SatParameters.Builder clearUseOptionalVariables()
       If true, we automatically detect variables whose constraint are always
       enforced by the same literal and we mark them as optional. This allows
       to propagate them as if they were present in some situation.
      
       TODO(user): This is experimental and seems to lead to wrong optimal in
       some situation. It should however gives correct solutions. Fix.
       
      optional bool use_optional_variables = 108 [default = false];
      Returns:
      This builder for chaining.
    • hasUseExactLpReason

      public boolean hasUseExactLpReason()
       The solver usually exploit the LP relaxation of a model. If this option is
       true, then whatever is infered by the LP will be used like an heuristic to
       compute EXACT propagation on the IP. So with this option, there is no
       numerical imprecision issues.
       
      optional bool use_exact_lp_reason = 109 [default = true];
      Specified by:
      hasUseExactLpReason in interface SatParametersOrBuilder
      Returns:
      Whether the useExactLpReason field is set.
    • getUseExactLpReason

      public boolean getUseExactLpReason()
       The solver usually exploit the LP relaxation of a model. If this option is
       true, then whatever is infered by the LP will be used like an heuristic to
       compute EXACT propagation on the IP. So with this option, there is no
       numerical imprecision issues.
       
      optional bool use_exact_lp_reason = 109 [default = true];
      Specified by:
      getUseExactLpReason in interface SatParametersOrBuilder
      Returns:
      The useExactLpReason.
    • setUseExactLpReason

      public SatParameters.Builder setUseExactLpReason(boolean value)
       The solver usually exploit the LP relaxation of a model. If this option is
       true, then whatever is infered by the LP will be used like an heuristic to
       compute EXACT propagation on the IP. So with this option, there is no
       numerical imprecision issues.
       
      optional bool use_exact_lp_reason = 109 [default = true];
      Parameters:
      value - The useExactLpReason to set.
      Returns:
      This builder for chaining.
    • clearUseExactLpReason

      public SatParameters.Builder clearUseExactLpReason()
       The solver usually exploit the LP relaxation of a model. If this option is
       true, then whatever is infered by the LP will be used like an heuristic to
       compute EXACT propagation on the IP. So with this option, there is no
       numerical imprecision issues.
       
      optional bool use_exact_lp_reason = 109 [default = true];
      Returns:
      This builder for chaining.
    • hasUseCombinedNoOverlap

      public boolean hasUseCombinedNoOverlap()
       This can be beneficial if there is a lot of no-overlap constraints but a
       relatively low number of different intervals in the problem. Like 1000
       intervals, but 1M intervals in the no-overlap constraints covering them.
       
      optional bool use_combined_no_overlap = 133 [default = false];
      Specified by:
      hasUseCombinedNoOverlap in interface SatParametersOrBuilder
      Returns:
      Whether the useCombinedNoOverlap field is set.
    • getUseCombinedNoOverlap

      public boolean getUseCombinedNoOverlap()
       This can be beneficial if there is a lot of no-overlap constraints but a
       relatively low number of different intervals in the problem. Like 1000
       intervals, but 1M intervals in the no-overlap constraints covering them.
       
      optional bool use_combined_no_overlap = 133 [default = false];
      Specified by:
      getUseCombinedNoOverlap in interface SatParametersOrBuilder
      Returns:
      The useCombinedNoOverlap.
    • setUseCombinedNoOverlap

      public SatParameters.Builder setUseCombinedNoOverlap(boolean value)
       This can be beneficial if there is a lot of no-overlap constraints but a
       relatively low number of different intervals in the problem. Like 1000
       intervals, but 1M intervals in the no-overlap constraints covering them.
       
      optional bool use_combined_no_overlap = 133 [default = false];
      Parameters:
      value - The useCombinedNoOverlap to set.
      Returns:
      This builder for chaining.
    • clearUseCombinedNoOverlap

      public SatParameters.Builder clearUseCombinedNoOverlap()
       This can be beneficial if there is a lot of no-overlap constraints but a
       relatively low number of different intervals in the problem. Like 1000
       intervals, but 1M intervals in the no-overlap constraints covering them.
       
      optional bool use_combined_no_overlap = 133 [default = false];
      Returns:
      This builder for chaining.
    • hasAtMostOneMaxExpansionSize

      public boolean hasAtMostOneMaxExpansionSize()
       All at_most_one constraints with a size <= param will be replaced by a
       quadratic number of binary implications.
       
      optional int32 at_most_one_max_expansion_size = 270 [default = 3];
      Specified by:
      hasAtMostOneMaxExpansionSize in interface SatParametersOrBuilder
      Returns:
      Whether the atMostOneMaxExpansionSize field is set.
    • getAtMostOneMaxExpansionSize

      public int getAtMostOneMaxExpansionSize()
       All at_most_one constraints with a size <= param will be replaced by a
       quadratic number of binary implications.
       
      optional int32 at_most_one_max_expansion_size = 270 [default = 3];
      Specified by:
      getAtMostOneMaxExpansionSize in interface SatParametersOrBuilder
      Returns:
      The atMostOneMaxExpansionSize.
    • setAtMostOneMaxExpansionSize

      public SatParameters.Builder setAtMostOneMaxExpansionSize(int value)
       All at_most_one constraints with a size <= param will be replaced by a
       quadratic number of binary implications.
       
      optional int32 at_most_one_max_expansion_size = 270 [default = 3];
      Parameters:
      value - The atMostOneMaxExpansionSize to set.
      Returns:
      This builder for chaining.
    • clearAtMostOneMaxExpansionSize

      public SatParameters.Builder clearAtMostOneMaxExpansionSize()
       All at_most_one constraints with a size <= param will be replaced by a
       quadratic number of binary implications.
       
      optional int32 at_most_one_max_expansion_size = 270 [default = 3];
      Returns:
      This builder for chaining.
    • hasCatchSigintSignal

      public boolean hasCatchSigintSignal()
       Indicates if the CP-SAT layer should catch Control-C (SIGINT) signals
       when calling solve. If set, catching the SIGINT signal will terminate the
       search gracefully, as if a time limit was reached.
       
      optional bool catch_sigint_signal = 135 [default = true];
      Specified by:
      hasCatchSigintSignal in interface SatParametersOrBuilder
      Returns:
      Whether the catchSigintSignal field is set.
    • getCatchSigintSignal

      public boolean getCatchSigintSignal()
       Indicates if the CP-SAT layer should catch Control-C (SIGINT) signals
       when calling solve. If set, catching the SIGINT signal will terminate the
       search gracefully, as if a time limit was reached.
       
      optional bool catch_sigint_signal = 135 [default = true];
      Specified by:
      getCatchSigintSignal in interface SatParametersOrBuilder
      Returns:
      The catchSigintSignal.
    • setCatchSigintSignal

      public SatParameters.Builder setCatchSigintSignal(boolean value)
       Indicates if the CP-SAT layer should catch Control-C (SIGINT) signals
       when calling solve. If set, catching the SIGINT signal will terminate the
       search gracefully, as if a time limit was reached.
       
      optional bool catch_sigint_signal = 135 [default = true];
      Parameters:
      value - The catchSigintSignal to set.
      Returns:
      This builder for chaining.
    • clearCatchSigintSignal

      public SatParameters.Builder clearCatchSigintSignal()
       Indicates if the CP-SAT layer should catch Control-C (SIGINT) signals
       when calling solve. If set, catching the SIGINT signal will terminate the
       search gracefully, as if a time limit was reached.
       
      optional bool catch_sigint_signal = 135 [default = true];
      Returns:
      This builder for chaining.
    • hasUseImpliedBounds

      public boolean hasUseImpliedBounds()
       Stores and exploits "implied-bounds" in the solver. That is, relations of
       the form literal => (var >= bound). This is currently used to derive
       stronger cuts.
       
      optional bool use_implied_bounds = 144 [default = true];
      Specified by:
      hasUseImpliedBounds in interface SatParametersOrBuilder
      Returns:
      Whether the useImpliedBounds field is set.
    • getUseImpliedBounds

      public boolean getUseImpliedBounds()
       Stores and exploits "implied-bounds" in the solver. That is, relations of
       the form literal => (var >= bound). This is currently used to derive
       stronger cuts.
       
      optional bool use_implied_bounds = 144 [default = true];
      Specified by:
      getUseImpliedBounds in interface SatParametersOrBuilder
      Returns:
      The useImpliedBounds.
    • setUseImpliedBounds

      public SatParameters.Builder setUseImpliedBounds(boolean value)
       Stores and exploits "implied-bounds" in the solver. That is, relations of
       the form literal => (var >= bound). This is currently used to derive
       stronger cuts.
       
      optional bool use_implied_bounds = 144 [default = true];
      Parameters:
      value - The useImpliedBounds to set.
      Returns:
      This builder for chaining.
    • clearUseImpliedBounds

      public SatParameters.Builder clearUseImpliedBounds()
       Stores and exploits "implied-bounds" in the solver. That is, relations of
       the form literal => (var >= bound). This is currently used to derive
       stronger cuts.
       
      optional bool use_implied_bounds = 144 [default = true];
      Returns:
      This builder for chaining.
    • hasPolishLpSolution

      public boolean hasPolishLpSolution()
       Whether we try to do a few degenerate iteration at the end of an LP solve
       to minimize the fractionality of the integer variable in the basis. This
       helps on some problems, but not so much on others. It also cost of bit of
       time to do such polish step.
       
      optional bool polish_lp_solution = 175 [default = false];
      Specified by:
      hasPolishLpSolution in interface SatParametersOrBuilder
      Returns:
      Whether the polishLpSolution field is set.
    • getPolishLpSolution

      public boolean getPolishLpSolution()
       Whether we try to do a few degenerate iteration at the end of an LP solve
       to minimize the fractionality of the integer variable in the basis. This
       helps on some problems, but not so much on others. It also cost of bit of
       time to do such polish step.
       
      optional bool polish_lp_solution = 175 [default = false];
      Specified by:
      getPolishLpSolution in interface SatParametersOrBuilder
      Returns:
      The polishLpSolution.
    • setPolishLpSolution

      public SatParameters.Builder setPolishLpSolution(boolean value)
       Whether we try to do a few degenerate iteration at the end of an LP solve
       to minimize the fractionality of the integer variable in the basis. This
       helps on some problems, but not so much on others. It also cost of bit of
       time to do such polish step.
       
      optional bool polish_lp_solution = 175 [default = false];
      Parameters:
      value - The polishLpSolution to set.
      Returns:
      This builder for chaining.
    • clearPolishLpSolution

      public SatParameters.Builder clearPolishLpSolution()
       Whether we try to do a few degenerate iteration at the end of an LP solve
       to minimize the fractionality of the integer variable in the basis. This
       helps on some problems, but not so much on others. It also cost of bit of
       time to do such polish step.
       
      optional bool polish_lp_solution = 175 [default = false];
      Returns:
      This builder for chaining.
    • hasLpPrimalTolerance

      public boolean hasLpPrimalTolerance()
       The internal LP tolerances used by CP-SAT. These applies to the internal
       and scaled problem. If the domains of your variables are large it might be
       good to use lower tolerances. If your problem is binary with low
       coefficients, it might be good to use higher ones to speed-up the lp
       solves.
       
      optional double lp_primal_tolerance = 266 [default = 1e-07];
      Specified by:
      hasLpPrimalTolerance in interface SatParametersOrBuilder
      Returns:
      Whether the lpPrimalTolerance field is set.
    • getLpPrimalTolerance

      public double getLpPrimalTolerance()
       The internal LP tolerances used by CP-SAT. These applies to the internal
       and scaled problem. If the domains of your variables are large it might be
       good to use lower tolerances. If your problem is binary with low
       coefficients, it might be good to use higher ones to speed-up the lp
       solves.
       
      optional double lp_primal_tolerance = 266 [default = 1e-07];
      Specified by:
      getLpPrimalTolerance in interface SatParametersOrBuilder
      Returns:
      The lpPrimalTolerance.
    • setLpPrimalTolerance

      public SatParameters.Builder setLpPrimalTolerance(double value)
       The internal LP tolerances used by CP-SAT. These applies to the internal
       and scaled problem. If the domains of your variables are large it might be
       good to use lower tolerances. If your problem is binary with low
       coefficients, it might be good to use higher ones to speed-up the lp
       solves.
       
      optional double lp_primal_tolerance = 266 [default = 1e-07];
      Parameters:
      value - The lpPrimalTolerance to set.
      Returns:
      This builder for chaining.
    • clearLpPrimalTolerance

      public SatParameters.Builder clearLpPrimalTolerance()
       The internal LP tolerances used by CP-SAT. These applies to the internal
       and scaled problem. If the domains of your variables are large it might be
       good to use lower tolerances. If your problem is binary with low
       coefficients, it might be good to use higher ones to speed-up the lp
       solves.
       
      optional double lp_primal_tolerance = 266 [default = 1e-07];
      Returns:
      This builder for chaining.
    • hasLpDualTolerance

      public boolean hasLpDualTolerance()
      optional double lp_dual_tolerance = 267 [default = 1e-07];
      Specified by:
      hasLpDualTolerance in interface SatParametersOrBuilder
      Returns:
      Whether the lpDualTolerance field is set.
    • getLpDualTolerance

      public double getLpDualTolerance()
      optional double lp_dual_tolerance = 267 [default = 1e-07];
      Specified by:
      getLpDualTolerance in interface SatParametersOrBuilder
      Returns:
      The lpDualTolerance.
    • setLpDualTolerance

      public SatParameters.Builder setLpDualTolerance(double value)
      optional double lp_dual_tolerance = 267 [default = 1e-07];
      Parameters:
      value - The lpDualTolerance to set.
      Returns:
      This builder for chaining.
    • clearLpDualTolerance

      public SatParameters.Builder clearLpDualTolerance()
      optional double lp_dual_tolerance = 267 [default = 1e-07];
      Returns:
      This builder for chaining.
    • hasConvertIntervals

      public boolean hasConvertIntervals()
       Temporary flag util the feature is more mature. This convert intervals to
       the newer proto format that support affine start/var/end instead of just
       variables.
       
      optional bool convert_intervals = 177 [default = true];
      Specified by:
      hasConvertIntervals in interface SatParametersOrBuilder
      Returns:
      Whether the convertIntervals field is set.
    • getConvertIntervals

      public boolean getConvertIntervals()
       Temporary flag util the feature is more mature. This convert intervals to
       the newer proto format that support affine start/var/end instead of just
       variables.
       
      optional bool convert_intervals = 177 [default = true];
      Specified by:
      getConvertIntervals in interface SatParametersOrBuilder
      Returns:
      The convertIntervals.
    • setConvertIntervals

      public SatParameters.Builder setConvertIntervals(boolean value)
       Temporary flag util the feature is more mature. This convert intervals to
       the newer proto format that support affine start/var/end instead of just
       variables.
       
      optional bool convert_intervals = 177 [default = true];
      Parameters:
      value - The convertIntervals to set.
      Returns:
      This builder for chaining.
    • clearConvertIntervals

      public SatParameters.Builder clearConvertIntervals()
       Temporary flag util the feature is more mature. This convert intervals to
       the newer proto format that support affine start/var/end instead of just
       variables.
       
      optional bool convert_intervals = 177 [default = true];
      Returns:
      This builder for chaining.
    • hasSymmetryLevel

      public boolean hasSymmetryLevel()
       Whether we try to automatically detect the symmetries in a model and
       exploit them. Currently, at level 1 we detect them in presolve and try
       to fix Booleans. At level 2, we also do some form of dynamic symmetry
       breaking during search. At level 3, we also detect symmetries for very
       large models, which can be slow. At level 4, we try to break as much
       symmetry as possible in presolve.
       
      optional int32 symmetry_level = 183 [default = 2];
      Specified by:
      hasSymmetryLevel in interface SatParametersOrBuilder
      Returns:
      Whether the symmetryLevel field is set.
    • getSymmetryLevel

      public int getSymmetryLevel()
       Whether we try to automatically detect the symmetries in a model and
       exploit them. Currently, at level 1 we detect them in presolve and try
       to fix Booleans. At level 2, we also do some form of dynamic symmetry
       breaking during search. At level 3, we also detect symmetries for very
       large models, which can be slow. At level 4, we try to break as much
       symmetry as possible in presolve.
       
      optional int32 symmetry_level = 183 [default = 2];
      Specified by:
      getSymmetryLevel in interface SatParametersOrBuilder
      Returns:
      The symmetryLevel.
    • setSymmetryLevel

      public SatParameters.Builder setSymmetryLevel(int value)
       Whether we try to automatically detect the symmetries in a model and
       exploit them. Currently, at level 1 we detect them in presolve and try
       to fix Booleans. At level 2, we also do some form of dynamic symmetry
       breaking during search. At level 3, we also detect symmetries for very
       large models, which can be slow. At level 4, we try to break as much
       symmetry as possible in presolve.
       
      optional int32 symmetry_level = 183 [default = 2];
      Parameters:
      value - The symmetryLevel to set.
      Returns:
      This builder for chaining.
    • clearSymmetryLevel

      public SatParameters.Builder clearSymmetryLevel()
       Whether we try to automatically detect the symmetries in a model and
       exploit them. Currently, at level 1 we detect them in presolve and try
       to fix Booleans. At level 2, we also do some form of dynamic symmetry
       breaking during search. At level 3, we also detect symmetries for very
       large models, which can be slow. At level 4, we try to break as much
       symmetry as possible in presolve.
       
      optional int32 symmetry_level = 183 [default = 2];
      Returns:
      This builder for chaining.
    • hasUseSymmetryInLp

      public boolean hasUseSymmetryInLp()
       When we have symmetry, it is possible to "fold" all variables from the same
       orbit into a single variable, while having the same power of LP relaxation.
       This can help significantly on symmetric problem. However there is
       currently a bit of overhead as the rest of the solver need to do some
       translation between the folded LP and the rest of the problem.
       
      optional bool use_symmetry_in_lp = 301 [default = false];
      Specified by:
      hasUseSymmetryInLp in interface SatParametersOrBuilder
      Returns:
      Whether the useSymmetryInLp field is set.
    • getUseSymmetryInLp

      public boolean getUseSymmetryInLp()
       When we have symmetry, it is possible to "fold" all variables from the same
       orbit into a single variable, while having the same power of LP relaxation.
       This can help significantly on symmetric problem. However there is
       currently a bit of overhead as the rest of the solver need to do some
       translation between the folded LP and the rest of the problem.
       
      optional bool use_symmetry_in_lp = 301 [default = false];
      Specified by:
      getUseSymmetryInLp in interface SatParametersOrBuilder
      Returns:
      The useSymmetryInLp.
    • setUseSymmetryInLp

      public SatParameters.Builder setUseSymmetryInLp(boolean value)
       When we have symmetry, it is possible to "fold" all variables from the same
       orbit into a single variable, while having the same power of LP relaxation.
       This can help significantly on symmetric problem. However there is
       currently a bit of overhead as the rest of the solver need to do some
       translation between the folded LP and the rest of the problem.
       
      optional bool use_symmetry_in_lp = 301 [default = false];
      Parameters:
      value - The useSymmetryInLp to set.
      Returns:
      This builder for chaining.
    • clearUseSymmetryInLp

      public SatParameters.Builder clearUseSymmetryInLp()
       When we have symmetry, it is possible to "fold" all variables from the same
       orbit into a single variable, while having the same power of LP relaxation.
       This can help significantly on symmetric problem. However there is
       currently a bit of overhead as the rest of the solver need to do some
       translation between the folded LP and the rest of the problem.
       
      optional bool use_symmetry_in_lp = 301 [default = false];
      Returns:
      This builder for chaining.
    • hasKeepSymmetryInPresolve

      public boolean hasKeepSymmetryInPresolve()
       Experimental. This will compute the symmetry of the problem once and for
       all. All presolve operations we do should keep the symmetry group intact
       or modify it properly. For now we have really little support for this. We
       will disable a bunch of presolve operations that could be supported.
       
      optional bool keep_symmetry_in_presolve = 303 [default = false];
      Specified by:
      hasKeepSymmetryInPresolve in interface SatParametersOrBuilder
      Returns:
      Whether the keepSymmetryInPresolve field is set.
    • getKeepSymmetryInPresolve

      public boolean getKeepSymmetryInPresolve()
       Experimental. This will compute the symmetry of the problem once and for
       all. All presolve operations we do should keep the symmetry group intact
       or modify it properly. For now we have really little support for this. We
       will disable a bunch of presolve operations that could be supported.
       
      optional bool keep_symmetry_in_presolve = 303 [default = false];
      Specified by:
      getKeepSymmetryInPresolve in interface SatParametersOrBuilder
      Returns:
      The keepSymmetryInPresolve.
    • setKeepSymmetryInPresolve

      public SatParameters.Builder setKeepSymmetryInPresolve(boolean value)
       Experimental. This will compute the symmetry of the problem once and for
       all. All presolve operations we do should keep the symmetry group intact
       or modify it properly. For now we have really little support for this. We
       will disable a bunch of presolve operations that could be supported.
       
      optional bool keep_symmetry_in_presolve = 303 [default = false];
      Parameters:
      value - The keepSymmetryInPresolve to set.
      Returns:
      This builder for chaining.
    • clearKeepSymmetryInPresolve

      public SatParameters.Builder clearKeepSymmetryInPresolve()
       Experimental. This will compute the symmetry of the problem once and for
       all. All presolve operations we do should keep the symmetry group intact
       or modify it properly. For now we have really little support for this. We
       will disable a bunch of presolve operations that could be supported.
       
      optional bool keep_symmetry_in_presolve = 303 [default = false];
      Returns:
      This builder for chaining.
    • hasSymmetryDetectionDeterministicTimeLimit

      public boolean hasSymmetryDetectionDeterministicTimeLimit()
       Deterministic time limit for symmetry detection.
       
      optional double symmetry_detection_deterministic_time_limit = 302 [default = 1];
      Specified by:
      hasSymmetryDetectionDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      Whether the symmetryDetectionDeterministicTimeLimit field is set.
    • getSymmetryDetectionDeterministicTimeLimit

      public double getSymmetryDetectionDeterministicTimeLimit()
       Deterministic time limit for symmetry detection.
       
      optional double symmetry_detection_deterministic_time_limit = 302 [default = 1];
      Specified by:
      getSymmetryDetectionDeterministicTimeLimit in interface SatParametersOrBuilder
      Returns:
      The symmetryDetectionDeterministicTimeLimit.
    • setSymmetryDetectionDeterministicTimeLimit

      public SatParameters.Builder setSymmetryDetectionDeterministicTimeLimit(double value)
       Deterministic time limit for symmetry detection.
       
      optional double symmetry_detection_deterministic_time_limit = 302 [default = 1];
      Parameters:
      value - The symmetryDetectionDeterministicTimeLimit to set.
      Returns:
      This builder for chaining.
    • clearSymmetryDetectionDeterministicTimeLimit

      public SatParameters.Builder clearSymmetryDetectionDeterministicTimeLimit()
       Deterministic time limit for symmetry detection.
       
      optional double symmetry_detection_deterministic_time_limit = 302 [default = 1];
      Returns:
      This builder for chaining.
    • hasNewLinearPropagation

      public boolean hasNewLinearPropagation()
       The new linear propagation code treat all constraints at once and use
       an adaptation of Bellman-Ford-Tarjan to propagate constraint in a smarter
       order and potentially detect propagation cycle earlier.
       
      optional bool new_linear_propagation = 224 [default = true];
      Specified by:
      hasNewLinearPropagation in interface SatParametersOrBuilder
      Returns:
      Whether the newLinearPropagation field is set.
    • getNewLinearPropagation

      public boolean getNewLinearPropagation()
       The new linear propagation code treat all constraints at once and use
       an adaptation of Bellman-Ford-Tarjan to propagate constraint in a smarter
       order and potentially detect propagation cycle earlier.
       
      optional bool new_linear_propagation = 224 [default = true];
      Specified by:
      getNewLinearPropagation in interface SatParametersOrBuilder
      Returns:
      The newLinearPropagation.
    • setNewLinearPropagation

      public SatParameters.Builder setNewLinearPropagation(boolean value)
       The new linear propagation code treat all constraints at once and use
       an adaptation of Bellman-Ford-Tarjan to propagate constraint in a smarter
       order and potentially detect propagation cycle earlier.
       
      optional bool new_linear_propagation = 224 [default = true];
      Parameters:
      value - The newLinearPropagation to set.
      Returns:
      This builder for chaining.
    • clearNewLinearPropagation

      public SatParameters.Builder clearNewLinearPropagation()
       The new linear propagation code treat all constraints at once and use
       an adaptation of Bellman-Ford-Tarjan to propagate constraint in a smarter
       order and potentially detect propagation cycle earlier.
       
      optional bool new_linear_propagation = 224 [default = true];
      Returns:
      This builder for chaining.
    • hasLinearSplitSize

      public boolean hasLinearSplitSize()
       Linear constraints that are not pseudo-Boolean and that are longer than
       this size will be split into sqrt(size) intermediate sums in order to have
       faster propation in the CP engine.
       
      optional int32 linear_split_size = 256 [default = 100];
      Specified by:
      hasLinearSplitSize in interface SatParametersOrBuilder
      Returns:
      Whether the linearSplitSize field is set.
    • getLinearSplitSize

      public int getLinearSplitSize()
       Linear constraints that are not pseudo-Boolean and that are longer than
       this size will be split into sqrt(size) intermediate sums in order to have
       faster propation in the CP engine.
       
      optional int32 linear_split_size = 256 [default = 100];
      Specified by:
      getLinearSplitSize in interface SatParametersOrBuilder
      Returns:
      The linearSplitSize.
    • setLinearSplitSize

      public SatParameters.Builder setLinearSplitSize(int value)
       Linear constraints that are not pseudo-Boolean and that are longer than
       this size will be split into sqrt(size) intermediate sums in order to have
       faster propation in the CP engine.
       
      optional int32 linear_split_size = 256 [default = 100];
      Parameters:
      value - The linearSplitSize to set.
      Returns:
      This builder for chaining.
    • clearLinearSplitSize

      public SatParameters.Builder clearLinearSplitSize()
       Linear constraints that are not pseudo-Boolean and that are longer than
       this size will be split into sqrt(size) intermediate sums in order to have
       faster propation in the CP engine.
       
      optional int32 linear_split_size = 256 [default = 100];
      Returns:
      This builder for chaining.
    • hasLinearizationLevel

      public boolean hasLinearizationLevel()
       A non-negative level indicating the type of constraints we consider in the
       LP relaxation. At level zero, no LP relaxation is used. At level 1, only
       the linear constraint and full encoding are added. At level 2, we also add
       all the Boolean constraints.
       
      optional int32 linearization_level = 90 [default = 1];
      Specified by:
      hasLinearizationLevel in interface SatParametersOrBuilder
      Returns:
      Whether the linearizationLevel field is set.
    • getLinearizationLevel

      public int getLinearizationLevel()
       A non-negative level indicating the type of constraints we consider in the
       LP relaxation. At level zero, no LP relaxation is used. At level 1, only
       the linear constraint and full encoding are added. At level 2, we also add
       all the Boolean constraints.
       
      optional int32 linearization_level = 90 [default = 1];
      Specified by:
      getLinearizationLevel in interface SatParametersOrBuilder
      Returns:
      The linearizationLevel.
    • setLinearizationLevel

      public SatParameters.Builder setLinearizationLevel(int value)
       A non-negative level indicating the type of constraints we consider in the
       LP relaxation. At level zero, no LP relaxation is used. At level 1, only
       the linear constraint and full encoding are added. At level 2, we also add
       all the Boolean constraints.
       
      optional int32 linearization_level = 90 [default = 1];
      Parameters:
      value - The linearizationLevel to set.
      Returns:
      This builder for chaining.
    • clearLinearizationLevel

      public SatParameters.Builder clearLinearizationLevel()
       A non-negative level indicating the type of constraints we consider in the
       LP relaxation. At level zero, no LP relaxation is used. At level 1, only
       the linear constraint and full encoding are added. At level 2, we also add
       all the Boolean constraints.
       
      optional int32 linearization_level = 90 [default = 1];
      Returns:
      This builder for chaining.
    • hasBooleanEncodingLevel

      public boolean hasBooleanEncodingLevel()
       A non-negative level indicating how much we should try to fully encode
       Integer variables as Boolean.
       
      optional int32 boolean_encoding_level = 107 [default = 1];
      Specified by:
      hasBooleanEncodingLevel in interface SatParametersOrBuilder
      Returns:
      Whether the booleanEncodingLevel field is set.
    • getBooleanEncodingLevel

      public int getBooleanEncodingLevel()
       A non-negative level indicating how much we should try to fully encode
       Integer variables as Boolean.
       
      optional int32 boolean_encoding_level = 107 [default = 1];
      Specified by:
      getBooleanEncodingLevel in interface SatParametersOrBuilder
      Returns:
      The booleanEncodingLevel.
    • setBooleanEncodingLevel

      public SatParameters.Builder setBooleanEncodingLevel(int value)
       A non-negative level indicating how much we should try to fully encode
       Integer variables as Boolean.
       
      optional int32 boolean_encoding_level = 107 [default = 1];
      Parameters:
      value - The booleanEncodingLevel to set.
      Returns:
      This builder for chaining.
    • clearBooleanEncodingLevel

      public SatParameters.Builder clearBooleanEncodingLevel()
       A non-negative level indicating how much we should try to fully encode
       Integer variables as Boolean.
       
      optional int32 boolean_encoding_level = 107 [default = 1];
      Returns:
      This builder for chaining.
    • hasMaxDomainSizeWhenEncodingEqNeqConstraints

      public boolean hasMaxDomainSizeWhenEncodingEqNeqConstraints()
       When loading a*x + b*y ==/!= c when x and y are both fully encoded.
       The solver may decide to replace the linear equation by a set of clauses.
       This is triggered if the sizes of the domains of x and y are below the
       threshold.
       
      optional int32 max_domain_size_when_encoding_eq_neq_constraints = 191 [default = 16];
      Specified by:
      hasMaxDomainSizeWhenEncodingEqNeqConstraints in interface SatParametersOrBuilder
      Returns:
      Whether the maxDomainSizeWhenEncodingEqNeqConstraints field is set.
    • getMaxDomainSizeWhenEncodingEqNeqConstraints

      public int getMaxDomainSizeWhenEncodingEqNeqConstraints()
       When loading a*x + b*y ==/!= c when x and y are both fully encoded.
       The solver may decide to replace the linear equation by a set of clauses.
       This is triggered if the sizes of the domains of x and y are below the
       threshold.
       
      optional int32 max_domain_size_when_encoding_eq_neq_constraints = 191 [default = 16];
      Specified by:
      getMaxDomainSizeWhenEncodingEqNeqConstraints in interface SatParametersOrBuilder
      Returns:
      The maxDomainSizeWhenEncodingEqNeqConstraints.
    • setMaxDomainSizeWhenEncodingEqNeqConstraints

      public SatParameters.Builder setMaxDomainSizeWhenEncodingEqNeqConstraints(int value)
       When loading a*x + b*y ==/!= c when x and y are both fully encoded.
       The solver may decide to replace the linear equation by a set of clauses.
       This is triggered if the sizes of the domains of x and y are below the
       threshold.
       
      optional int32 max_domain_size_when_encoding_eq_neq_constraints = 191 [default = 16];
      Parameters:
      value - The maxDomainSizeWhenEncodingEqNeqConstraints to set.
      Returns:
      This builder for chaining.
    • clearMaxDomainSizeWhenEncodingEqNeqConstraints

      public SatParameters.Builder clearMaxDomainSizeWhenEncodingEqNeqConstraints()
       When loading a*x + b*y ==/!= c when x and y are both fully encoded.
       The solver may decide to replace the linear equation by a set of clauses.
       This is triggered if the sizes of the domains of x and y are below the
       threshold.
       
      optional int32 max_domain_size_when_encoding_eq_neq_constraints = 191 [default = 16];
      Returns:
      This builder for chaining.
    • hasMaxNumCuts

      public boolean hasMaxNumCuts()
       The limit on the number of cuts in our cut pool. When this is reached we do
       not generate cuts anymore.
      
       TODO(user): We should probably remove this parameters, and just always
       generate cuts but only keep the best n or something.
       
      optional int32 max_num_cuts = 91 [default = 10000];
      Specified by:
      hasMaxNumCuts in interface SatParametersOrBuilder
      Returns:
      Whether the maxNumCuts field is set.
    • getMaxNumCuts

      public int getMaxNumCuts()
       The limit on the number of cuts in our cut pool. When this is reached we do
       not generate cuts anymore.
      
       TODO(user): We should probably remove this parameters, and just always
       generate cuts but only keep the best n or something.
       
      optional int32 max_num_cuts = 91 [default = 10000];
      Specified by:
      getMaxNumCuts in interface SatParametersOrBuilder
      Returns:
      The maxNumCuts.
    • setMaxNumCuts

      public SatParameters.Builder setMaxNumCuts(int value)
       The limit on the number of cuts in our cut pool. When this is reached we do
       not generate cuts anymore.
      
       TODO(user): We should probably remove this parameters, and just always
       generate cuts but only keep the best n or something.
       
      optional int32 max_num_cuts = 91 [default = 10000];
      Parameters:
      value - The maxNumCuts to set.
      Returns:
      This builder for chaining.
    • clearMaxNumCuts

      public SatParameters.Builder clearMaxNumCuts()
       The limit on the number of cuts in our cut pool. When this is reached we do
       not generate cuts anymore.
      
       TODO(user): We should probably remove this parameters, and just always
       generate cuts but only keep the best n or something.
       
      optional int32 max_num_cuts = 91 [default = 10000];
      Returns:
      This builder for chaining.
    • hasCutLevel

      public boolean hasCutLevel()
       Control the global cut effort. Zero will turn off all cut. For now we just
       have one level. Note also that most cuts are only used at linearization
       level >= 2.
       
      optional int32 cut_level = 196 [default = 1];
      Specified by:
      hasCutLevel in interface SatParametersOrBuilder
      Returns:
      Whether the cutLevel field is set.
    • getCutLevel

      public int getCutLevel()
       Control the global cut effort. Zero will turn off all cut. For now we just
       have one level. Note also that most cuts are only used at linearization
       level >= 2.
       
      optional int32 cut_level = 196 [default = 1];
      Specified by:
      getCutLevel in interface SatParametersOrBuilder
      Returns:
      The cutLevel.
    • setCutLevel

      public SatParameters.Builder setCutLevel(int value)
       Control the global cut effort. Zero will turn off all cut. For now we just
       have one level. Note also that most cuts are only used at linearization
       level >= 2.
       
      optional int32 cut_level = 196 [default = 1];
      Parameters:
      value - The cutLevel to set.
      Returns:
      This builder for chaining.
    • clearCutLevel

      public SatParameters.Builder clearCutLevel()
       Control the global cut effort. Zero will turn off all cut. For now we just
       have one level. Note also that most cuts are only used at linearization
       level >= 2.
       
      optional int32 cut_level = 196 [default = 1];
      Returns:
      This builder for chaining.
    • hasOnlyAddCutsAtLevelZero

      public boolean hasOnlyAddCutsAtLevelZero()
       For the cut that can be generated at any level, this control if we only
       try to generate them at the root node.
       
      optional bool only_add_cuts_at_level_zero = 92 [default = false];
      Specified by:
      hasOnlyAddCutsAtLevelZero in interface SatParametersOrBuilder
      Returns:
      Whether the onlyAddCutsAtLevelZero field is set.
    • getOnlyAddCutsAtLevelZero

      public boolean getOnlyAddCutsAtLevelZero()
       For the cut that can be generated at any level, this control if we only
       try to generate them at the root node.
       
      optional bool only_add_cuts_at_level_zero = 92 [default = false];
      Specified by:
      getOnlyAddCutsAtLevelZero in interface SatParametersOrBuilder
      Returns:
      The onlyAddCutsAtLevelZero.
    • setOnlyAddCutsAtLevelZero

      public SatParameters.Builder setOnlyAddCutsAtLevelZero(boolean value)
       For the cut that can be generated at any level, this control if we only
       try to generate them at the root node.
       
      optional bool only_add_cuts_at_level_zero = 92 [default = false];
      Parameters:
      value - The onlyAddCutsAtLevelZero to set.
      Returns:
      This builder for chaining.
    • clearOnlyAddCutsAtLevelZero

      public SatParameters.Builder clearOnlyAddCutsAtLevelZero()
       For the cut that can be generated at any level, this control if we only
       try to generate them at the root node.
       
      optional bool only_add_cuts_at_level_zero = 92 [default = false];
      Returns:
      This builder for chaining.
    • hasAddObjectiveCut

      public boolean hasAddObjectiveCut()
       When the LP objective is fractional, do we add the cut that forces the
       linear objective expression to be greater or equal to this fractional value
       rounded up? We can always do that since our objective is integer, and
       combined with MIR heuristic to reduce the coefficient of such cut, it can
       help.
       
      optional bool add_objective_cut = 197 [default = false];
      Specified by:
      hasAddObjectiveCut in interface SatParametersOrBuilder
      Returns:
      Whether the addObjectiveCut field is set.
    • getAddObjectiveCut

      public boolean getAddObjectiveCut()
       When the LP objective is fractional, do we add the cut that forces the
       linear objective expression to be greater or equal to this fractional value
       rounded up? We can always do that since our objective is integer, and
       combined with MIR heuristic to reduce the coefficient of such cut, it can
       help.
       
      optional bool add_objective_cut = 197 [default = false];
      Specified by:
      getAddObjectiveCut in interface SatParametersOrBuilder
      Returns:
      The addObjectiveCut.
    • setAddObjectiveCut

      public SatParameters.Builder setAddObjectiveCut(boolean value)
       When the LP objective is fractional, do we add the cut that forces the
       linear objective expression to be greater or equal to this fractional value
       rounded up? We can always do that since our objective is integer, and
       combined with MIR heuristic to reduce the coefficient of such cut, it can
       help.
       
      optional bool add_objective_cut = 197 [default = false];
      Parameters:
      value - The addObjectiveCut to set.
      Returns:
      This builder for chaining.
    • clearAddObjectiveCut

      public SatParameters.Builder clearAddObjectiveCut()
       When the LP objective is fractional, do we add the cut that forces the
       linear objective expression to be greater or equal to this fractional value
       rounded up? We can always do that since our objective is integer, and
       combined with MIR heuristic to reduce the coefficient of such cut, it can
       help.
       
      optional bool add_objective_cut = 197 [default = false];
      Returns:
      This builder for chaining.
    • hasAddCgCuts

      public boolean hasAddCgCuts()
       Whether we generate and add Chvatal-Gomory cuts to the LP at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_cg_cuts = 117 [default = true];
      Specified by:
      hasAddCgCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addCgCuts field is set.
    • getAddCgCuts

      public boolean getAddCgCuts()
       Whether we generate and add Chvatal-Gomory cuts to the LP at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_cg_cuts = 117 [default = true];
      Specified by:
      getAddCgCuts in interface SatParametersOrBuilder
      Returns:
      The addCgCuts.
    • setAddCgCuts

      public SatParameters.Builder setAddCgCuts(boolean value)
       Whether we generate and add Chvatal-Gomory cuts to the LP at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_cg_cuts = 117 [default = true];
      Parameters:
      value - The addCgCuts to set.
      Returns:
      This builder for chaining.
    • clearAddCgCuts

      public SatParameters.Builder clearAddCgCuts()
       Whether we generate and add Chvatal-Gomory cuts to the LP at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_cg_cuts = 117 [default = true];
      Returns:
      This builder for chaining.
    • hasAddMirCuts

      public boolean hasAddMirCuts()
       Whether we generate MIR cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_mir_cuts = 120 [default = true];
      Specified by:
      hasAddMirCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addMirCuts field is set.
    • getAddMirCuts

      public boolean getAddMirCuts()
       Whether we generate MIR cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_mir_cuts = 120 [default = true];
      Specified by:
      getAddMirCuts in interface SatParametersOrBuilder
      Returns:
      The addMirCuts.
    • setAddMirCuts

      public SatParameters.Builder setAddMirCuts(boolean value)
       Whether we generate MIR cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_mir_cuts = 120 [default = true];
      Parameters:
      value - The addMirCuts to set.
      Returns:
      This builder for chaining.
    • clearAddMirCuts

      public SatParameters.Builder clearAddMirCuts()
       Whether we generate MIR cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_mir_cuts = 120 [default = true];
      Returns:
      This builder for chaining.
    • hasAddZeroHalfCuts

      public boolean hasAddZeroHalfCuts()
       Whether we generate Zero-Half cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_zero_half_cuts = 169 [default = true];
      Specified by:
      hasAddZeroHalfCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addZeroHalfCuts field is set.
    • getAddZeroHalfCuts

      public boolean getAddZeroHalfCuts()
       Whether we generate Zero-Half cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_zero_half_cuts = 169 [default = true];
      Specified by:
      getAddZeroHalfCuts in interface SatParametersOrBuilder
      Returns:
      The addZeroHalfCuts.
    • setAddZeroHalfCuts

      public SatParameters.Builder setAddZeroHalfCuts(boolean value)
       Whether we generate Zero-Half cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_zero_half_cuts = 169 [default = true];
      Parameters:
      value - The addZeroHalfCuts to set.
      Returns:
      This builder for chaining.
    • clearAddZeroHalfCuts

      public SatParameters.Builder clearAddZeroHalfCuts()
       Whether we generate Zero-Half cuts at root node.
       Note that for now, this is not heavily tuned.
       
      optional bool add_zero_half_cuts = 169 [default = true];
      Returns:
      This builder for chaining.
    • hasAddCliqueCuts

      public boolean hasAddCliqueCuts()
       Whether we generate clique cuts from the binary implication graph. Note
       that as the search goes on, this graph will contains new binary clauses
       learned by the SAT engine.
       
      optional bool add_clique_cuts = 172 [default = true];
      Specified by:
      hasAddCliqueCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addCliqueCuts field is set.
    • getAddCliqueCuts

      public boolean getAddCliqueCuts()
       Whether we generate clique cuts from the binary implication graph. Note
       that as the search goes on, this graph will contains new binary clauses
       learned by the SAT engine.
       
      optional bool add_clique_cuts = 172 [default = true];
      Specified by:
      getAddCliqueCuts in interface SatParametersOrBuilder
      Returns:
      The addCliqueCuts.
    • setAddCliqueCuts

      public SatParameters.Builder setAddCliqueCuts(boolean value)
       Whether we generate clique cuts from the binary implication graph. Note
       that as the search goes on, this graph will contains new binary clauses
       learned by the SAT engine.
       
      optional bool add_clique_cuts = 172 [default = true];
      Parameters:
      value - The addCliqueCuts to set.
      Returns:
      This builder for chaining.
    • clearAddCliqueCuts

      public SatParameters.Builder clearAddCliqueCuts()
       Whether we generate clique cuts from the binary implication graph. Note
       that as the search goes on, this graph will contains new binary clauses
       learned by the SAT engine.
       
      optional bool add_clique_cuts = 172 [default = true];
      Returns:
      This builder for chaining.
    • hasAddRltCuts

      public boolean hasAddRltCuts()
       Whether we generate RLT cuts. This is still experimental but can help on
       binary problem with a lot of clauses of size 3.
       
      optional bool add_rlt_cuts = 279 [default = true];
      Specified by:
      hasAddRltCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addRltCuts field is set.
    • getAddRltCuts

      public boolean getAddRltCuts()
       Whether we generate RLT cuts. This is still experimental but can help on
       binary problem with a lot of clauses of size 3.
       
      optional bool add_rlt_cuts = 279 [default = true];
      Specified by:
      getAddRltCuts in interface SatParametersOrBuilder
      Returns:
      The addRltCuts.
    • setAddRltCuts

      public SatParameters.Builder setAddRltCuts(boolean value)
       Whether we generate RLT cuts. This is still experimental but can help on
       binary problem with a lot of clauses of size 3.
       
      optional bool add_rlt_cuts = 279 [default = true];
      Parameters:
      value - The addRltCuts to set.
      Returns:
      This builder for chaining.
    • clearAddRltCuts

      public SatParameters.Builder clearAddRltCuts()
       Whether we generate RLT cuts. This is still experimental but can help on
       binary problem with a lot of clauses of size 3.
       
      optional bool add_rlt_cuts = 279 [default = true];
      Returns:
      This builder for chaining.
    • hasMaxAllDiffCutSize

      public boolean hasMaxAllDiffCutSize()
       Cut generator for all diffs can add too many cuts for large all_diff
       constraints. This parameter restricts the large all_diff constraints to
       have a cut generator.
       
      optional int32 max_all_diff_cut_size = 148 [default = 64];
      Specified by:
      hasMaxAllDiffCutSize in interface SatParametersOrBuilder
      Returns:
      Whether the maxAllDiffCutSize field is set.
    • getMaxAllDiffCutSize

      public int getMaxAllDiffCutSize()
       Cut generator for all diffs can add too many cuts for large all_diff
       constraints. This parameter restricts the large all_diff constraints to
       have a cut generator.
       
      optional int32 max_all_diff_cut_size = 148 [default = 64];
      Specified by:
      getMaxAllDiffCutSize in interface SatParametersOrBuilder
      Returns:
      The maxAllDiffCutSize.
    • setMaxAllDiffCutSize

      public SatParameters.Builder setMaxAllDiffCutSize(int value)
       Cut generator for all diffs can add too many cuts for large all_diff
       constraints. This parameter restricts the large all_diff constraints to
       have a cut generator.
       
      optional int32 max_all_diff_cut_size = 148 [default = 64];
      Parameters:
      value - The maxAllDiffCutSize to set.
      Returns:
      This builder for chaining.
    • clearMaxAllDiffCutSize

      public SatParameters.Builder clearMaxAllDiffCutSize()
       Cut generator for all diffs can add too many cuts for large all_diff
       constraints. This parameter restricts the large all_diff constraints to
       have a cut generator.
       
      optional int32 max_all_diff_cut_size = 148 [default = 64];
      Returns:
      This builder for chaining.
    • hasAddLinMaxCuts

      public boolean hasAddLinMaxCuts()
       For the lin max constraints, generates the cuts described in "Strong
       mixed-integer programming formulations for trained neural networks" by Ross
       Anderson et. (https://arxiv.org/pdf/1811.01988.pdf)
       
      optional bool add_lin_max_cuts = 152 [default = true];
      Specified by:
      hasAddLinMaxCuts in interface SatParametersOrBuilder
      Returns:
      Whether the addLinMaxCuts field is set.
    • getAddLinMaxCuts

      public boolean getAddLinMaxCuts()
       For the lin max constraints, generates the cuts described in "Strong
       mixed-integer programming formulations for trained neural networks" by Ross
       Anderson et. (https://arxiv.org/pdf/1811.01988.pdf)
       
      optional bool add_lin_max_cuts = 152 [default = true];
      Specified by:
      getAddLinMaxCuts in interface SatParametersOrBuilder
      Returns:
      The addLinMaxCuts.
    • setAddLinMaxCuts

      public SatParameters.Builder setAddLinMaxCuts(boolean value)
       For the lin max constraints, generates the cuts described in "Strong
       mixed-integer programming formulations for trained neural networks" by Ross
       Anderson et. (https://arxiv.org/pdf/1811.01988.pdf)
       
      optional bool add_lin_max_cuts = 152 [default = true];
      Parameters:
      value - The addLinMaxCuts to set.
      Returns:
      This builder for chaining.
    • clearAddLinMaxCuts

      public SatParameters.Builder clearAddLinMaxCuts()
       For the lin max constraints, generates the cuts described in "Strong
       mixed-integer programming formulations for trained neural networks" by Ross
       Anderson et. (https://arxiv.org/pdf/1811.01988.pdf)
       
      optional bool add_lin_max_cuts = 152 [default = true];
      Returns:
      This builder for chaining.
    • hasMaxIntegerRoundingScaling

      public boolean hasMaxIntegerRoundingScaling()
       In the integer rounding procedure used for MIR and Gomory cut, the maximum
       "scaling" we use (must be positive). The lower this is, the lower the
       integer coefficients of the cut will be. Note that cut generated by lower
       values are not necessarily worse than cut generated by larger value. There
       is no strict dominance relationship.
      
       Setting this to 2 result in the "strong fractional rouding" of Letchford
       and Lodi.
       
      optional int32 max_integer_rounding_scaling = 119 [default = 600];
      Specified by:
      hasMaxIntegerRoundingScaling in interface SatParametersOrBuilder
      Returns:
      Whether the maxIntegerRoundingScaling field is set.
    • getMaxIntegerRoundingScaling

      public int getMaxIntegerRoundingScaling()
       In the integer rounding procedure used for MIR and Gomory cut, the maximum
       "scaling" we use (must be positive). The lower this is, the lower the
       integer coefficients of the cut will be. Note that cut generated by lower
       values are not necessarily worse than cut generated by larger value. There
       is no strict dominance relationship.
      
       Setting this to 2 result in the "strong fractional rouding" of Letchford
       and Lodi.
       
      optional int32 max_integer_rounding_scaling = 119 [default = 600];
      Specified by:
      getMaxIntegerRoundingScaling in interface SatParametersOrBuilder
      Returns:
      The maxIntegerRoundingScaling.
    • setMaxIntegerRoundingScaling

      public SatParameters.Builder setMaxIntegerRoundingScaling(int value)
       In the integer rounding procedure used for MIR and Gomory cut, the maximum
       "scaling" we use (must be positive). The lower this is, the lower the
       integer coefficients of the cut will be. Note that cut generated by lower
       values are not necessarily worse than cut generated by larger value. There
       is no strict dominance relationship.
      
       Setting this to 2 result in the "strong fractional rouding" of Letchford
       and Lodi.
       
      optional int32 max_integer_rounding_scaling = 119 [default = 600];
      Parameters:
      value - The maxIntegerRoundingScaling to set.
      Returns:
      This builder for chaining.
    • clearMaxIntegerRoundingScaling

      public SatParameters.Builder clearMaxIntegerRoundingScaling()
       In the integer rounding procedure used for MIR and Gomory cut, the maximum
       "scaling" we use (must be positive). The lower this is, the lower the
       integer coefficients of the cut will be. Note that cut generated by lower
       values are not necessarily worse than cut generated by larger value. There
       is no strict dominance relationship.
      
       Setting this to 2 result in the "strong fractional rouding" of Letchford
       and Lodi.
       
      optional int32 max_integer_rounding_scaling = 119 [default = 600];
      Returns:
      This builder for chaining.
    • hasAddLpConstraintsLazily

      public boolean hasAddLpConstraintsLazily()
       If true, we start by an empty LP, and only add constraints not satisfied
       by the current LP solution batch by batch. A constraint that is only added
       like this is known as a "lazy" constraint in the literature, except that we
       currently consider all constraints as lazy here.
       
      optional bool add_lp_constraints_lazily = 112 [default = true];
      Specified by:
      hasAddLpConstraintsLazily in interface SatParametersOrBuilder
      Returns:
      Whether the addLpConstraintsLazily field is set.
    • getAddLpConstraintsLazily

      public boolean getAddLpConstraintsLazily()
       If true, we start by an empty LP, and only add constraints not satisfied
       by the current LP solution batch by batch. A constraint that is only added
       like this is known as a "lazy" constraint in the literature, except that we
       currently consider all constraints as lazy here.
       
      optional bool add_lp_constraints_lazily = 112 [default = true];
      Specified by:
      getAddLpConstraintsLazily in interface SatParametersOrBuilder
      Returns:
      The addLpConstraintsLazily.
    • setAddLpConstraintsLazily

      public SatParameters.Builder setAddLpConstraintsLazily(boolean value)
       If true, we start by an empty LP, and only add constraints not satisfied
       by the current LP solution batch by batch. A constraint that is only added
       like this is known as a "lazy" constraint in the literature, except that we
       currently consider all constraints as lazy here.
       
      optional bool add_lp_constraints_lazily = 112 [default = true];
      Parameters:
      value - The addLpConstraintsLazily to set.
      Returns:
      This builder for chaining.
    • clearAddLpConstraintsLazily

      public SatParameters.Builder clearAddLpConstraintsLazily()
       If true, we start by an empty LP, and only add constraints not satisfied
       by the current LP solution batch by batch. A constraint that is only added
       like this is known as a "lazy" constraint in the literature, except that we
       currently consider all constraints as lazy here.
       
      optional bool add_lp_constraints_lazily = 112 [default = true];
      Returns:
      This builder for chaining.
    • hasRootLpIterations

      public boolean hasRootLpIterations()
       Even at the root node, we do not want to spend too much time on the LP if
       it is "difficult". So we solve it in "chunks" of that many iterations. The
       solve will be continued down in the tree or the next time we go back to the
       root node.
       
      optional int32 root_lp_iterations = 227 [default = 2000];
      Specified by:
      hasRootLpIterations in interface SatParametersOrBuilder
      Returns:
      Whether the rootLpIterations field is set.
    • getRootLpIterations

      public int getRootLpIterations()
       Even at the root node, we do not want to spend too much time on the LP if
       it is "difficult". So we solve it in "chunks" of that many iterations. The
       solve will be continued down in the tree or the next time we go back to the
       root node.
       
      optional int32 root_lp_iterations = 227 [default = 2000];
      Specified by:
      getRootLpIterations in interface SatParametersOrBuilder
      Returns:
      The rootLpIterations.
    • setRootLpIterations

      public SatParameters.Builder setRootLpIterations(int value)
       Even at the root node, we do not want to spend too much time on the LP if
       it is "difficult". So we solve it in "chunks" of that many iterations. The
       solve will be continued down in the tree or the next time we go back to the
       root node.
       
      optional int32 root_lp_iterations = 227 [default = 2000];
      Parameters:
      value - The rootLpIterations to set.
      Returns:
      This builder for chaining.
    • clearRootLpIterations

      public SatParameters.Builder clearRootLpIterations()
       Even at the root node, we do not want to spend too much time on the LP if
       it is "difficult". So we solve it in "chunks" of that many iterations. The
       solve will be continued down in the tree or the next time we go back to the
       root node.
       
      optional int32 root_lp_iterations = 227 [default = 2000];
      Returns:
      This builder for chaining.
    • hasMinOrthogonalityForLpConstraints

      public boolean hasMinOrthogonalityForLpConstraints()
       While adding constraints, skip the constraints which have orthogonality
       less than 'min_orthogonality_for_lp_constraints' with already added
       constraints during current call. Orthogonality is defined as 1 -
       cosine(vector angle between constraints). A value of zero disable this
       feature.
       
      optional double min_orthogonality_for_lp_constraints = 115 [default = 0.05];
      Specified by:
      hasMinOrthogonalityForLpConstraints in interface SatParametersOrBuilder
      Returns:
      Whether the minOrthogonalityForLpConstraints field is set.
    • getMinOrthogonalityForLpConstraints

      public double getMinOrthogonalityForLpConstraints()
       While adding constraints, skip the constraints which have orthogonality
       less than 'min_orthogonality_for_lp_constraints' with already added
       constraints during current call. Orthogonality is defined as 1 -
       cosine(vector angle between constraints). A value of zero disable this
       feature.
       
      optional double min_orthogonality_for_lp_constraints = 115 [default = 0.05];
      Specified by:
      getMinOrthogonalityForLpConstraints in interface SatParametersOrBuilder
      Returns:
      The minOrthogonalityForLpConstraints.
    • setMinOrthogonalityForLpConstraints

      public SatParameters.Builder setMinOrthogonalityForLpConstraints(double value)
       While adding constraints, skip the constraints which have orthogonality
       less than 'min_orthogonality_for_lp_constraints' with already added
       constraints during current call. Orthogonality is defined as 1 -
       cosine(vector angle between constraints). A value of zero disable this
       feature.
       
      optional double min_orthogonality_for_lp_constraints = 115 [default = 0.05];
      Parameters:
      value - The minOrthogonalityForLpConstraints to set.
      Returns:
      This builder for chaining.
    • clearMinOrthogonalityForLpConstraints

      public SatParameters.Builder clearMinOrthogonalityForLpConstraints()
       While adding constraints, skip the constraints which have orthogonality
       less than 'min_orthogonality_for_lp_constraints' with already added
       constraints during current call. Orthogonality is defined as 1 -
       cosine(vector angle between constraints). A value of zero disable this
       feature.
       
      optional double min_orthogonality_for_lp_constraints = 115 [default = 0.05];
      Returns:
      This builder for chaining.
    • hasMaxCutRoundsAtLevelZero

      public boolean hasMaxCutRoundsAtLevelZero()
       Max number of time we perform cut generation and resolve the LP at level 0.
       
      optional int32 max_cut_rounds_at_level_zero = 154 [default = 1];
      Specified by:
      hasMaxCutRoundsAtLevelZero in interface SatParametersOrBuilder
      Returns:
      Whether the maxCutRoundsAtLevelZero field is set.
    • getMaxCutRoundsAtLevelZero

      public int getMaxCutRoundsAtLevelZero()
       Max number of time we perform cut generation and resolve the LP at level 0.
       
      optional int32 max_cut_rounds_at_level_zero = 154 [default = 1];
      Specified by:
      getMaxCutRoundsAtLevelZero in interface SatParametersOrBuilder
      Returns:
      The maxCutRoundsAtLevelZero.
    • setMaxCutRoundsAtLevelZero

      public SatParameters.Builder setMaxCutRoundsAtLevelZero(int value)
       Max number of time we perform cut generation and resolve the LP at level 0.
       
      optional int32 max_cut_rounds_at_level_zero = 154 [default = 1];
      Parameters:
      value - The maxCutRoundsAtLevelZero to set.
      Returns:
      This builder for chaining.
    • clearMaxCutRoundsAtLevelZero

      public SatParameters.Builder clearMaxCutRoundsAtLevelZero()
       Max number of time we perform cut generation and resolve the LP at level 0.
       
      optional int32 max_cut_rounds_at_level_zero = 154 [default = 1];
      Returns:
      This builder for chaining.
    • hasMaxConsecutiveInactiveCount

      public boolean hasMaxConsecutiveInactiveCount()
       If a constraint/cut in LP is not active for that many consecutive OPTIMAL
       solves, remove it from the LP. Note that it might be added again later if
       it become violated by the current LP solution.
       
      optional int32 max_consecutive_inactive_count = 121 [default = 100];
      Specified by:
      hasMaxConsecutiveInactiveCount in interface SatParametersOrBuilder
      Returns:
      Whether the maxConsecutiveInactiveCount field is set.
    • getMaxConsecutiveInactiveCount

      public int getMaxConsecutiveInactiveCount()
       If a constraint/cut in LP is not active for that many consecutive OPTIMAL
       solves, remove it from the LP. Note that it might be added again later if
       it become violated by the current LP solution.
       
      optional int32 max_consecutive_inactive_count = 121 [default = 100];
      Specified by:
      getMaxConsecutiveInactiveCount in interface SatParametersOrBuilder
      Returns:
      The maxConsecutiveInactiveCount.
    • setMaxConsecutiveInactiveCount

      public SatParameters.Builder setMaxConsecutiveInactiveCount(int value)
       If a constraint/cut in LP is not active for that many consecutive OPTIMAL
       solves, remove it from the LP. Note that it might be added again later if
       it become violated by the current LP solution.
       
      optional int32 max_consecutive_inactive_count = 121 [default = 100];
      Parameters:
      value - The maxConsecutiveInactiveCount to set.
      Returns:
      This builder for chaining.
    • clearMaxConsecutiveInactiveCount

      public SatParameters.Builder clearMaxConsecutiveInactiveCount()
       If a constraint/cut in LP is not active for that many consecutive OPTIMAL
       solves, remove it from the LP. Note that it might be added again later if
       it become violated by the current LP solution.
       
      optional int32 max_consecutive_inactive_count = 121 [default = 100];
      Returns:
      This builder for chaining.
    • hasCutMaxActiveCountValue

      public boolean hasCutMaxActiveCountValue()
       These parameters are similar to sat clause management activity parameters.
       They are effective only if the number of generated cuts exceed the storage
       limit. Default values are based on a few experiments on miplib instances.
       
      optional double cut_max_active_count_value = 155 [default = 10000000000];
      Specified by:
      hasCutMaxActiveCountValue in interface SatParametersOrBuilder
      Returns:
      Whether the cutMaxActiveCountValue field is set.
    • getCutMaxActiveCountValue

      public double getCutMaxActiveCountValue()
       These parameters are similar to sat clause management activity parameters.
       They are effective only if the number of generated cuts exceed the storage
       limit. Default values are based on a few experiments on miplib instances.
       
      optional double cut_max_active_count_value = 155 [default = 10000000000];
      Specified by:
      getCutMaxActiveCountValue in interface SatParametersOrBuilder
      Returns:
      The cutMaxActiveCountValue.
    • setCutMaxActiveCountValue

      public SatParameters.Builder setCutMaxActiveCountValue(double value)
       These parameters are similar to sat clause management activity parameters.
       They are effective only if the number of generated cuts exceed the storage
       limit. Default values are based on a few experiments on miplib instances.
       
      optional double cut_max_active_count_value = 155 [default = 10000000000];
      Parameters:
      value - The cutMaxActiveCountValue to set.
      Returns:
      This builder for chaining.
    • clearCutMaxActiveCountValue

      public SatParameters.Builder clearCutMaxActiveCountValue()
       These parameters are similar to sat clause management activity parameters.
       They are effective only if the number of generated cuts exceed the storage
       limit. Default values are based on a few experiments on miplib instances.
       
      optional double cut_max_active_count_value = 155 [default = 10000000000];
      Returns:
      This builder for chaining.
    • hasCutActiveCountDecay

      public boolean hasCutActiveCountDecay()
      optional double cut_active_count_decay = 156 [default = 0.8];
      Specified by:
      hasCutActiveCountDecay in interface SatParametersOrBuilder
      Returns:
      Whether the cutActiveCountDecay field is set.
    • getCutActiveCountDecay

      public double getCutActiveCountDecay()
      optional double cut_active_count_decay = 156 [default = 0.8];
      Specified by:
      getCutActiveCountDecay in interface SatParametersOrBuilder
      Returns:
      The cutActiveCountDecay.
    • setCutActiveCountDecay

      public SatParameters.Builder setCutActiveCountDecay(double value)
      optional double cut_active_count_decay = 156 [default = 0.8];
      Parameters:
      value - The cutActiveCountDecay to set.
      Returns:
      This builder for chaining.
    • clearCutActiveCountDecay

      public SatParameters.Builder clearCutActiveCountDecay()
      optional double cut_active_count_decay = 156 [default = 0.8];
      Returns:
      This builder for chaining.
    • hasCutCleanupTarget

      public boolean hasCutCleanupTarget()
       Target number of constraints to remove during cleanup.
       
      optional int32 cut_cleanup_target = 157 [default = 1000];
      Specified by:
      hasCutCleanupTarget in interface SatParametersOrBuilder
      Returns:
      Whether the cutCleanupTarget field is set.
    • getCutCleanupTarget

      public int getCutCleanupTarget()
       Target number of constraints to remove during cleanup.
       
      optional int32 cut_cleanup_target = 157 [default = 1000];
      Specified by:
      getCutCleanupTarget in interface SatParametersOrBuilder
      Returns:
      The cutCleanupTarget.
    • setCutCleanupTarget

      public SatParameters.Builder setCutCleanupTarget(int value)
       Target number of constraints to remove during cleanup.
       
      optional int32 cut_cleanup_target = 157 [default = 1000];
      Parameters:
      value - The cutCleanupTarget to set.
      Returns:
      This builder for chaining.
    • clearCutCleanupTarget

      public SatParameters.Builder clearCutCleanupTarget()
       Target number of constraints to remove during cleanup.
       
      optional int32 cut_cleanup_target = 157 [default = 1000];
      Returns:
      This builder for chaining.
    • hasNewConstraintsBatchSize

      public boolean hasNewConstraintsBatchSize()
       Add that many lazy constraints (or cuts) at once in the LP. Note that at
       the beginning of the solve, we do add more than this.
       
      optional int32 new_constraints_batch_size = 122 [default = 50];
      Specified by:
      hasNewConstraintsBatchSize in interface SatParametersOrBuilder
      Returns:
      Whether the newConstraintsBatchSize field is set.
    • getNewConstraintsBatchSize

      public int getNewConstraintsBatchSize()
       Add that many lazy constraints (or cuts) at once in the LP. Note that at
       the beginning of the solve, we do add more than this.
       
      optional int32 new_constraints_batch_size = 122 [default = 50];
      Specified by:
      getNewConstraintsBatchSize in interface SatParametersOrBuilder
      Returns:
      The newConstraintsBatchSize.
    • setNewConstraintsBatchSize

      public SatParameters.Builder setNewConstraintsBatchSize(int value)
       Add that many lazy constraints (or cuts) at once in the LP. Note that at
       the beginning of the solve, we do add more than this.
       
      optional int32 new_constraints_batch_size = 122 [default = 50];
      Parameters:
      value - The newConstraintsBatchSize to set.
      Returns:
      This builder for chaining.
    • clearNewConstraintsBatchSize

      public SatParameters.Builder clearNewConstraintsBatchSize()
       Add that many lazy constraints (or cuts) at once in the LP. Note that at
       the beginning of the solve, we do add more than this.
       
      optional int32 new_constraints_batch_size = 122 [default = 50];
      Returns:
      This builder for chaining.
    • hasExploitIntegerLpSolution

      public boolean hasExploitIntegerLpSolution()
       If true and the Lp relaxation of the problem has an integer optimal
       solution, try to exploit it. Note that since the LP relaxation may not
       contain all the constraints, such a solution is not necessarily a solution
       of the full problem.
       
      optional bool exploit_integer_lp_solution = 94 [default = true];
      Specified by:
      hasExploitIntegerLpSolution in interface SatParametersOrBuilder
      Returns:
      Whether the exploitIntegerLpSolution field is set.
    • getExploitIntegerLpSolution

      public boolean getExploitIntegerLpSolution()
       If true and the Lp relaxation of the problem has an integer optimal
       solution, try to exploit it. Note that since the LP relaxation may not
       contain all the constraints, such a solution is not necessarily a solution
       of the full problem.
       
      optional bool exploit_integer_lp_solution = 94 [default = true];
      Specified by:
      getExploitIntegerLpSolution in interface SatParametersOrBuilder
      Returns:
      The exploitIntegerLpSolution.
    • setExploitIntegerLpSolution

      public SatParameters.Builder setExploitIntegerLpSolution(boolean value)
       If true and the Lp relaxation of the problem has an integer optimal
       solution, try to exploit it. Note that since the LP relaxation may not
       contain all the constraints, such a solution is not necessarily a solution
       of the full problem.
       
      optional bool exploit_integer_lp_solution = 94 [default = true];
      Parameters:
      value - The exploitIntegerLpSolution to set.
      Returns:
      This builder for chaining.
    • clearExploitIntegerLpSolution

      public SatParameters.Builder clearExploitIntegerLpSolution()
       If true and the Lp relaxation of the problem has an integer optimal
       solution, try to exploit it. Note that since the LP relaxation may not
       contain all the constraints, such a solution is not necessarily a solution
       of the full problem.
       
      optional bool exploit_integer_lp_solution = 94 [default = true];
      Returns:
      This builder for chaining.
    • hasExploitAllLpSolution

      public boolean hasExploitAllLpSolution()
       If true and the Lp relaxation of the problem has a solution, try to exploit
       it. This is same as above except in this case the lp solution might not be
       an integer solution.
       
      optional bool exploit_all_lp_solution = 116 [default = true];
      Specified by:
      hasExploitAllLpSolution in interface SatParametersOrBuilder
      Returns:
      Whether the exploitAllLpSolution field is set.
    • getExploitAllLpSolution

      public boolean getExploitAllLpSolution()
       If true and the Lp relaxation of the problem has a solution, try to exploit
       it. This is same as above except in this case the lp solution might not be
       an integer solution.
       
      optional bool exploit_all_lp_solution = 116 [default = true];
      Specified by:
      getExploitAllLpSolution in interface SatParametersOrBuilder
      Returns:
      The exploitAllLpSolution.
    • setExploitAllLpSolution

      public SatParameters.Builder setExploitAllLpSolution(boolean value)
       If true and the Lp relaxation of the problem has a solution, try to exploit
       it. This is same as above except in this case the lp solution might not be
       an integer solution.
       
      optional bool exploit_all_lp_solution = 116 [default = true];
      Parameters:
      value - The exploitAllLpSolution to set.
      Returns:
      This builder for chaining.
    • clearExploitAllLpSolution

      public SatParameters.Builder clearExploitAllLpSolution()
       If true and the Lp relaxation of the problem has a solution, try to exploit
       it. This is same as above except in this case the lp solution might not be
       an integer solution.
       
      optional bool exploit_all_lp_solution = 116 [default = true];
      Returns:
      This builder for chaining.
    • hasExploitBestSolution

      public boolean hasExploitBestSolution()
       When branching on a variable, follow the last best solution value.
       
      optional bool exploit_best_solution = 130 [default = false];
      Specified by:
      hasExploitBestSolution in interface SatParametersOrBuilder
      Returns:
      Whether the exploitBestSolution field is set.
    • getExploitBestSolution

      public boolean getExploitBestSolution()
       When branching on a variable, follow the last best solution value.
       
      optional bool exploit_best_solution = 130 [default = false];
      Specified by:
      getExploitBestSolution in interface SatParametersOrBuilder
      Returns:
      The exploitBestSolution.
    • setExploitBestSolution

      public SatParameters.Builder setExploitBestSolution(boolean value)
       When branching on a variable, follow the last best solution value.
       
      optional bool exploit_best_solution = 130 [default = false];
      Parameters:
      value - The exploitBestSolution to set.
      Returns:
      This builder for chaining.
    • clearExploitBestSolution

      public SatParameters.Builder clearExploitBestSolution()
       When branching on a variable, follow the last best solution value.
       
      optional bool exploit_best_solution = 130 [default = false];
      Returns:
      This builder for chaining.
    • hasExploitRelaxationSolution

      public boolean hasExploitRelaxationSolution()
       When branching on a variable, follow the last best relaxation solution
       value. We use the relaxation with the tightest bound on the objective as
       the best relaxation solution.
       
      optional bool exploit_relaxation_solution = 161 [default = false];
      Specified by:
      hasExploitRelaxationSolution in interface SatParametersOrBuilder
      Returns:
      Whether the exploitRelaxationSolution field is set.
    • getExploitRelaxationSolution

      public boolean getExploitRelaxationSolution()
       When branching on a variable, follow the last best relaxation solution
       value. We use the relaxation with the tightest bound on the objective as
       the best relaxation solution.
       
      optional bool exploit_relaxation_solution = 161 [default = false];
      Specified by:
      getExploitRelaxationSolution in interface SatParametersOrBuilder
      Returns:
      The exploitRelaxationSolution.
    • setExploitRelaxationSolution

      public SatParameters.Builder setExploitRelaxationSolution(boolean value)
       When branching on a variable, follow the last best relaxation solution
       value. We use the relaxation with the tightest bound on the objective as
       the best relaxation solution.
       
      optional bool exploit_relaxation_solution = 161 [default = false];
      Parameters:
      value - The exploitRelaxationSolution to set.
      Returns:
      This builder for chaining.
    • clearExploitRelaxationSolution

      public SatParameters.Builder clearExploitRelaxationSolution()
       When branching on a variable, follow the last best relaxation solution
       value. We use the relaxation with the tightest bound on the objective as
       the best relaxation solution.
       
      optional bool exploit_relaxation_solution = 161 [default = false];
      Returns:
      This builder for chaining.
    • hasExploitObjective

      public boolean hasExploitObjective()
       When branching an a variable that directly affect the objective,
       branch on the value that lead to the best objective first.
       
      optional bool exploit_objective = 131 [default = true];
      Specified by:
      hasExploitObjective in interface SatParametersOrBuilder
      Returns:
      Whether the exploitObjective field is set.
    • getExploitObjective

      public boolean getExploitObjective()
       When branching an a variable that directly affect the objective,
       branch on the value that lead to the best objective first.
       
      optional bool exploit_objective = 131 [default = true];
      Specified by:
      getExploitObjective in interface SatParametersOrBuilder
      Returns:
      The exploitObjective.
    • setExploitObjective

      public SatParameters.Builder setExploitObjective(boolean value)
       When branching an a variable that directly affect the objective,
       branch on the value that lead to the best objective first.
       
      optional bool exploit_objective = 131 [default = true];
      Parameters:
      value - The exploitObjective to set.
      Returns:
      This builder for chaining.
    • clearExploitObjective

      public SatParameters.Builder clearExploitObjective()
       When branching an a variable that directly affect the objective,
       branch on the value that lead to the best objective first.
       
      optional bool exploit_objective = 131 [default = true];
      Returns:
      This builder for chaining.
    • hasDetectLinearizedProduct

      public boolean hasDetectLinearizedProduct()
       Infer products of Boolean or of Boolean time IntegerVariable from the
       linear constrainst in the problem. This can be used in some cuts, altough
       for now we don't really exploit it.
       
      optional bool detect_linearized_product = 277 [default = false];
      Specified by:
      hasDetectLinearizedProduct in interface SatParametersOrBuilder
      Returns:
      Whether the detectLinearizedProduct field is set.
    • getDetectLinearizedProduct

      public boolean getDetectLinearizedProduct()
       Infer products of Boolean or of Boolean time IntegerVariable from the
       linear constrainst in the problem. This can be used in some cuts, altough
       for now we don't really exploit it.
       
      optional bool detect_linearized_product = 277 [default = false];
      Specified by:
      getDetectLinearizedProduct in interface SatParametersOrBuilder
      Returns:
      The detectLinearizedProduct.
    • setDetectLinearizedProduct

      public SatParameters.Builder setDetectLinearizedProduct(boolean value)
       Infer products of Boolean or of Boolean time IntegerVariable from the
       linear constrainst in the problem. This can be used in some cuts, altough
       for now we don't really exploit it.
       
      optional bool detect_linearized_product = 277 [default = false];
      Parameters:
      value - The detectLinearizedProduct to set.
      Returns:
      This builder for chaining.
    • clearDetectLinearizedProduct

      public SatParameters.Builder clearDetectLinearizedProduct()
       Infer products of Boolean or of Boolean time IntegerVariable from the
       linear constrainst in the problem. This can be used in some cuts, altough
       for now we don't really exploit it.
       
      optional bool detect_linearized_product = 277 [default = false];
      Returns:
      This builder for chaining.
    • hasMipMaxBound

      public boolean hasMipMaxBound()
       We need to bound the maximum magnitude of the variables for CP-SAT, and
       that is the bound we use. If the MIP model expect larger variable value in
       the solution, then the converted model will likely not be relevant.
       
      optional double mip_max_bound = 124 [default = 10000000];
      Specified by:
      hasMipMaxBound in interface SatParametersOrBuilder
      Returns:
      Whether the mipMaxBound field is set.
    • getMipMaxBound

      public double getMipMaxBound()
       We need to bound the maximum magnitude of the variables for CP-SAT, and
       that is the bound we use. If the MIP model expect larger variable value in
       the solution, then the converted model will likely not be relevant.
       
      optional double mip_max_bound = 124 [default = 10000000];
      Specified by:
      getMipMaxBound in interface SatParametersOrBuilder
      Returns:
      The mipMaxBound.
    • setMipMaxBound

      public SatParameters.Builder setMipMaxBound(double value)
       We need to bound the maximum magnitude of the variables for CP-SAT, and
       that is the bound we use. If the MIP model expect larger variable value in
       the solution, then the converted model will likely not be relevant.
       
      optional double mip_max_bound = 124 [default = 10000000];
      Parameters:
      value - The mipMaxBound to set.
      Returns:
      This builder for chaining.
    • clearMipMaxBound

      public SatParameters.Builder clearMipMaxBound()
       We need to bound the maximum magnitude of the variables for CP-SAT, and
       that is the bound we use. If the MIP model expect larger variable value in
       the solution, then the converted model will likely not be relevant.
       
      optional double mip_max_bound = 124 [default = 10000000];
      Returns:
      This builder for chaining.
    • hasMipVarScaling

      public boolean hasMipVarScaling()
       All continuous variable of the problem will be multiplied by this factor.
       By default, we don't do any variable scaling and rely on the MIP model to
       specify continuous variable domain with the wanted precision.
       
      optional double mip_var_scaling = 125 [default = 1];
      Specified by:
      hasMipVarScaling in interface SatParametersOrBuilder
      Returns:
      Whether the mipVarScaling field is set.
    • getMipVarScaling

      public double getMipVarScaling()
       All continuous variable of the problem will be multiplied by this factor.
       By default, we don't do any variable scaling and rely on the MIP model to
       specify continuous variable domain with the wanted precision.
       
      optional double mip_var_scaling = 125 [default = 1];
      Specified by:
      getMipVarScaling in interface SatParametersOrBuilder
      Returns:
      The mipVarScaling.
    • setMipVarScaling

      public SatParameters.Builder setMipVarScaling(double value)
       All continuous variable of the problem will be multiplied by this factor.
       By default, we don't do any variable scaling and rely on the MIP model to
       specify continuous variable domain with the wanted precision.
       
      optional double mip_var_scaling = 125 [default = 1];
      Parameters:
      value - The mipVarScaling to set.
      Returns:
      This builder for chaining.
    • clearMipVarScaling

      public SatParameters.Builder clearMipVarScaling()
       All continuous variable of the problem will be multiplied by this factor.
       By default, we don't do any variable scaling and rely on the MIP model to
       specify continuous variable domain with the wanted precision.
       
      optional double mip_var_scaling = 125 [default = 1];
      Returns:
      This builder for chaining.
    • hasMipScaleLargeDomain

      public boolean hasMipScaleLargeDomain()
       If this is false, then mip_var_scaling is only applied to variables with
       "small" domain. If it is true, we scale all floating point variable
       independenlty of their domain.
       
      optional bool mip_scale_large_domain = 225 [default = false];
      Specified by:
      hasMipScaleLargeDomain in interface SatParametersOrBuilder
      Returns:
      Whether the mipScaleLargeDomain field is set.
    • getMipScaleLargeDomain

      public boolean getMipScaleLargeDomain()
       If this is false, then mip_var_scaling is only applied to variables with
       "small" domain. If it is true, we scale all floating point variable
       independenlty of their domain.
       
      optional bool mip_scale_large_domain = 225 [default = false];
      Specified by:
      getMipScaleLargeDomain in interface SatParametersOrBuilder
      Returns:
      The mipScaleLargeDomain.
    • setMipScaleLargeDomain

      public SatParameters.Builder setMipScaleLargeDomain(boolean value)
       If this is false, then mip_var_scaling is only applied to variables with
       "small" domain. If it is true, we scale all floating point variable
       independenlty of their domain.
       
      optional bool mip_scale_large_domain = 225 [default = false];
      Parameters:
      value - The mipScaleLargeDomain to set.
      Returns:
      This builder for chaining.
    • clearMipScaleLargeDomain

      public SatParameters.Builder clearMipScaleLargeDomain()
       If this is false, then mip_var_scaling is only applied to variables with
       "small" domain. If it is true, we scale all floating point variable
       independenlty of their domain.
       
      optional bool mip_scale_large_domain = 225 [default = false];
      Returns:
      This builder for chaining.
    • hasMipAutomaticallyScaleVariables

      public boolean hasMipAutomaticallyScaleVariables()
       If true, some continuous variable might be automatically scaled. For now,
       this is only the case where we detect that a variable is actually an
       integer multiple of a constant. For instance, variables of the form k * 0.5
       are quite frequent, and if we detect this, we will scale such variable
       domain by 2 to make it implied integer.
       
      optional bool mip_automatically_scale_variables = 166 [default = true];
      Specified by:
      hasMipAutomaticallyScaleVariables in interface SatParametersOrBuilder
      Returns:
      Whether the mipAutomaticallyScaleVariables field is set.
    • getMipAutomaticallyScaleVariables

      public boolean getMipAutomaticallyScaleVariables()
       If true, some continuous variable might be automatically scaled. For now,
       this is only the case where we detect that a variable is actually an
       integer multiple of a constant. For instance, variables of the form k * 0.5
       are quite frequent, and if we detect this, we will scale such variable
       domain by 2 to make it implied integer.
       
      optional bool mip_automatically_scale_variables = 166 [default = true];
      Specified by:
      getMipAutomaticallyScaleVariables in interface SatParametersOrBuilder
      Returns:
      The mipAutomaticallyScaleVariables.
    • setMipAutomaticallyScaleVariables

      public SatParameters.Builder setMipAutomaticallyScaleVariables(boolean value)
       If true, some continuous variable might be automatically scaled. For now,
       this is only the case where we detect that a variable is actually an
       integer multiple of a constant. For instance, variables of the form k * 0.5
       are quite frequent, and if we detect this, we will scale such variable
       domain by 2 to make it implied integer.
       
      optional bool mip_automatically_scale_variables = 166 [default = true];
      Parameters:
      value - The mipAutomaticallyScaleVariables to set.
      Returns:
      This builder for chaining.
    • clearMipAutomaticallyScaleVariables

      public SatParameters.Builder clearMipAutomaticallyScaleVariables()
       If true, some continuous variable might be automatically scaled. For now,
       this is only the case where we detect that a variable is actually an
       integer multiple of a constant. For instance, variables of the form k * 0.5
       are quite frequent, and if we detect this, we will scale such variable
       domain by 2 to make it implied integer.
       
      optional bool mip_automatically_scale_variables = 166 [default = true];
      Returns:
      This builder for chaining.
    • hasOnlySolveIp

      public boolean hasOnlySolveIp()
       If one try to solve a MIP model with CP-SAT, because we assume all variable
       to be integer after scaling, we will not necessarily have the correct
       optimal. Note however that all feasible solutions are valid since we will
       just solve a more restricted version of the original problem.
      
       This parameters is here to prevent user to think the solution is optimal
       when it might not be. One will need to manually set this to false to solve
       a MIP model where the optimal might be different.
      
       Note that this is tested after some MIP presolve steps, so even if not
       all original variable are integer, we might end up with a pure IP after
       presolve and after implied integer detection.
       
      optional bool only_solve_ip = 222 [default = false];
      Specified by:
      hasOnlySolveIp in interface SatParametersOrBuilder
      Returns:
      Whether the onlySolveIp field is set.
    • getOnlySolveIp

      public boolean getOnlySolveIp()
       If one try to solve a MIP model with CP-SAT, because we assume all variable
       to be integer after scaling, we will not necessarily have the correct
       optimal. Note however that all feasible solutions are valid since we will
       just solve a more restricted version of the original problem.
      
       This parameters is here to prevent user to think the solution is optimal
       when it might not be. One will need to manually set this to false to solve
       a MIP model where the optimal might be different.
      
       Note that this is tested after some MIP presolve steps, so even if not
       all original variable are integer, we might end up with a pure IP after
       presolve and after implied integer detection.
       
      optional bool only_solve_ip = 222 [default = false];
      Specified by:
      getOnlySolveIp in interface SatParametersOrBuilder
      Returns:
      The onlySolveIp.
    • setOnlySolveIp

      public SatParameters.Builder setOnlySolveIp(boolean value)
       If one try to solve a MIP model with CP-SAT, because we assume all variable
       to be integer after scaling, we will not necessarily have the correct
       optimal. Note however that all feasible solutions are valid since we will
       just solve a more restricted version of the original problem.
      
       This parameters is here to prevent user to think the solution is optimal
       when it might not be. One will need to manually set this to false to solve
       a MIP model where the optimal might be different.
      
       Note that this is tested after some MIP presolve steps, so even if not
       all original variable are integer, we might end up with a pure IP after
       presolve and after implied integer detection.
       
      optional bool only_solve_ip = 222 [default = false];
      Parameters:
      value - The onlySolveIp to set.
      Returns:
      This builder for chaining.
    • clearOnlySolveIp

      public SatParameters.Builder clearOnlySolveIp()
       If one try to solve a MIP model with CP-SAT, because we assume all variable
       to be integer after scaling, we will not necessarily have the correct
       optimal. Note however that all feasible solutions are valid since we will
       just solve a more restricted version of the original problem.
      
       This parameters is here to prevent user to think the solution is optimal
       when it might not be. One will need to manually set this to false to solve
       a MIP model where the optimal might be different.
      
       Note that this is tested after some MIP presolve steps, so even if not
       all original variable are integer, we might end up with a pure IP after
       presolve and after implied integer detection.
       
      optional bool only_solve_ip = 222 [default = false];
      Returns:
      This builder for chaining.
    • hasMipWantedPrecision

      public boolean hasMipWantedPrecision()
       When scaling constraint with double coefficients to integer coefficients,
       we will multiply by a power of 2 and round the coefficients. We will choose
       the lowest power such that we have no potential overflow (see
       mip_max_activity_exponent) and the worst case constraint activity error
       does not exceed this threshold.
      
       Note that we also detect constraint with rational coefficients and scale
       them accordingly when it seems better instead of using a power of 2.
      
       We also relax all constraint bounds by this absolute value. For pure
       integer constraint, if this value if lower than one, this will not change
       anything. However it is needed when scaling MIP problems.
      
       If we manage to scale a constraint correctly, the maximum error we can make
       will be twice this value (once for the scaling error and once for the
       relaxed bounds). If we are not able to scale that well, we will display
       that fact but still scale as best as we can.
       
      optional double mip_wanted_precision = 126 [default = 1e-06];
      Specified by:
      hasMipWantedPrecision in interface SatParametersOrBuilder
      Returns:
      Whether the mipWantedPrecision field is set.
    • getMipWantedPrecision

      public double getMipWantedPrecision()
       When scaling constraint with double coefficients to integer coefficients,
       we will multiply by a power of 2 and round the coefficients. We will choose
       the lowest power such that we have no potential overflow (see
       mip_max_activity_exponent) and the worst case constraint activity error
       does not exceed this threshold.
      
       Note that we also detect constraint with rational coefficients and scale
       them accordingly when it seems better instead of using a power of 2.
      
       We also relax all constraint bounds by this absolute value. For pure
       integer constraint, if this value if lower than one, this will not change
       anything. However it is needed when scaling MIP problems.
      
       If we manage to scale a constraint correctly, the maximum error we can make
       will be twice this value (once for the scaling error and once for the
       relaxed bounds). If we are not able to scale that well, we will display
       that fact but still scale as best as we can.
       
      optional double mip_wanted_precision = 126 [default = 1e-06];
      Specified by:
      getMipWantedPrecision in interface SatParametersOrBuilder
      Returns:
      The mipWantedPrecision.
    • setMipWantedPrecision

      public SatParameters.Builder setMipWantedPrecision(double value)
       When scaling constraint with double coefficients to integer coefficients,
       we will multiply by a power of 2 and round the coefficients. We will choose
       the lowest power such that we have no potential overflow (see
       mip_max_activity_exponent) and the worst case constraint activity error
       does not exceed this threshold.
      
       Note that we also detect constraint with rational coefficients and scale
       them accordingly when it seems better instead of using a power of 2.
      
       We also relax all constraint bounds by this absolute value. For pure
       integer constraint, if this value if lower than one, this will not change
       anything. However it is needed when scaling MIP problems.
      
       If we manage to scale a constraint correctly, the maximum error we can make
       will be twice this value (once for the scaling error and once for the
       relaxed bounds). If we are not able to scale that well, we will display
       that fact but still scale as best as we can.
       
      optional double mip_wanted_precision = 126 [default = 1e-06];
      Parameters:
      value - The mipWantedPrecision to set.
      Returns:
      This builder for chaining.
    • clearMipWantedPrecision

      public SatParameters.Builder clearMipWantedPrecision()
       When scaling constraint with double coefficients to integer coefficients,
       we will multiply by a power of 2 and round the coefficients. We will choose
       the lowest power such that we have no potential overflow (see
       mip_max_activity_exponent) and the worst case constraint activity error
       does not exceed this threshold.
      
       Note that we also detect constraint with rational coefficients and scale
       them accordingly when it seems better instead of using a power of 2.
      
       We also relax all constraint bounds by this absolute value. For pure
       integer constraint, if this value if lower than one, this will not change
       anything. However it is needed when scaling MIP problems.
      
       If we manage to scale a constraint correctly, the maximum error we can make
       will be twice this value (once for the scaling error and once for the
       relaxed bounds). If we are not able to scale that well, we will display
       that fact but still scale as best as we can.
       
      optional double mip_wanted_precision = 126 [default = 1e-06];
      Returns:
      This builder for chaining.
    • hasMipMaxActivityExponent

      public boolean hasMipMaxActivityExponent()
       To avoid integer overflow, we always force the maximum possible constraint
       activity (and objective value) according to the initial variable domain to
       be smaller than 2 to this given power. Because of this, we cannot always
       reach the "mip_wanted_precision" parameter above.
      
       This can go as high as 62, but some internal algo currently abort early if
       they might run into integer overflow, so it is better to keep it a bit
       lower than this.
       
      optional int32 mip_max_activity_exponent = 127 [default = 53];
      Specified by:
      hasMipMaxActivityExponent in interface SatParametersOrBuilder
      Returns:
      Whether the mipMaxActivityExponent field is set.
    • getMipMaxActivityExponent

      public int getMipMaxActivityExponent()
       To avoid integer overflow, we always force the maximum possible constraint
       activity (and objective value) according to the initial variable domain to
       be smaller than 2 to this given power. Because of this, we cannot always
       reach the "mip_wanted_precision" parameter above.
      
       This can go as high as 62, but some internal algo currently abort early if
       they might run into integer overflow, so it is better to keep it a bit
       lower than this.
       
      optional int32 mip_max_activity_exponent = 127 [default = 53];
      Specified by:
      getMipMaxActivityExponent in interface SatParametersOrBuilder
      Returns:
      The mipMaxActivityExponent.
    • setMipMaxActivityExponent

      public SatParameters.Builder setMipMaxActivityExponent(int value)
       To avoid integer overflow, we always force the maximum possible constraint
       activity (and objective value) according to the initial variable domain to
       be smaller than 2 to this given power. Because of this, we cannot always
       reach the "mip_wanted_precision" parameter above.
      
       This can go as high as 62, but some internal algo currently abort early if
       they might run into integer overflow, so it is better to keep it a bit
       lower than this.
       
      optional int32 mip_max_activity_exponent = 127 [default = 53];
      Parameters:
      value - The mipMaxActivityExponent to set.
      Returns:
      This builder for chaining.
    • clearMipMaxActivityExponent

      public SatParameters.Builder clearMipMaxActivityExponent()
       To avoid integer overflow, we always force the maximum possible constraint
       activity (and objective value) according to the initial variable domain to
       be smaller than 2 to this given power. Because of this, we cannot always
       reach the "mip_wanted_precision" parameter above.
      
       This can go as high as 62, but some internal algo currently abort early if
       they might run into integer overflow, so it is better to keep it a bit
       lower than this.
       
      optional int32 mip_max_activity_exponent = 127 [default = 53];
      Returns:
      This builder for chaining.
    • hasMipCheckPrecision

      public boolean hasMipCheckPrecision()
       As explained in mip_precision and mip_max_activity_exponent, we cannot
       always reach the wanted precision during scaling. We use this threshold to
       enphasize in the logs when the precision seems bad.
       
      optional double mip_check_precision = 128 [default = 0.0001];
      Specified by:
      hasMipCheckPrecision in interface SatParametersOrBuilder
      Returns:
      Whether the mipCheckPrecision field is set.
    • getMipCheckPrecision

      public double getMipCheckPrecision()
       As explained in mip_precision and mip_max_activity_exponent, we cannot
       always reach the wanted precision during scaling. We use this threshold to
       enphasize in the logs when the precision seems bad.
       
      optional double mip_check_precision = 128 [default = 0.0001];
      Specified by:
      getMipCheckPrecision in interface SatParametersOrBuilder
      Returns:
      The mipCheckPrecision.
    • setMipCheckPrecision

      public SatParameters.Builder setMipCheckPrecision(double value)
       As explained in mip_precision and mip_max_activity_exponent, we cannot
       always reach the wanted precision during scaling. We use this threshold to
       enphasize in the logs when the precision seems bad.
       
      optional double mip_check_precision = 128 [default = 0.0001];
      Parameters:
      value - The mipCheckPrecision to set.
      Returns:
      This builder for chaining.
    • clearMipCheckPrecision

      public SatParameters.Builder clearMipCheckPrecision()
       As explained in mip_precision and mip_max_activity_exponent, we cannot
       always reach the wanted precision during scaling. We use this threshold to
       enphasize in the logs when the precision seems bad.
       
      optional double mip_check_precision = 128 [default = 0.0001];
      Returns:
      This builder for chaining.
    • hasMipComputeTrueObjectiveBound

      public boolean hasMipComputeTrueObjectiveBound()
       Even if we make big error when scaling the objective, we can always derive
       a correct lower bound on the original objective by using the exact lower
       bound on the scaled integer version of the objective. This should be fast,
       but if you don't care about having a precise lower bound, you can turn it
       off.
       
      optional bool mip_compute_true_objective_bound = 198 [default = true];
      Specified by:
      hasMipComputeTrueObjectiveBound in interface SatParametersOrBuilder
      Returns:
      Whether the mipComputeTrueObjectiveBound field is set.
    • getMipComputeTrueObjectiveBound

      public boolean getMipComputeTrueObjectiveBound()
       Even if we make big error when scaling the objective, we can always derive
       a correct lower bound on the original objective by using the exact lower
       bound on the scaled integer version of the objective. This should be fast,
       but if you don't care about having a precise lower bound, you can turn it
       off.
       
      optional bool mip_compute_true_objective_bound = 198 [default = true];
      Specified by:
      getMipComputeTrueObjectiveBound in interface SatParametersOrBuilder
      Returns:
      The mipComputeTrueObjectiveBound.
    • setMipComputeTrueObjectiveBound

      public SatParameters.Builder setMipComputeTrueObjectiveBound(boolean value)
       Even if we make big error when scaling the objective, we can always derive
       a correct lower bound on the original objective by using the exact lower
       bound on the scaled integer version of the objective. This should be fast,
       but if you don't care about having a precise lower bound, you can turn it
       off.
       
      optional bool mip_compute_true_objective_bound = 198 [default = true];
      Parameters:
      value - The mipComputeTrueObjectiveBound to set.
      Returns:
      This builder for chaining.
    • clearMipComputeTrueObjectiveBound

      public SatParameters.Builder clearMipComputeTrueObjectiveBound()
       Even if we make big error when scaling the objective, we can always derive
       a correct lower bound on the original objective by using the exact lower
       bound on the scaled integer version of the objective. This should be fast,
       but if you don't care about having a precise lower bound, you can turn it
       off.
       
      optional bool mip_compute_true_objective_bound = 198 [default = true];
      Returns:
      This builder for chaining.
    • hasMipMaxValidMagnitude

      public boolean hasMipMaxValidMagnitude()
       Any finite values in the input MIP must be below this threshold, otherwise
       the model will be reported invalid. This is needed to avoid floating point
       overflow when evaluating bounds * coeff for instance. We are a bit more
       defensive, but in practice, users shouldn't use super large values in a
       MIP.
       
      optional double mip_max_valid_magnitude = 199 [default = 1e+20];
      Specified by:
      hasMipMaxValidMagnitude in interface SatParametersOrBuilder
      Returns:
      Whether the mipMaxValidMagnitude field is set.
    • getMipMaxValidMagnitude

      public double getMipMaxValidMagnitude()
       Any finite values in the input MIP must be below this threshold, otherwise
       the model will be reported invalid. This is needed to avoid floating point
       overflow when evaluating bounds * coeff for instance. We are a bit more
       defensive, but in practice, users shouldn't use super large values in a
       MIP.
       
      optional double mip_max_valid_magnitude = 199 [default = 1e+20];
      Specified by:
      getMipMaxValidMagnitude in interface SatParametersOrBuilder
      Returns:
      The mipMaxValidMagnitude.
    • setMipMaxValidMagnitude

      public SatParameters.Builder setMipMaxValidMagnitude(double value)
       Any finite values in the input MIP must be below this threshold, otherwise
       the model will be reported invalid. This is needed to avoid floating point
       overflow when evaluating bounds * coeff for instance. We are a bit more
       defensive, but in practice, users shouldn't use super large values in a
       MIP.
       
      optional double mip_max_valid_magnitude = 199 [default = 1e+20];
      Parameters:
      value - The mipMaxValidMagnitude to set.
      Returns:
      This builder for chaining.
    • clearMipMaxValidMagnitude

      public SatParameters.Builder clearMipMaxValidMagnitude()
       Any finite values in the input MIP must be below this threshold, otherwise
       the model will be reported invalid. This is needed to avoid floating point
       overflow when evaluating bounds * coeff for instance. We are a bit more
       defensive, but in practice, users shouldn't use super large values in a
       MIP.
       
      optional double mip_max_valid_magnitude = 199 [default = 1e+20];
      Returns:
      This builder for chaining.
    • hasMipTreatHighMagnitudeBoundsAsInfinity

      public boolean hasMipTreatHighMagnitudeBoundsAsInfinity()
       By default, any variable/constraint bound with a finite value and a
       magnitude greater than the mip_max_valid_magnitude will result with a
       invalid model. This flags change the behavior such that such bounds are
       silently transformed to +∞ or -∞.
      
       It is recommended to keep it at false, and create valid bounds.
       
      optional bool mip_treat_high_magnitude_bounds_as_infinity = 278 [default = false];
      Specified by:
      hasMipTreatHighMagnitudeBoundsAsInfinity in interface SatParametersOrBuilder
      Returns:
      Whether the mipTreatHighMagnitudeBoundsAsInfinity field is set.
    • getMipTreatHighMagnitudeBoundsAsInfinity

      public boolean getMipTreatHighMagnitudeBoundsAsInfinity()
       By default, any variable/constraint bound with a finite value and a
       magnitude greater than the mip_max_valid_magnitude will result with a
       invalid model. This flags change the behavior such that such bounds are
       silently transformed to +∞ or -∞.
      
       It is recommended to keep it at false, and create valid bounds.
       
      optional bool mip_treat_high_magnitude_bounds_as_infinity = 278 [default = false];
      Specified by:
      getMipTreatHighMagnitudeBoundsAsInfinity in interface SatParametersOrBuilder
      Returns:
      The mipTreatHighMagnitudeBoundsAsInfinity.
    • setMipTreatHighMagnitudeBoundsAsInfinity

      public SatParameters.Builder setMipTreatHighMagnitudeBoundsAsInfinity(boolean value)
       By default, any variable/constraint bound with a finite value and a
       magnitude greater than the mip_max_valid_magnitude will result with a
       invalid model. This flags change the behavior such that such bounds are
       silently transformed to +∞ or -∞.
      
       It is recommended to keep it at false, and create valid bounds.
       
      optional bool mip_treat_high_magnitude_bounds_as_infinity = 278 [default = false];
      Parameters:
      value - The mipTreatHighMagnitudeBoundsAsInfinity to set.
      Returns:
      This builder for chaining.
    • clearMipTreatHighMagnitudeBoundsAsInfinity

      public SatParameters.Builder clearMipTreatHighMagnitudeBoundsAsInfinity()
       By default, any variable/constraint bound with a finite value and a
       magnitude greater than the mip_max_valid_magnitude will result with a
       invalid model. This flags change the behavior such that such bounds are
       silently transformed to +∞ or -∞.
      
       It is recommended to keep it at false, and create valid bounds.
       
      optional bool mip_treat_high_magnitude_bounds_as_infinity = 278 [default = false];
      Returns:
      This builder for chaining.
    • hasMipDropTolerance

      public boolean hasMipDropTolerance()
       Any value in the input mip with a magnitude lower than this will be set to
       zero. This is to avoid some issue in LP presolving.
       
      optional double mip_drop_tolerance = 232 [default = 1e-16];
      Specified by:
      hasMipDropTolerance in interface SatParametersOrBuilder
      Returns:
      Whether the mipDropTolerance field is set.
    • getMipDropTolerance

      public double getMipDropTolerance()
       Any value in the input mip with a magnitude lower than this will be set to
       zero. This is to avoid some issue in LP presolving.
       
      optional double mip_drop_tolerance = 232 [default = 1e-16];
      Specified by:
      getMipDropTolerance in interface SatParametersOrBuilder
      Returns:
      The mipDropTolerance.
    • setMipDropTolerance

      public SatParameters.Builder setMipDropTolerance(double value)
       Any value in the input mip with a magnitude lower than this will be set to
       zero. This is to avoid some issue in LP presolving.
       
      optional double mip_drop_tolerance = 232 [default = 1e-16];
      Parameters:
      value - The mipDropTolerance to set.
      Returns:
      This builder for chaining.
    • clearMipDropTolerance

      public SatParameters.Builder clearMipDropTolerance()
       Any value in the input mip with a magnitude lower than this will be set to
       zero. This is to avoid some issue in LP presolving.
       
      optional double mip_drop_tolerance = 232 [default = 1e-16];
      Returns:
      This builder for chaining.
    • hasMipPresolveLevel

      public boolean hasMipPresolveLevel()
       When solving a MIP, we do some basic floating point presolving before
       scaling the problem to integer to be handled by CP-SAT. This control how
       much of that presolve we do. It can help to better scale floating point
       model, but it is not always behaving nicely.
       
      optional int32 mip_presolve_level = 261 [default = 2];
      Specified by:
      hasMipPresolveLevel in interface SatParametersOrBuilder
      Returns:
      Whether the mipPresolveLevel field is set.
    • getMipPresolveLevel

      public int getMipPresolveLevel()
       When solving a MIP, we do some basic floating point presolving before
       scaling the problem to integer to be handled by CP-SAT. This control how
       much of that presolve we do. It can help to better scale floating point
       model, but it is not always behaving nicely.
       
      optional int32 mip_presolve_level = 261 [default = 2];
      Specified by:
      getMipPresolveLevel in interface SatParametersOrBuilder
      Returns:
      The mipPresolveLevel.
    • setMipPresolveLevel

      public SatParameters.Builder setMipPresolveLevel(int value)
       When solving a MIP, we do some basic floating point presolving before
       scaling the problem to integer to be handled by CP-SAT. This control how
       much of that presolve we do. It can help to better scale floating point
       model, but it is not always behaving nicely.
       
      optional int32 mip_presolve_level = 261 [default = 2];
      Parameters:
      value - The mipPresolveLevel to set.
      Returns:
      This builder for chaining.
    • clearMipPresolveLevel

      public SatParameters.Builder clearMipPresolveLevel()
       When solving a MIP, we do some basic floating point presolving before
       scaling the problem to integer to be handled by CP-SAT. This control how
       much of that presolve we do. It can help to better scale floating point
       model, but it is not always behaving nicely.
       
      optional int32 mip_presolve_level = 261 [default = 2];
      Returns:
      This builder for chaining.