 |
Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
|
Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Static Public Member Functions | |
| static final com.google.protobuf.Descriptors.Descriptor | getDescriptor () |
Protected Member Functions | |
| com.google.protobuf.GeneratedMessage.FieldAccessorTable | internalGetFieldAccessorTable () |
A constraint programming problem.
Protobuf type operations_research.sat.CpModelProto
Definition at line 906 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addAllAssumptions | ( | java.lang.Iterable<? extends java.lang.Integer > | values | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
| values | The assumptions to add. |
Definition at line 3269 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addAllConstraints | ( | java.lang.Iterable<? extends com.google.ortools.sat.ConstraintProto > | values | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1881 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addAllSearchStrategy | ( | java.lang.Iterable<? extends com.google.ortools.sat.DecisionStrategyProto > | values | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2663 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addAllVariables | ( | java.lang.Iterable<? extends com.google.ortools.sat.IntegerVariableProto > | values | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1609 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addAssumptions | ( | int | value | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
| value | The assumptions to add. |
Definition at line 3240 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addConstraints | ( | com.google.ortools.sat.ConstraintProto | value | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1820 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addConstraints | ( | com.google.ortools.sat.ConstraintProto.Builder | builderForValue | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1853 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addConstraints | ( | int | index, |
| com.google.ortools.sat.ConstraintProto | value ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1836 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addConstraints | ( | int | index, |
| com.google.ortools.sat.ConstraintProto.Builder | builderForValue ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1867 of file CpModelProto.java.
| com.google.ortools.sat.ConstraintProto.Builder com.google.ortools.sat.CpModelProto.Builder.addConstraintsBuilder | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1950 of file CpModelProto.java.
| com.google.ortools.sat.ConstraintProto.Builder com.google.ortools.sat.CpModelProto.Builder.addConstraintsBuilder | ( | int | index | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1957 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategy | ( | com.google.ortools.sat.DecisionStrategyProto | value | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2554 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategy | ( | com.google.ortools.sat.DecisionStrategyProto.Builder | builderForValue | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2611 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategy | ( | int | index, |
| com.google.ortools.sat.DecisionStrategyProto | value ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2582 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategy | ( | int | index, |
| com.google.ortools.sat.DecisionStrategyProto.Builder | builderForValue ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2637 of file CpModelProto.java.
| com.google.ortools.sat.DecisionStrategyProto.Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategyBuilder | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2804 of file CpModelProto.java.
| com.google.ortools.sat.DecisionStrategyProto.Builder com.google.ortools.sat.CpModelProto.Builder.addSearchStrategyBuilder | ( | int | index | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2823 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addVariables | ( | com.google.ortools.sat.IntegerVariableProto | value | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1532 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addVariables | ( | com.google.ortools.sat.IntegerVariableProto.Builder | builderForValue | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1573 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addVariables | ( | int | index, |
| com.google.ortools.sat.IntegerVariableProto | value ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1552 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.addVariables | ( | int | index, |
| com.google.ortools.sat.IntegerVariableProto.Builder | builderForValue ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1591 of file CpModelProto.java.
| com.google.ortools.sat.IntegerVariableProto.Builder com.google.ortools.sat.CpModelProto.Builder.addVariablesBuilder | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1702 of file CpModelProto.java.
| com.google.ortools.sat.IntegerVariableProto.Builder com.google.ortools.sat.CpModelProto.Builder.addVariablesBuilder | ( | int | index | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1713 of file CpModelProto.java.
| com.google.ortools.sat.CpModelProto com.google.ortools.sat.CpModelProto.Builder.build | ( | ) |
Definition at line 1007 of file CpModelProto.java.
| com.google.ortools.sat.CpModelProto com.google.ortools.sat.CpModelProto.Builder.buildPartial | ( | ) |
Definition at line 1016 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clear | ( | ) |
Definition at line 946 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearAssumptions | ( | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
Definition at line 3298 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearConstraints | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1896 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearFloatingPointObjective | ( | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Definition at line 2312 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearName | ( | ) |
For debug/logging only. Can be empty.
string name = 1;
Definition at line 1407 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearObjective | ( | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Definition at line 2083 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearSearchStrategy | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2690 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearSolutionHint | ( | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Definition at line 3021 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearSymmetry | ( | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Definition at line 3428 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.clearVariables | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1628 of file CpModelProto.java.
| int com.google.ortools.sat.CpModelProto.Builder.getAssumptions | ( | int | index | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
| index | The index of the element to return. |
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3185 of file CpModelProto.java.
| int com.google.ortools.sat.CpModelProto.Builder.getAssumptionsCount | ( | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3161 of file CpModelProto.java.
| java.util.List< java.lang.Integer > com.google.ortools.sat.CpModelProto.Builder.getAssumptionsList | ( | ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3137 of file CpModelProto.java.
| com.google.ortools.sat.ConstraintProto com.google.ortools.sat.CpModelProto.Builder.getConstraints | ( | int | index | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1779 of file CpModelProto.java.
| com.google.ortools.sat.ConstraintProto.Builder com.google.ortools.sat.CpModelProto.Builder.getConstraintsBuilder | ( | int | index | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1922 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.ConstraintProto.Builder > com.google.ortools.sat.CpModelProto.Builder.getConstraintsBuilderList | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1966 of file CpModelProto.java.
| int com.google.ortools.sat.CpModelProto.Builder.getConstraintsCount | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1769 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.ConstraintProto > com.google.ortools.sat.CpModelProto.Builder.getConstraintsList | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1759 of file CpModelProto.java.
| com.google.ortools.sat.ConstraintProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getConstraintsOrBuilder | ( | int | index | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1929 of file CpModelProto.java.
| java.util.List<? extends com.google.ortools.sat.ConstraintProtoOrBuilder > com.google.ortools.sat.CpModelProto.Builder.getConstraintsOrBuilderList | ( | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1940 of file CpModelProto.java.
| com.google.ortools.sat.CpModelProto com.google.ortools.sat.CpModelProto.Builder.getDefaultInstanceForType | ( | ) |
Definition at line 1002 of file CpModelProto.java.
|
static |
Definition at line 911 of file CpModelProto.java.
| com.google.protobuf.Descriptors.Descriptor com.google.ortools.sat.CpModelProto.Builder.getDescriptorForType | ( | ) |
Definition at line 997 of file CpModelProto.java.
| com.google.ortools.sat.FloatObjectiveProto com.google.ortools.sat.CpModelProto.Builder.getFloatingPointObjective | ( | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2187 of file CpModelProto.java.
| com.google.ortools.sat.FloatObjectiveProto.Builder com.google.ortools.sat.CpModelProto.Builder.getFloatingPointObjectiveBuilder | ( | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Definition at line 2341 of file CpModelProto.java.
| com.google.ortools.sat.FloatObjectiveProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getFloatingPointObjectiveOrBuilder | ( | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2365 of file CpModelProto.java.
| java.lang.String com.google.ortools.sat.CpModelProto.Builder.getName | ( | ) |
For debug/logging only. Can be empty.
string name = 1;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1349 of file CpModelProto.java.
| com.google.protobuf.ByteString com.google.ortools.sat.CpModelProto.Builder.getNameBytes | ( | ) |
For debug/logging only. Can be empty.
string name = 1;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1370 of file CpModelProto.java.
| com.google.ortools.sat.CpObjectiveProto com.google.ortools.sat.CpModelProto.Builder.getObjective | ( | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2006 of file CpModelProto.java.
| com.google.ortools.sat.CpObjectiveProto.Builder com.google.ortools.sat.CpModelProto.Builder.getObjectiveBuilder | ( | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Definition at line 2100 of file CpModelProto.java.
| com.google.ortools.sat.CpObjectiveProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getObjectiveOrBuilder | ( | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2112 of file CpModelProto.java.
| com.google.ortools.sat.DecisionStrategyProto com.google.ortools.sat.CpModelProto.Builder.getSearchStrategy | ( | int | index | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2477 of file CpModelProto.java.
| com.google.ortools.sat.DecisionStrategyProto.Builder com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyBuilder | ( | int | index | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2740 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.DecisionStrategyProto.Builder > com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyBuilderList | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2844 of file CpModelProto.java.
| int com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyCount | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2455 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.DecisionStrategyProto > com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyList | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2433 of file CpModelProto.java.
| com.google.ortools.sat.DecisionStrategyProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyOrBuilder | ( | int | index | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2759 of file CpModelProto.java.
| java.util.List<? extends com.google.ortools.sat.DecisionStrategyProtoOrBuilder > com.google.ortools.sat.CpModelProto.Builder.getSearchStrategyOrBuilderList | ( | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2782 of file CpModelProto.java.
| com.google.ortools.sat.PartialVariableAssignment com.google.ortools.sat.CpModelProto.Builder.getSolutionHint | ( | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2904 of file CpModelProto.java.
| com.google.ortools.sat.PartialVariableAssignment.Builder com.google.ortools.sat.CpModelProto.Builder.getSolutionHintBuilder | ( | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Definition at line 3048 of file CpModelProto.java.
| com.google.ortools.sat.PartialVariableAssignmentOrBuilder com.google.ortools.sat.CpModelProto.Builder.getSolutionHintOrBuilder | ( | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3070 of file CpModelProto.java.
| com.google.ortools.sat.SymmetryProto com.google.ortools.sat.CpModelProto.Builder.getSymmetry | ( | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3335 of file CpModelProto.java.
| com.google.ortools.sat.SymmetryProto.Builder com.google.ortools.sat.CpModelProto.Builder.getSymmetryBuilder | ( | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Definition at line 3449 of file CpModelProto.java.
| com.google.ortools.sat.SymmetryProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getSymmetryOrBuilder | ( | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3465 of file CpModelProto.java.
| com.google.ortools.sat.IntegerVariableProto com.google.ortools.sat.CpModelProto.Builder.getVariables | ( | int | index | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1479 of file CpModelProto.java.
| com.google.ortools.sat.IntegerVariableProto.Builder com.google.ortools.sat.CpModelProto.Builder.getVariablesBuilder | ( | int | index | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1662 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.IntegerVariableProto.Builder > com.google.ortools.sat.CpModelProto.Builder.getVariablesBuilderList | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1726 of file CpModelProto.java.
| int com.google.ortools.sat.CpModelProto.Builder.getVariablesCount | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1465 of file CpModelProto.java.
| java.util.List< com.google.ortools.sat.IntegerVariableProto > com.google.ortools.sat.CpModelProto.Builder.getVariablesList | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1451 of file CpModelProto.java.
| com.google.ortools.sat.IntegerVariableProtoOrBuilder com.google.ortools.sat.CpModelProto.Builder.getVariablesOrBuilder | ( | int | index | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1673 of file CpModelProto.java.
| java.util.List<? extends com.google.ortools.sat.IntegerVariableProtoOrBuilder > com.google.ortools.sat.CpModelProto.Builder.getVariablesOrBuilderList | ( | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1688 of file CpModelProto.java.
| boolean com.google.ortools.sat.CpModelProto.Builder.hasFloatingPointObjective | ( | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2164 of file CpModelProto.java.
| boolean com.google.ortools.sat.CpModelProto.Builder.hasObjective | ( | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 1995 of file CpModelProto.java.
| boolean com.google.ortools.sat.CpModelProto.Builder.hasSolutionHint | ( | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 2883 of file CpModelProto.java.
| boolean com.google.ortools.sat.CpModelProto.Builder.hasSymmetry | ( | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Implements com.google.ortools.sat.CpModelProtoOrBuilder.
Definition at line 3320 of file CpModelProto.java.
|
protected |
Definition at line 917 of file CpModelProto.java.
| final boolean com.google.ortools.sat.CpModelProto.Builder.isInitialized | ( | ) |
Definition at line 1215 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeFloatingPointObjective | ( | com.google.ortools.sat.FloatObjectiveProto | value | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Definition at line 2275 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeFrom | ( | com.google.ortools.sat.CpModelProto | other | ) |
Definition at line 1101 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeFrom | ( | com.google.protobuf.CodedInputStream | input, |
| com.google.protobuf.ExtensionRegistryLite | extensionRegistry ) throws java.io.IOException |
Definition at line 1220 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeFrom | ( | com.google.protobuf.Message | other | ) |
Definition at line 1092 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeObjective | ( | com.google.ortools.sat.CpObjectiveProto | value | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Definition at line 2058 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeSolutionHint | ( | com.google.ortools.sat.PartialVariableAssignment | value | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Definition at line 2986 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.mergeSymmetry | ( | com.google.ortools.sat.SymmetryProto | value | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Definition at line 3399 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.removeConstraints | ( | int | index | ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1909 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.removeSearchStrategy | ( | int | index | ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2715 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.removeVariables | ( | int | index | ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1645 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setAssumptions | ( | int | index, |
| int | value ) |
A list of literals. The model will be solved assuming all these literals are true. Compared to just fixing the domain of these literals, using this mechanism is slower but allows in case the model is INFEASIBLE to get a potentially small subset of them that can be used to explain the infeasibility. Think (IIS), except when you are only concerned by the provided assumptions. This is powerful as it allows to group a set of logically related constraint under only one enforcement literal which can potentially give you a good and interpretable explanation for infeasiblity. Such infeasibility explanation will be available in the sufficient_assumptions_for_infeasibility response field.
repeated int32 assumptions = 7;
| index | The index to set the value at. |
| value | The assumptions to set. |
Definition at line 3210 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setConstraints | ( | int | index, |
| com.google.ortools.sat.ConstraintProto | value ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1789 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setConstraints | ( | int | index, |
| com.google.ortools.sat.ConstraintProto.Builder | builderForValue ) |
repeated .operations_research.sat.ConstraintProto constraints = 3;
Definition at line 1806 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setFloatingPointObjective | ( | com.google.ortools.sat.FloatObjectiveProto | value | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Definition at line 2213 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setFloatingPointObjective | ( | com.google.ortools.sat.FloatObjectiveProto.Builder | builderForValue | ) |
Advanced usage. It is invalid to have both an objective and a floating point objective. The objective of the model, in floating point format. The solver will automatically scale this to integer during expansion and thus convert it to a normal CpObjectiveProto. See the mip* parameters to control how this is scaled. In most situation the precision will be good enough, but you can see the logs to see what are the precision guaranteed when this is converted to a fixed point representation. Note that even if the precision is bad, the returned objective_value and best_objective_bound will be computed correctly. So at the end of the solve you can check the gap if you only want precise optimal.
.operations_research.sat.FloatObjectiveProto floating_point_objective = 9;
Definition at line 2245 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setName | ( | java.lang.String | value | ) |
For debug/logging only. Can be empty.
string name = 1;
| value | The name to set. |
Definition at line 1391 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setNameBytes | ( | com.google.protobuf.ByteString | value | ) |
For debug/logging only. Can be empty.
string name = 1;
| value | The bytes for name to set. |
Definition at line 1422 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setObjective | ( | com.google.ortools.sat.CpObjectiveProto | value | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Definition at line 2020 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setObjective | ( | com.google.ortools.sat.CpObjectiveProto.Builder | builderForValue | ) |
The objective to minimize. Can be empty for pure decision problems.
.operations_research.sat.CpObjectiveProto objective = 4;
Definition at line 2040 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSearchStrategy | ( | int | index, |
| com.google.ortools.sat.DecisionStrategyProto | value ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2499 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSearchStrategy | ( | int | index, |
| com.google.ortools.sat.DecisionStrategyProto.Builder | builderForValue ) |
Defines the strategy that the solver should follow when the search_branching parameter is set to FIXED_SEARCH. Note that this strategy is also used as a heuristic when we are not in fixed search. Advanced Usage: if not all variables appears and the parameter "instantiate_all_variables" is set to false, then the solver will not try to instantiate the variables that do not appear. Thus, at the end of the search, not all variables may be fixed. Currently, we will set them to their lower bound in the solution.
repeated .operations_research.sat.DecisionStrategyProto search_strategy = 5;
Definition at line 2528 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSolutionHint | ( | com.google.ortools.sat.PartialVariableAssignment | value | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Definition at line 2928 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSolutionHint | ( | com.google.ortools.sat.PartialVariableAssignment.Builder | builderForValue | ) |
Solution hint. If a feasible or almost-feasible solution to the problem is already known, it may be helpful to pass it to the solver so that it can be used. The solver will try to use this information to create its initial feasible solution. Note that it may not always be faster to give a hint like this to the solver. There is also no guarantee that the solver will use this hint or try to return a solution "close" to this assignment in case of multiple optimal solutions.
.operations_research.sat.PartialVariableAssignment solution_hint = 6;
Definition at line 2958 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSymmetry | ( | com.google.ortools.sat.SymmetryProto | value | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Definition at line 3353 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setSymmetry | ( | com.google.ortools.sat.SymmetryProto.Builder | builderForValue | ) |
For now, this is not meant to be filled by a client writing a model, but by our preprocessing step. Information about the symmetries of the feasible solution space. These usually leaves the objective invariant.
.operations_research.sat.SymmetryProto symmetry = 8;
Definition at line 3377 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setVariables | ( | int | index, |
| com.google.ortools.sat.IntegerVariableProto | value ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1493 of file CpModelProto.java.
| Builder com.google.ortools.sat.CpModelProto.Builder.setVariables | ( | int | index, |
| com.google.ortools.sat.IntegerVariableProto.Builder | builderForValue ) |
The associated Protos should be referred by their index in these fields.
repeated .operations_research.sat.IntegerVariableProto variables = 2;
Definition at line 1514 of file CpModelProto.java.
1.12.0 
Public Member Functions inherited from