| NCreateSigningKey | |
| CProgram | |
| NGoogle | |
| NOrTools | |
| NTests | |
| CKnapsakSolverTest | |
| CConstraintSolverTest | |
| CRoutingSolverTest | |
| CBoundCostTest | |
| CRoutingDimensionTest | |
| CFlowTest | |
| CInitTest | |
| CLinearSolverTest | |
| CModelBuilderTest | |
| CSatSolverTest | |
| NConstraintSolver | |
| CIntArrayHelper | |
| CIntervalVarArrayHelper | |
| CIntVarArrayHelper | |
| CIntVarVector | |
| CIntVarVectorEnumerator | |
| CSearchMonitorVector | |
| CSearchMonitorVectorEnumerator | |
| CDecisionBuilderVector | |
| CDecisionBuilderVectorEnumerator | |
| CIntervalVarVector | |
| CIntervalVarVectorEnumerator | |
| CSequenceVarVector | |
| CSequenceVarVectorEnumerator | |
| CLocalSearchOperatorVector | |
| CLocalSearchOperatorVectorEnumerator | |
| CLocalSearchFilterVector | |
| CLocalSearchFilterVectorEnumerator | |
| CSymmetryBreakerVector | |
| CSymmetryBreakerVectorEnumerator | |
| CNetDecisionBuilder | |
| CNetDecision | |
| CNetDemon | |
| CNetConstraint | |
| CIntVarEnumerator | |
| CIntVarIterator | |
| CSolver | |
| CIntegerCastInfo | |
| CIntExpr | |
| CConstraint | |
| CIConstraintWithStatus | |
| CBaseEquality | |
| CWrappedConstraint | |
| CIntExprEquality | |
| CConstraintEquality | |
| CAlternativeNodeIterator | |
| CAssignment | |
| CAssignmentElement | |
| CAssignmentIntContainer | |
| CAssignmentIntervalContainer | |
| CAssignmentSequenceContainer | |
| CBaseIntExpr | |
| CBaseLns | |
| CBaseObject | |
| CBaseObjectiveMonitor | |
| CBooleanVar | |
| CBoundCost | |
| CCastConstraint | |
| CChangeValue | |
| CDecision | |
| CDecisionBuilder | |
| CDecisionVisitor | |
| CDefaultPhaseParameters | |
| CDemon | |
| CDisjunctiveConstraint | |
| CImprovementSearchLimit | |
| CInt64Vector | |
| CInt64VectorEnumerator | |
| CInt64VectorVector | |
| CInt64VectorVectorEnumerator | |
| CIntBoolPair | |
| CIntervalVar | |
| CIntervalVarElement | |
| CIntTupleSet | |
| CIntVar | |
| CIntVarElement | |
| CIntVarLocalSearchFilter | |
| CIntVarLocalSearchOperator | |
| CIntVector | |
| CIntVectorEnumerator | |
| CIntVectorVector | |
| CIntVectorVectorEnumerator | |
| CLocalSearchFilter | |
| CLocalSearchFilterManager | |
| CFilterEvent | |
| CLocalSearchMonitor | |
| CLocalSearchOperator | |
| CLocalSearchOperatorState | |
| CLocalSearchPhaseParameters | |
| CModelCache | |
| CModelVisitor | |
| CNodeNeighborIterator | |
| CObjectiveMonitor | |
| Coperations_research_constraint_solver | |
| Coperations_research_constraint_solverPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| COptimizeVar | |
| CPack | |
| CPathsMetadata | |
| CPickupDeliveryPair | |
| CPropagationBaseObject | |
| CPropagationMonitor | |
| CRegularLimit | |
| CRevBool | |
| CRevInteger | |
| CRevPartialSequence | |
| CRoutingDimension | |
| CRoutingEnumsReflection | Holder for reflection information generated from ortools/constraint_solver/routing_enums.proto |
| CFirstSolutionStrategy | First solution strategies, used as starting point of local search |
| CTypes | Container for nested types declared in the FirstSolutionStrategy message type |
| CLocalSearchMetaheuristic | Local search metaheuristics used to guide the search. Apart from greedy descent, they will try to escape local minima |
| CTypes | Container for nested types declared in the LocalSearchMetaheuristic message type |
| CRoutingSearchStatus | Used by RoutingModel to report the status of the search for a solution |
| CTypes | Container for nested types declared in the RoutingSearchStatus message type |
| CRoutingHeuristicParametersReflection | Holder for reflection information generated from ortools/constraint_solver/routing_heuristic_parameters.proto |
| CLocalCheapestInsertionParameters | Parameters used to configure local cheapest insertion heuristics |
| CTypes | Container for nested types declared in the LocalCheapestInsertionParameters message type |
| CSavingsParameters | Parameters used to configure savings heuristics |
| CGlobalCheapestInsertionParameters | Parameters used to configure global cheapest insertion heuristics |
| CRoutingIlsReflection | Holder for reflection information generated from ortools/constraint_solver/routing_ils.proto |
| CSpatiallyCloseRoutesRuinStrategy | Ruin strategy that removes a number of spatially close routes |
| CRandomWalkRuinStrategy | Ruin strategy that removes a number of nodes by performing a random walk on the underlying routing solution. More precisely, starting from a randomly selected seed visit, the walk is extended by either moving within the same route or by jumping to a visit served by a different neighboring route. Every active visit encountered along this random walk is made unperformed |
| CSISRRuinStrategy | Ruin strategy based on the "Slack Induction by String Removals for Vehicle
Routing Problems" by Jan Christiaens and Greet Vanden Berghe, Transportation Science 2020 |
| CRuinStrategy | Ruin strategies, used in perturbation based on ruin and recreate approaches |
| CRecreateParameters | Parameters to customize a recreate strategy |
| CRecreateStrategy | Strategy defining how a solution is recreated |
| CRuinCompositionStrategy | The ruin composition strategies specifies how ruin are selected at every ILS iteration |
| CTypes | Container for nested types declared in the RuinCompositionStrategy message type |
| CRuinRecreateParameters | Parameters to configure a perturbation based on a ruin and recreate approach |
| CPerturbationStrategy | Defines how a reference solution is perturbed |
| CTypes | Container for nested types declared in the PerturbationStrategy message type |
| CCoolingScheduleStrategy | The cooling schedule strategy defines how to compute the current simulated annealing temperature t given |
| CTypes | Container for nested types declared in the CoolingScheduleStrategy message type |
| CGreedyDescentAcceptanceStrategy | Acceptance strategy in which only improving solutions are accepted |
| CSimulatedAnnealingAcceptanceStrategy | Acceptance strategy in which solutions are accepted with a probability that depends on its quality and on the current state of the search |
| CAllNodesPerformedAcceptanceStrategy | Acceptance strategy in which a solution is accepted only if all nodes are performed. Disjunctions are respected when several nodes can be performed |
| CMoreNodesPerformedAcceptanceStrategy | Acceptance strategy in which a solution is accepted only if it performs at least one more node than the reference solution |
| CAbsencesBasedAcceptanceStrategy | Acceptance strategy in which a solution is accepted only if it has less absences than the reference solution (see Slack Induction by String Removals for Vehicle Routing Problems" Christiaens and Vanden Berghe, Transportation Science 2020) |
| CAcceptanceStrategy | Determines when a candidate solution replaces another one |
| CIteratedLocalSearchParameters | Specifies the behavior of a search based on ILS |
| CRoutingIndexManager | |
| CRoutingModel | |
| CVehicleTypeContainer | |
| CVehicleClassEntry | |
| CResourceGroup | |
| CAttributes | |
| CResource | |
| CVariableValuePair | |
| CSecondaryOptimizer | |
| CPickupDeliveryPosition | |
| CNodeNeighborsParameters | |
| CNodeNeighborsByCostClass | |
| CRoutingModelVisitor | |
| CRoutingParametersReflection | Holder for reflection information generated from ortools/constraint_solver/routing_parameters.proto |
| CRoutingSearchParameters | Parameters defining the search used to solve vehicle routing problems |
| CTypes | Container for nested types declared in the RoutingSearchParameters message type |
| CLocalSearchNeighborhoodOperators | Local search neighborhood operators used to build a solutions neighborhood. Next ID: 41 |
| CImprovementSearchLimitParameters | Parameters required for the improvement search limit |
| CRoutingModelParameters | Parameters which have to be set when creating a RoutingModel |
| CRoutingSearchStats | |
| CSearchLimit | |
| CSearchLimitReflection | Holder for reflection information generated from ortools/constraint_solver/search_limit.proto |
| CRegularLimitParameters | A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1 |
| CSearchLog | |
| CSearchMonitor | |
| CSearchStatsReflection | Holder for reflection information generated from ortools/constraint_solver/search_stats.proto |
| CLocalSearchStatistics | Statistics on local search |
| CTypes | Container for nested types declared in the LocalSearchStatistics message type |
| CFirstSolutionStatistics | First solution statistics collected during search |
| CLocalSearchOperatorStatistics | Statistics on local search operators called during the search |
| CLocalSearchFilterStatistics | Statistics on local search filters called during the search |
| CConstraintSolverStatistics | Statistics on the search in the constraint solver |
| CSubSolverStatistics | Statistics on sub-solvers |
| CSearchStatistics | Search statistics |
| CSequenceVar | |
| CSequenceVarElement | |
| CSimpleBoundCosts | |
| CSolutionCollector | |
| CSolutionPool | |
| CSolverParametersReflection | Holder for reflection information generated from ortools/constraint_solver/solver_parameters.proto |
| CConstraintSolverParameters | Solver parameters |
| CTypes | Container for nested types declared in the ConstraintSolverParameters message type |
| CSymmetryBreaker | |
| CTypeIncompatibilityChecker | |
| CTypeRegulationsChecker | |
| CTypeRegulationsConstraint | |
| CTypeRequirementChecker | |
| NLinearSolver | |
| CLinearConstraint | |
| CRangeConstraint | |
| CEquality | |
| CVarEquality | |
| CMPConstraintVector | |
| CMPConstraintVectorEnumerator | |
| CLinearExpr | |
| CLinearExprArrayHelper | |
| CProductCst | |
| CSumCst | |
| CVarWrapper | |
| CSum | |
| CSumArray | |
| CSumVarArray | |
| CSolver | |
| CVariable | |
| CMPVariableVector | |
| CMPVariableVectorEnumerator | |
| CConstraint | |
| CDoubleVector | |
| CDoubleVectorEnumerator | |
| CMPSolverParameters | |
| CObjective | |
| Coperations_research_linear_solver | |
| Coperations_research_linear_solverPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| NModelBuilder | |
| CModel | Main modeling class |
| CLinearConstraint | Wrapper around a linear constraint stored in the ModelBuilderHelper instance |
| CEnforcedLinearConstraint | Wrapper around an enforced linear constraint stored in the ModelBuilderHelper instance |
| CTerm | |
| CLinearExpr | Holds a linear expression: sum (ai * xi) + b |
| CLinearExprBuilder | A builder class for linear expressions |
| CVariable | Holds a variable |
| CBoundedLinearExpression | Holds a linear constraint: expression ∈ domain |
| CSolver | Model solver class |
| CDoubleVector | |
| CDoubleVectorEnumerator | |
| CIntVector | |
| CIntVectorEnumerator | |
| CMbLogCallback | |
| CModelBuilderHelper | |
| CModelSolverHelper | |
| Coperations_research_model_builder | |
| Coperations_research_model_builderPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| NSat | |
| CConstraint | Wrapper around a ConstraintProto |
| CCircuitConstraint | Specialized circuit constraint |
| CMultipleCircuitConstraint | Specialized multiple circuit constraint |
| CTableConstraint | Specialized assignment constraint |
| CAutomatonConstraint | Specialized automaton constraint |
| CReservoirConstraint | Specialized reservoir constraint |
| CCumulativeConstraint | Specialized cumulative constraint |
| CNoOverlap2dConstraint | Specialized NoOverlap2D constraint |
| CCpModel | Wrapper class around the cp_model proto |
| CCpSolver | Wrapper around the SAT solver |
| CLogCallbackDelegate | |
| CBestBoundCallbackDelegate | |
| CILiteral | Holds a Boolean variable or its negation |
| CTerm | |
| CLinearExpr | Holds a linear expression: sum (ai * xi) + b |
| CLinearExprBuilder | A builder class for linear expressions |
| CIntVar | Holds a integer variable with a discrete domain |
| CBoolVar | Holds a Boolean variable |
| CNotBoolVar | |
| CBoundedLinearExpression | Holds a linear constraint: expression ∈ domain |
| CIntervalVar | An interval variable |
| CCpSolverSolutionCallback | Parent class to create a callback called at each solution |
| CObjectiveSolutionPrinter | A specialized solution printer |
| CBestBoundCallback | |
| CBooleanProblemReflection | Holder for reflection information generated from ortools/sat/boolean_problem.proto |
| CLinearBooleanConstraint | 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 |
| CLinearObjective | The objective of an optimization problem |
| CBooleanAssignment | Stores an assignment of variables as a list of true literals using their signed representation. There will be at most one literal per variable. The literals will be sorted by increasing variable index. The assignment may be partial in the sense that some variables may not appear and thus not be assigned |
| CLinearBooleanProblem | A linear Boolean problem |
| CCpModelReflection | Holder for reflection information generated from ortools/sat/cp_model.proto |
| CIntegerVariableProto | An integer variable |
| CBoolArgumentProto | Argument of the constraints of the form OP(literals) |
| CLinearExpressionProto | Some constraints supports linear expression instead of just using a reference to a variable. This is especially useful during presolve to reduce the model size |
| CLinearArgumentProto | |
| CAllDifferentConstraintProto | All expressions must take different values |
| CLinearConstraintProto | The linear sum vars[i] * coeffs[i] must fall in the given domain. The domain has the same format as the one in IntegerVariableProto |
| CElementConstraintProto | The constraint linear_target = exprs[linear_index]. This enforces that index takes one of the value in [0, vars_size()) |
| CIntervalConstraintProto | This is not really a constraint. It is there so it can be referred by other constraints using this "interval" concept |
| CNoOverlapConstraintProto | All the intervals (index of IntervalConstraintProto) must be disjoint. More formally, there must exist a sequence so that for each consecutive intervals, we have end_i <= start_{i+1}. In particular, intervals of size zero do matter for this constraint. This is also known as a disjunctive constraint in scheduling |
| CNoOverlap2DConstraintProto | The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap. Furthermore, one box is optional if at least one of the x or y interval is optional |
| CCumulativeConstraintProto | The sum of the demands of the intervals at each interval point cannot exceed a capacity. Note that intervals are interpreted as [start, end) and as such intervals like [2,3) and [3,4) do not overlap for the point of view of this constraint. Moreover, intervals of size zero are ignored |
| CReservoirConstraintProto | Maintain a reservoir level within bounds. The water level starts at 0, and at any time, it must be within [min_level, max_level] |
| CCircuitConstraintProto | The circuit constraint is defined on a graph where the arc presence are controlled by literals. Each arc is given by an index in the tails/heads/literals lists that must have the same size |
| CRoutesConstraintProto | The "VRP" (Vehicle Routing Problem) constraint |
| CTypes | Container for nested types declared in the RoutesConstraintProto message type |
| CNodeExpressions | A set of linear expressions associated with the nodes |
| CTableConstraintProto | The values of the n-tuple formed by the given expression can only be one of the listed n-tuples in values. The n-tuples are encoded in a flattened way: [tuple0_v0, tuple0_v1, ..., tuple0_v{n-1}, tuple1_v0, ...]. Corner cases: |
| CInverseConstraintProto | 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 |
| CAutomatonConstraintProto | This constraint forces a sequence of expressions to be accepted by an automaton |
| CListOfVariablesProto | A list of variables, without any semantics |
| CConstraintProto | Next id: 31 |
| CCpObjectiveProto | Optimization objective |
| CFloatObjectiveProto | A linear floating point objective: sum coeffs[i] * vars[i] + offset |
| CDecisionStrategyProto | Define the strategy to follow when the solver needs to take a new decision |
| CTypes | Container for nested types declared in the DecisionStrategyProto message type |
| CPartialVariableAssignment | This message encodes a partial (or full) assignment of the variables of a CpModelProto. The variable indices should be unique and valid variable indices |
| CSparsePermutationProto | A permutation of integers encoded as a list of cycles, hence the "sparse" format. The image of an element cycle[i] is cycle[(i + 1) % cycle_length] |
| CDenseMatrixProto | A dense matrix of numbers encoded in a flat way, row by row. That is matrix[i][j] = entries[i * num_cols + j]; |
| CSymmetryProto | EXPERIMENTAL. For now, this is meant to be used by the solver and not filled by clients |
| CCpModelProto | A constraint programming problem |
| CCpSolverSolution | Just a message used to store dense solution. This is used by the additional_solutions field |
| CCpSolverResponse | The response returned by a solver trying to solve a CpModelProto |
| CCpModelServiceReflection | Holder for reflection information generated from ortools/sat/cp_model_service.proto |
| CCpSolverRequest | The request sent to the remote solve service |
| CCpSatHelper | |
| CLogCallback | |
| Coperations_research_sat | |
| Coperations_research_satPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| CRoutesSupportGraphReflection | Holder for reflection information generated from ortools/sat/routes_support_graph.proto |
| CArcLpValue | An arc of a routes constraint, with its LP value |
| CRoutesSupportGraphProto | The arcs of a routes constraint which have non-zero LP values, in the LP relaxation of the problem |
| CSatParametersReflection | Holder for reflection information generated from ortools/sat/sat_parameters.proto |
| CSatParameters | Contains the definitions for all the sat algorithm parameters and their default values |
| CTypes | Container for nested types declared in the SatParameters message type |
| CSolutionCallback | |
| CSolveWrapper | |
| NAlgorithms | |
| CInt64Matrix | |
| CInt64MatrixEnumerator | |
| CInt64Vector | |
| CInt64VectorEnumerator | |
| CKnapsackSolver | |
| Coperations_research_algorithms | |
| Coperations_research_algorithmsPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| NBop | |
| CBopParametersReflection | Holder for reflection information generated from ortools/bop/bop_parameters.proto |
| CBopOptimizerMethod | Method used to optimize a solution in Bop |
| CTypes | Container for nested types declared in the BopOptimizerMethod message type |
| CBopSolverOptimizerSet | Set of optimizer methods to be run by an instance of the portfolio optimizer |
| CBopParameters | Contains the definitions for all the bop algorithm parameters and their default values |
| CTypes | Container for nested types declared in the BopParameters message type |
| NGlop | |
| CParametersReflection | Holder for reflection information generated from ortools/glop/parameters.proto |
| CGlopParameters | Next id = 73 |
| CTypes | Container for nested types declared in the GlopParameters message type |
| NGraph | |
| CFlowProblemReflection | Holder for reflection information generated from ortools/graph/flow_problem.proto |
| CFlowArcProto | |
| CFlowNodeProto | |
| CFlowModelProto | Holds a flow problem, see NodeProto and ArcProto for more details |
| CTypes | Container for nested types declared in the FlowModelProto message type |
| CLinearSumAssignment | |
| CMaxFlow | |
| CMinCostFlow | |
| CMinCostFlowBase | |
| Coperations_research_graph | |
| Coperations_research_graphPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| NInit | |
| CCppBridge | |
| CCppFlags | |
| Coperations_research_init | |
| Coperations_research_initPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| COrToolsVersion | |
| NPDLP | |
| CSolveLogReflection | Holder for reflection information generated from ortools/pdlp/solve_log.proto |
| CQuadraticProgramStats | Easy-to-compute statistics for the quadratic program |
| CConvergenceInformation | Information measuring how close a candidate is to establishing feasibility and optimality; see also TerminationCriteria |
| CInfeasibilityInformation | Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria |
| CPointMetadata | |
| CIterationStats | All values in IterationStats assume that the primal quadratic program is a minimization problem and the dual is a maximization problem. Problems should be transformed to this form if they are not already in this form. The dual vector is defined to be the vector of multipliers on the linear constraints, that is, excluding dual multipliers on variable bounds (reduced costs) |
| CFeasibilityPolishingDetails | Details about one primal feasibility or dual feasibility polishing phase within a solve with use_feasibility_polishing. See SolveLog for descriptions of the fields with the same name |
| CSolveLog | |
| CSolversReflection | Holder for reflection information generated from ortools/pdlp/solvers.proto |
| CTerminationCriteria | Relevant readings on infeasibility certificates: (1) https://docs.mosek.com/modeling-cookbook/qcqo.html provides references explaining why the primal rays imply dual infeasibility and dual rays imply primal infeasibility. (2) The termination criteria for Mosek's linear programming optimizer https://docs.mosek.com/9.0/pythonfusion/solving-linear.html. (3) The termination criteria for OSQP is in section 3.3 of https://web.stanford.edu/~boyd/papers/pdf/osqp.pdf. (4) The termination criteria for SCS is in section 3.5 of https://arxiv.org/pdf/1312.3039.pdf |
| CTypes | Container for nested types declared in the TerminationCriteria message type |
| CSimpleOptimalityCriteria | |
| CDetailedOptimalityCriteria | |
| CAdaptiveLinesearchParams | At the end of each iteration, regardless of whether the step was accepted or not, the adaptive rule updates the step_size as the minimum of two potential step sizes defined by the following two exponents |
| CMalitskyPockParams | |
| CPrimalDualHybridGradientParams | Parameters for PrimalDualHybridGradient() in primal_dual_hybrid_gradient.h. While the defaults are generally good, it is usually worthwhile to perform a parameter sweep to find good settings for a particular family of problems. The following parameters should be considered for tuning: |
| CTypes | Container for nested types declared in the PrimalDualHybridGradientParams message type |
| CPresolveOptions | |
| NUtil | |
| CDomain | |
| CInt128Reflection | Holder for reflection information generated from ortools/util/int128.proto |
| CInt128 | The low 64 bits are stored in "low", and the high 64-bits (including the sign) are stored in "high" |
| CInt64Vector | |
| CInt64VectorEnumerator | |
| CInt64VectorVector | |
| CInt64VectorVectorEnumerator | |
| Coperations_research_util | |
| Coperations_research_utilPINVOKE | |
| CSWIGExceptionHelper | |
| CSWIGPendingException | |
| CSWIGStringHelper | |
| CSWIGStringWithLengthHelper | |
| COptionalBooleanReflection | Holder for reflection information generated from ortools/util/optional_boolean.proto |
| CNestedArrayHelper | |
| CProtoHelper | |
| NOperationsResearch | |
| NSat | |
| CLratReflection | Holder for reflection information generated from ortools/sat/lrat.proto |
| CLratImportedClause | A clause imported from the input problem, or from another worker |
| CLratInferredClause | An LRAT inferred clause |
| CTypes | Container for nested types declared in the LratInferredClause message type |
| CRatInfo | If rat_infos is empty, the last unit_ids clause must become empty after unit propagation. If the last unit_ids clause does not become empty by unit propagation, then rat_infos must contain all the clauses which contain the negation of the first literals (called the pivot 'p') – and no other clauses. Moreover, for each r in rat_infos, all the r.unit_ids clauses must become unit and eventually empty if all the literals of the r.resolvant_id clause (minus ~p), plus those in literals, are assumed to be false (this list must be in unit propagation order; verification stops at the first empty clause). See LratChecker for more details |
| CLratExportedClause | A clause to export, so that it can be imported from any worker. This is not needed for unary and binary clauses, which are always exported |
| CLratDeletedClauses | A list of clauses to delete |
| CLratProofStep | An LRAT UNSAT proof is a sequence of steps, starting from imported clauses and ending with the empty clause. At each step new clauses can be inferred from previous ones (with an explicit proof), or imported from another proof built by another thread. A proof step can also delete clauses which are no longer needed, or export a clause for other workers to import. Each clause is identified by a unique clause ID |
| CLinearSolverReflection | Holder for reflection information generated from ortools/linear_solver/linear_solver.proto |
| CMPVariableProto | A variable is always constrained in the form: lower_bound <= x <= upper_bound where lower_bound and upper_bound: |
| CMPConstraintProto | A linear constraint is always of the form: lower_bound <= sum of linear term elements <= upper_bound, where lower_bound and upper_bound: |
| CMPGeneralConstraintProto | General constraints. See each individual proto type for more information |
| CMPIndicatorConstraint | Indicator constraints encode the activation or deactivation of linear constraints given the value of one Boolean variable in the model. For example: y = 0 => 2 * x1 + 3 * x2 >= 42 The 2 * x1 + 3 * x2 >= 42 constraint is only active if the variable y is equal to 0. As of 2019/04, only SCIP, CP-SAT and Gurobi support this constraint type |
| CMPSosConstraint | Special Ordered Set (SOS) constraints of type 1 or 2. See https://en.wikipedia.org/wiki/Special_ordered_set As of 2019/04, only SCIP and Gurobi support this constraint type |
| CTypes | Container for nested types declared in the MPSosConstraint message type |
| CMPQuadraticConstraint | Quadratic constraints of the form lb <= sum a_i x_i + sum b_ij x_i x_j <= ub, where a, b, lb and ub are constants, and x are the model's variables. Quadratic matrices that are Positive Semi-Definite, Second-Order Cones or rotated Second-Order Cones are always accepted. Other forms may or may not be accepted depending on the underlying solver used. See https://scip.zib.de/doc/html/cons__quadratic_8h.php and https://www.gurobi.com/documentation/9.0/refman/constraints.html#subsubsection:QuadraticConstraints |
| CMPAbsConstraint | Sets a variable's value to the absolute value of another variable |
| CMPArrayConstraint | Sets a variable's value equal to a function on a set of variables |
| CMPArrayWithConstantConstraint | Sets a variable's value equal to a function on a set of variables and, optionally, a constant |
| CMPQuadraticObjective | Quadratic part of a model's objective. Added with other objectives (such as linear), this creates the model's objective function to be optimized |
| CPartialVariableAssignment | This message encodes a partial (or full) assignment of the variables of a MPModelProto problem. The indices in var_index should be unique and valid variable indices of the associated problem |
| CMPModelProto | MPModelProto contains all the information for a Linear Programming model |
| CTypes | Container for nested types declared in the MPModelProto message type |
| CAnnotation | Annotations can be freely added by users who want to attach arbitrary payload to the model's variables or constraints |
| CTypes | Container for nested types declared in the Annotation message type |
| COptionalDouble | To support 'unspecified' double value in proto3, the simplest is to wrap any double value in a nested message (has_XXX works for message fields) |
| CMPSolverCommonParameters | MPSolverCommonParameters holds advanced usage parameters that apply to any of the solvers we support. All of the fields in this proto can have a value of unspecified. In this case each inner solver will use their own safe defaults. Some values won't be supported by some solvers. The behavior in that case is not defined yet |
| CTypes | Container for nested types declared in the MPSolverCommonParameters message type |
| CMPModelDeltaProto | Encodes a full MPModelProto by way of referencing to a "baseline" MPModelProto stored in a file, and a "delta" to apply to this model |
| CMPModelRequest | Next id: 18 |
| CTypes | Container for nested types declared in the MPModelRequest message type |
| CMPSolution | |
| CMPSolveInfo | |
| CMPSolutionResponse | Next id: 12 |
| CSolutionCounter | |
| CSolutionDivisionCounter | |
| CSolutionModuloCounter | |