A linear Boolean problem.
More...
|
static pb::MessageParser< LinearBooleanProblem > | Parser [get] |
|
static pbr::MessageDescriptor | Descriptor [get] |
|
string | Name [get, set] |
| The name of the problem.
|
|
bool | HasName [get] |
| Gets whether the "name" field is set.
|
|
int | NumVariables [get, set] |
| The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
|
|
bool | HasNumVariables [get] |
| Gets whether the "num_variables" field is set.
|
|
pbc::RepeatedField< global::Google.OrTools.Sat.LinearBooleanConstraint > | Constraints [get] |
| The constraints of the problem.
|
|
global::Google.OrTools.Sat.LinearObjective | Objective [get, set] |
| The objective of the problem. If left empty, we just have a satisfiability problem.
|
|
pbc::RepeatedField< string > | VarNames [get] |
| 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.
|
|
global::Google.OrTools.Sat.BooleanAssignment | Assignment [get, set] |
| Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
|
|
int | OriginalNumVariables [get, set] |
| 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).
|
|
bool | HasOriginalNumVariables [get] |
| Gets whether the "original_num_variables" field is set.
|
|
A linear Boolean problem.
Definition at line 978 of file BooleanProblem.pb.cs.
◆ LinearBooleanProblem() [1/2]
Google.OrTools.Sat.LinearBooleanProblem.LinearBooleanProblem |
( |
| ) |
|
|
inline |
◆ LinearBooleanProblem() [2/2]
◆ CalculateSize()
int Google.OrTools.Sat.LinearBooleanProblem.CalculateSize |
( |
| ) |
|
|
inline |
◆ ClearName()
void Google.OrTools.Sat.LinearBooleanProblem.ClearName |
( |
| ) |
|
|
inline |
◆ ClearNumVariables()
void Google.OrTools.Sat.LinearBooleanProblem.ClearNumVariables |
( |
| ) |
|
|
inline |
◆ ClearOriginalNumVariables()
void Google.OrTools.Sat.LinearBooleanProblem.ClearOriginalNumVariables |
( |
| ) |
|
|
inline |
◆ Clone()
◆ Equals() [1/2]
◆ Equals() [2/2]
override bool Google.OrTools.Sat.LinearBooleanProblem.Equals |
( |
object | other | ) |
|
|
inline |
◆ GetHashCode()
override int Google.OrTools.Sat.LinearBooleanProblem.GetHashCode |
( |
| ) |
|
|
inline |
◆ MergeFrom() [1/2]
◆ MergeFrom() [2/2]
void Google.OrTools.Sat.LinearBooleanProblem.MergeFrom |
( |
pb.CodedInputStream | input | ) |
|
|
inline |
◆ ToString()
override string Google.OrTools.Sat.LinearBooleanProblem.ToString |
( |
| ) |
|
|
inline |
◆ WriteTo()
void Google.OrTools.Sat.LinearBooleanProblem.WriteTo |
( |
pb.CodedOutputStream | output | ) |
|
|
inline |
◆ AssignmentFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.AssignmentFieldNumber = 7 |
|
static |
◆ ConstraintsFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.ConstraintsFieldNumber = 4 |
|
static |
◆ NameFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.NameFieldNumber = 1 |
|
static |
◆ NumVariablesFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.NumVariablesFieldNumber = 3 |
|
static |
◆ ObjectiveFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.ObjectiveFieldNumber = 5 |
|
static |
◆ OriginalNumVariablesFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.OriginalNumVariablesFieldNumber = 8 |
|
static |
◆ VarNamesFieldNumber
const int Google.OrTools.Sat.LinearBooleanProblem.VarNamesFieldNumber = 6 |
|
static |
◆ Assignment
global.Google.OrTools.Sat.BooleanAssignment Google.OrTools.Sat.LinearBooleanProblem.Assignment |
|
getset |
Stores an assignment of the problem variables. That may be an initial feasible solution, just a partial assignment or the optimal solution.
Definition at line 1146 of file BooleanProblem.pb.cs.
◆ Constraints
pbc.RepeatedField<global.Google.OrTools.Sat.LinearBooleanConstraint> Google.OrTools.Sat.LinearBooleanProblem.Constraints |
|
get |
◆ Descriptor
pbr.MessageDescriptor Google.OrTools.Sat.LinearBooleanProblem.Descriptor |
|
staticget |
◆ HasName
bool Google.OrTools.Sat.LinearBooleanProblem.HasName |
|
get |
◆ HasNumVariables
bool Google.OrTools.Sat.LinearBooleanProblem.HasNumVariables |
|
get |
◆ HasOriginalNumVariables
bool Google.OrTools.Sat.LinearBooleanProblem.HasOriginalNumVariables |
|
get |
◆ Name
string Google.OrTools.Sat.LinearBooleanProblem.Name |
|
getset |
◆ NumVariables
int Google.OrTools.Sat.LinearBooleanProblem.NumVariables |
|
getset |
The number of variables in the problem. All the signed representation of the problem literals must be in [-num_variables, num_variables], excluding 0.
Definition at line 1071 of file BooleanProblem.pb.cs.
◆ Objective
global.Google.OrTools.Sat.LinearObjective Google.OrTools.Sat.LinearBooleanProblem.Objective |
|
getset |
The objective of the problem. If left empty, we just have a satisfiability problem.
Definition at line 1114 of file BooleanProblem.pb.cs.
◆ OriginalNumVariables
int Google.OrTools.Sat.LinearBooleanProblem.OriginalNumVariables |
|
getset |
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).
Definition at line 1166 of file BooleanProblem.pb.cs.
◆ Parser
◆ VarNames
pbc.RepeatedField<string> Google.OrTools.Sat.LinearBooleanProblem.VarNames |
|
get |
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.
Definition at line 1133 of file BooleanProblem.pb.cs.
The documentation for this class was generated from the following file: