Google OR-Tools v9.11
a fast and portable software suite for combinatorial optimization
|
A linear Boolean constraint which is a bounded sum of linear terms. Each term beeing a literal times an integer coefficient. If we assume that a literal takes the value 1 if it is true and 0 otherwise, the constraint is: lower_bound <= ... + coefficients[i] * literals[i] + ... <= upper_bound. More...
Public Member Functions | |
LinearBooleanConstraint () | |
LinearBooleanConstraint (LinearBooleanConstraint other) | |
LinearBooleanConstraint | Clone () |
void | ClearLowerBound () |
Clears the value of the "lower_bound" field. | |
void | ClearUpperBound () |
Clears the value of the "upper_bound" field. | |
void | ClearName () |
Clears the value of the "name" field. | |
override bool | Equals (object other) |
bool | Equals (LinearBooleanConstraint other) |
override int | GetHashCode () |
override string | ToString () |
void | WriteTo (pb::CodedOutputStream output) |
int | CalculateSize () |
void | MergeFrom (LinearBooleanConstraint other) |
void | MergeFrom (pb::CodedInputStream input) |
Static Public Attributes | |
const int | LiteralsFieldNumber = 1 |
Field number for the "literals" field. | |
const int | CoefficientsFieldNumber = 2 |
Field number for the "coefficients" field. | |
const int | LowerBoundFieldNumber = 3 |
Field number for the "lower_bound" field. | |
const int | UpperBoundFieldNumber = 4 |
Field number for the "upper_bound" field. | |
const int | NameFieldNumber = 5 |
Field number for the "name" field. | |
Properties | |
static pb::MessageParser< LinearBooleanConstraint > | Parser [get] |
static pbr::MessageDescriptor | Descriptor [get] |
pbc::RepeatedField< int > | Literals [get] |
Linear terms involved in this constraint. | |
pbc::RepeatedField< long > | Coefficients [get] |
long | LowerBound [get, set] |
Optional lower (resp. upper) bound of the constraint. If not present, it means that the constraint is not bounded in this direction. The bounds are INCLUSIVE. | |
bool | HasLowerBound [get] |
Gets whether the "lower_bound" field is set. | |
long | UpperBound [get, set] |
bool | HasUpperBound [get] |
Gets whether the "upper_bound" field is set. | |
string | Name [get, set] |
The name of this constraint. | |
bool | HasName [get] |
Gets whether the "name" field is set. | |
A linear Boolean constraint which is a bounded sum of linear terms. Each term beeing a literal times an integer coefficient. If we assume that a literal takes the value 1 if it is true and 0 otherwise, the constraint is: lower_bound <= ... + coefficients[i] * literals[i] + ... <= upper_bound.
Definition at line 63 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 89 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 97 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 332 of file BooleanProblem.pb.cs.
|
inline |
Clears the value of the "lower_bound" field.
Definition at line 176 of file BooleanProblem.pb.cs.
|
inline |
Clears the value of the "name" field.
Definition at line 232 of file BooleanProblem.pb.cs.
|
inline |
Clears the value of the "upper_bound" field.
Definition at line 203 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 109 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 244 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 238 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 261 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 353 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 373 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 276 of file BooleanProblem.pb.cs.
|
inline |
Definition at line 282 of file BooleanProblem.pb.cs.
|
static |
Field number for the "coefficients" field.
Definition at line 138 of file BooleanProblem.pb.cs.
|
static |
Field number for the "literals" field.
Definition at line 114 of file BooleanProblem.pb.cs.
|
static |
Field number for the "lower_bound" field.
Definition at line 149 of file BooleanProblem.pb.cs.
|
static |
Field number for the "name" field.
Definition at line 208 of file BooleanProblem.pb.cs.
|
static |
Field number for the "upper_bound" field.
Definition at line 181 of file BooleanProblem.pb.cs.
|
get |
Definition at line 144 of file BooleanProblem.pb.cs.
|
staticget |
Definition at line 77 of file BooleanProblem.pb.cs.
|
get |
Gets whether the "lower_bound" field is set.
Definition at line 170 of file BooleanProblem.pb.cs.
|
get |
Gets whether the "name" field is set.
Definition at line 226 of file BooleanProblem.pb.cs.
|
get |
Gets whether the "upper_bound" field is set.
Definition at line 197 of file BooleanProblem.pb.cs.
|
get |
Linear terms involved in this constraint.
literals[i] is the signed representation of the i-th literal of the constraint and coefficients[i] its coefficients. The signed representation is as follow: for a 0-based variable index x, (x + 1) represents the variable x and -(x + 1) represents its negation.
Definition at line 133 of file BooleanProblem.pb.cs.
|
getset |
Optional lower (resp. upper) bound of the constraint. If not present, it means that the constraint is not bounded in this direction. The bounds are INCLUSIVE.
Definition at line 160 of file BooleanProblem.pb.cs.
|
getset |
The name of this constraint.
Definition at line 217 of file BooleanProblem.pb.cs.
|
staticget |
Definition at line 73 of file BooleanProblem.pb.cs.
|
getset |
Definition at line 187 of file BooleanProblem.pb.cs.