Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
Definition at line 7 of file LinearBooleanProblemOrBuilder.java.
com.google.ortools.sat.BooleanAssignment com.google.ortools.sat.LinearBooleanProblemOrBuilder.getAssignment | ( | ) |
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.ortools.sat.BooleanAssignmentOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getAssignmentOrBuilder | ( | ) |
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.ortools.sat.LinearBooleanConstraint com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraints | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsCount | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
java.util.List< com.google.ortools.sat.LinearBooleanConstraint > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsList | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.ortools.sat.LinearBooleanConstraintOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsOrBuilder | ( | int | index | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
java.util.List<? extends com.google.ortools.sat.LinearBooleanConstraintOrBuilder > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getConstraintsOrBuilderList | ( | ) |
The constraints of the problem.
repeated .operations_research.sat.LinearBooleanConstraint constraints = 4;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
java.lang.String com.google.ortools.sat.LinearBooleanProblemOrBuilder.getName | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblemOrBuilder.getNameBytes | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getNumVariables | ( | ) |
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.ortools.sat.LinearObjective com.google.ortools.sat.LinearBooleanProblemOrBuilder.getObjective | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.ortools.sat.LinearObjectiveOrBuilder com.google.ortools.sat.LinearBooleanProblemOrBuilder.getObjectiveOrBuilder | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getOriginalNumVariables | ( | ) |
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
java.lang.String com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNames | ( | int | index | ) |
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;
index | The index of the element to return. |
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
com.google.protobuf.ByteString com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesBytes | ( | int | index | ) |
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;
index | The index of the value to return. |
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
int com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesCount | ( | ) |
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
java.util.List< java.lang.String > com.google.ortools.sat.LinearBooleanProblemOrBuilder.getVarNamesList | ( | ) |
The names of the problem variables. The variables index are 0-based and var_names[i] will be the name of the i-th variable which correspond to literals +(i + 1) or -(i + 1). This is optional and can be left empty.
repeated string var_names = 6;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasAssignment | ( | ) |
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
optional .operations_research.sat.BooleanAssignment assignment = 7;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasName | ( | ) |
The name of the problem.
optional string name = 1 [default = ""];
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasNumVariables | ( | ) |
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
optional int32 num_variables = 3;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasObjective | ( | ) |
The objective of the problem. If left empty, we just have a satisfiability problem.
optional .operations_research.sat.LinearObjective objective = 5;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.
boolean com.google.ortools.sat.LinearBooleanProblemOrBuilder.hasOriginalNumVariables | ( | ) |
Hack: When converting a wcnf formulat to a LinearBooleanProblem, extra variables need to be created. This stores the number of variables in the original problem (which are in one to one correspondence with the first variables of this problem).
optional int32 original_num_variables = 8;
Implemented in com.google.ortools.sat.LinearBooleanProblem.Builder, and com.google.ortools.sat.LinearBooleanProblem.