DotNet Reference
DotNet Reference
Classes | |
| class | AllDifferentConstraintProto |
| All variables must take different values. More... | |
| class | AutomatonConstraintProto |
| This constraint forces a sequence of variables to be accepted by an automaton. More... | |
| class | BoolArgumentProto |
| Argument of the constraints of the form OP(literals). More... | |
| class | BoundedLinearExpression |
| class | CircuitConstraintProto |
| The circuit constraint is defined on a graph where the arc presence are controlled by literals. More... | |
| class | CircuitCoveringConstraintProto |
| Another routing constraint. More... | |
| class | Constraint |
| class | ConstraintProto |
| Next id: 29 More... | |
| class | CpModel |
| Wrapper class around the cp_model proto. More... | |
| class | CpModelProto |
| A constraint programming problem. More... | |
| class | CpModelReflection |
| Holder for reflection information generated from ortools/sat/cp_model.proto More... | |
| class | CpObjectiveProto |
| Optimization objective. More... | |
| class | CpSolver |
| class | CpSolverResponse |
| The response returned by a solver trying to solve a CpModelProto. More... | |
| class | CpSolverSolutionCallback |
| class | CumulativeConstraintProto |
| The sum of the demands of the intervals at each interval point cannot exceed a capacity. More... | |
| class | DecisionStrategyProto |
| Define the strategy to follow when the solver needs to take a new decision. More... | |
| class | ElementConstraintProto |
| The constraint target = vars[index]. More... | |
| interface | ILiteral |
| class | IntegerArgumentProto |
| Argument of the constraints of the form target_var = OP(vars). More... | |
| class | IntegerVariableProto |
| An integer variable. More... | |
| class | IntervalConstraintProto |
| This "special" constraint not only enforces (start + size == end) but can also be referred by other constraints using this "interval" concept. More... | |
| class | IntervalVar |
| class | IntVar |
| class | IntVarArrayHelper |
| class | InverseConstraintProto |
| The two arrays of variable each represent a function, the second is the inverse of the first: f_direct[i] == j <=> f_inverse[j] == i. More... | |
| class | LinearArgumentProto |
| class | LinearConstraintProto |
| The linear sum vars[i] * coeffs[i] must fall in the given domain. More... | |
| class | LinearExpr |
| class | LinearExpressionProto |
| class | NoOverlap2DConstraintProto |
| The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap. More... | |
| class | NoOverlapConstraintProto |
| All the intervals (index of IntervalConstraintProto) must be disjoint. More... | |
| class | NotBooleanVariable |
| class | ObjectiveSolutionPrinter |
| class | operations_research_sat |
| class | operations_research_satPINVOKE |
| class | PartialVariableAssignment |
| This message encodes a partial (or full) assignment of the variables of a CpModelProto. More... | |
| class | ProductCst |
| class | ReservoirConstraintProto |
| Maintain a reservoir level within bounds. More... | |
| class | RoutesConstraintProto |
| The "VRP" (Vehicle Routing Problem) constraint. More... | |
| class | SatHelper |
| class | SolutionCallback |
| class | SumArray |
| class | TableConstraintProto |
| The values of the n-tuple formed by the given variables can only be one of the listed n-tuples in values. More... | |
Enumerations | |
| enum | CpSolverStatus { Unknown = 0, ModelInvalid = 1, Feasible = 2, Infeasible = 3, Optimal = 4 } |
| The status returned by a solver trying to solve a CpModelProto. More... | |
Enumeration Type Documentation
◆ CpSolverStatus
|
strong |
The status returned by a solver trying to solve a CpModelProto.
| Enumerator | |
|---|---|
| Unknown | The status of the model is still unknown. A search limit has been reached before any of the statuses below could be determined. |
| ModelInvalid | The given CpModelProto didn't pass the validation step. You can get a detailed error by calling ValidateCpModel(model_proto). |
| Feasible | A feasible solution as been found. But the search was stopped before we could prove optimality or before we enumerated all solutions of a feasibility problem (if asked). |
| Infeasible | The problem has been proven infeasible. |
| Optimal | An optimal feasible solution has been found. More generally, this status represent a success. So we also return OPTIMAL if we find a solution for a pure feasiblity problem or if a gap limit has been specified and we return a solution within this limit. In the case where we need to return all the feasible solution, this status will only be returned if we enumerated all of them; If we stopped before, we will return FEASIBLE. |
Definition at line 186 of file CpModel.pb.cs.