| CGoogle.OrTools.Sat.BooleanProblemReflection | Holder for reflection information generated from ortools/sat/boolean_problem.proto |
| CGoogle.OrTools.Bop.BopParametersReflection | Holder for reflection information generated from ortools/bop/bop_parameters.proto |
| CGoogle.OrTools.Tests.BoundCostTest | |
| CGoogle.OrTools.ModelBuilder.BoundedLinearExpression | Holds a linear constraint: expression ∈ domain |
| CGoogle.OrTools.Sat.BoundedLinearExpression | Holds a linear constraint: expression ∈ domain |
| ►CGoogle.OrTools.Sat.Constraint | Wrapper around a ConstraintProto |
| CGoogle.OrTools.Sat.AutomatonConstraint | Specialized automaton constraint |
| CGoogle.OrTools.Sat.CircuitConstraint | Specialized circuit constraint |
| CGoogle.OrTools.Sat.CumulativeConstraint | Specialized cumulative constraint |
| CGoogle.OrTools.Sat.MultipleCircuitConstraint | Specialized multiple circuit constraint |
| CGoogle.OrTools.Sat.NoOverlap2dConstraint | Specialized NoOverlap2D constraint |
| CGoogle.OrTools.Sat.ReservoirConstraint | Specialized reservoir constraint |
| CGoogle.OrTools.Sat.TableConstraint | Specialized assignment constraint |
| CGoogle.OrTools.Tests.ConstraintSolverTest | |
| CGoogle.OrTools.Sat.CpModel | Wrapper class around the cp_model proto |
| CGoogle.OrTools.Sat.CpModelReflection | Holder for reflection information generated from ortools/sat/cp_model.proto |
| CGoogle.OrTools.Sat.CpModelServiceReflection | Holder for reflection information generated from ortools/sat/cp_model_service.proto |
| CGoogle.OrTools.Sat.CpSolver | Wrapper around the SAT solver |
| CGoogle.OrTools.ModelBuilder.EnforcedLinearConstraint | Wrapper around an enforced linear constraint stored in the ModelBuilderHelper instance |
| CGoogle.OrTools.Graph.FlowProblemReflection | Holder for reflection information generated from ortools/graph/flow_problem.proto |
| CGoogle.OrTools.Tests.FlowTest | |
| ►Cpb.IBufferMessage | |
| CGoogle.OrTools.Bop.BopOptimizerMethod | Method used to optimize a solution in Bop |
| CGoogle.OrTools.Bop.BopParameters | Contains the definitions for all the bop algorithm parameters and their default values |
| CGoogle.OrTools.Bop.BopSolverOptimizerSet | Set of optimizer methods to be run by an instance of the portfolio optimizer |
| CGoogle.OrTools.ConstraintSolver.ConstraintSolverParameters | Solver parameters |
| CGoogle.OrTools.ConstraintSolver.ConstraintSolverStatistics | Statistics on the search in the constraint solver |
| CGoogle.OrTools.ConstraintSolver.FirstSolutionStrategy | First solution strategies, used as starting point of local search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchMetaheuristic | Local search metaheuristics used to guide the search. Apart from greedy descent, they will try to escape local minima |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics | Statistics on local search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.FirstSolutionStatistics | First solution statistics collected during search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.LocalSearchFilterStatistics | Statistics on local search filters called during the search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.LocalSearchOperatorStatistics | Statistics on local search operators called during the search |
| CGoogle.OrTools.ConstraintSolver.RegularLimitParameters | A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1 |
| CGoogle.OrTools.ConstraintSolver.RoutingModelParameters | Parameters which have to be set when creating a RoutingModel |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters | Parameters defining the search used to solve vehicle routing problems |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters.Types.ImprovementSearchLimitParameters | Parameters required for the improvement search limit |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters.Types.LocalSearchNeighborhoodOperators | Local search neighborhood operators used to build a solutions neighborhood. Next ID: 35 |
| CGoogle.OrTools.ConstraintSolver.SearchStatistics | Search statistics |
| CGoogle.OrTools.Glop.GlopParameters | Next id = 72 |
| CGoogle.OrTools.Graph.FlowArcProto | |
| CGoogle.OrTools.Graph.FlowModelProto | Holds a flow problem, see NodeProto and ArcProto for more details |
| CGoogle.OrTools.Graph.FlowNodeProto | |
| CGoogle.OrTools.PDLP.AdaptiveLinesearchParams | 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 |
| CGoogle.OrTools.PDLP.ConvergenceInformation | Information measuring how close a candidate is to establishing feasibility and optimality; see also TerminationCriteria |
| CGoogle.OrTools.PDLP.FeasibilityPolishingDetails | 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 |
| CGoogle.OrTools.PDLP.InfeasibilityInformation | Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria |
| CGoogle.OrTools.PDLP.IterationStats | 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) |
| CGoogle.OrTools.PDLP.MalitskyPockParams | |
| CGoogle.OrTools.PDLP.PointMetadata | |
| CGoogle.OrTools.PDLP.PrimalDualHybridGradientParams | 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: |
| CGoogle.OrTools.PDLP.PrimalDualHybridGradientParams.Types.PresolveOptions | |
| CGoogle.OrTools.PDLP.QuadraticProgramStats | Easy-to-compute statistics for the quadratic program |
| CGoogle.OrTools.PDLP.SolveLog | |
| CGoogle.OrTools.PDLP.TerminationCriteria | 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 |
| CGoogle.OrTools.PDLP.TerminationCriteria.Types.DetailedOptimalityCriteria | |
| CGoogle.OrTools.PDLP.TerminationCriteria.Types.SimpleOptimalityCriteria | |
| CGoogle.OrTools.Sat.AllDifferentConstraintProto | All affine expressions must take different values |
| CGoogle.OrTools.Sat.AutomatonConstraintProto | This constraint forces a sequence of variables to be accepted by an automaton |
| CGoogle.OrTools.Sat.BoolArgumentProto | Argument of the constraints of the form OP(literals) |
| CGoogle.OrTools.Sat.BooleanAssignment | 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 |
| CGoogle.OrTools.Sat.CircuitConstraintProto | 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 |
| CGoogle.OrTools.Sat.ConstraintProto | Next id: 31 |
| CGoogle.OrTools.Sat.CpModelProto | A constraint programming problem |
| CGoogle.OrTools.Sat.CpObjectiveProto | Optimization objective |
| CGoogle.OrTools.Sat.CpSolverRequest | The request sent to the remote solve service |
| CGoogle.OrTools.Sat.CpSolverResponse | The response returned by a solver trying to solve a CpModelProto |
| CGoogle.OrTools.Sat.CpSolverSolution | Just a message used to store dense solution. This is used by the additional_solutions field |
| CGoogle.OrTools.Sat.CumulativeConstraintProto | 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 |
| CGoogle.OrTools.Sat.DecisionStrategyProto | Define the strategy to follow when the solver needs to take a new decision |
| CGoogle.OrTools.Sat.DenseMatrixProto | A dense matrix of numbers encoded in a flat way, row by row. That is matrix[i][j] = entries[i * num_cols + j]; |
| CGoogle.OrTools.Sat.ElementConstraintProto | The constraint target = vars[index]. This enforces that index takes one of the value in [0, vars_size()) |
| CGoogle.OrTools.Sat.FloatObjectiveProto | A linear floating point objective: sum coeffs[i] * vars[i] + offset |
| CGoogle.OrTools.Sat.IntegerVariableProto | An integer variable |
| CGoogle.OrTools.Sat.IntervalConstraintProto | This is not really a constraint. It is there so it can be referred by other constraints using this "interval" concept |
| CGoogle.OrTools.Sat.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 |
| CGoogle.OrTools.Sat.LinearArgumentProto | |
| CGoogle.OrTools.Sat.LinearBooleanConstraint | 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 |
| CGoogle.OrTools.Sat.LinearBooleanProblem | A linear Boolean problem |
| CGoogle.OrTools.Sat.LinearConstraintProto | The linear sum vars[i] * coeffs[i] must fall in the given domain. The domain has the same format as the one in IntegerVariableProto |
| CGoogle.OrTools.Sat.LinearExpressionProto | 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 |
| CGoogle.OrTools.Sat.LinearObjective | The objective of an optimization problem |
| CGoogle.OrTools.Sat.ListOfVariablesProto | A list of variables, without any semantics |
| CGoogle.OrTools.Sat.NoOverlap2DConstraintProto | 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 |
| CGoogle.OrTools.Sat.NoOverlapConstraintProto | 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 |
| CGoogle.OrTools.Sat.PartialVariableAssignment | This message encodes a partial (or full) assignment of the variables of a CpModelProto. The variable indices should be unique and valid variable indices |
| CGoogle.OrTools.Sat.ReservoirConstraintProto | Maintain a reservoir level within bounds. The water level starts at 0, and at any time, it must be within [min_level, max_level] |
| CGoogle.OrTools.Sat.RoutesConstraintProto | The "VRP" (Vehicle Routing Problem) constraint |
| CGoogle.OrTools.Sat.SatParameters | Contains the definitions for all the sat algorithm parameters and their default values |
| CGoogle.OrTools.Sat.SparsePermutationProto | 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] |
| CGoogle.OrTools.Sat.SymmetryProto | EXPERIMENTAL. For now, this is meant to be used by the solver and not filled by clients |
| CGoogle.OrTools.Sat.TableConstraintProto | The values of the n-tuple formed by the given variables 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, ...] |
| CGoogle.OrTools.Util.Int128 | The low 64 bits are stored in "low", and the high 64-bits (including the sign) are stored in "high" |
| COperationsResearch.AcceptanceStrategy | Determines when a neighbor solution, obtained by the application of a perturbation and improvement step to a reference solution, is used to replace the reference solution |
| COperationsResearch.IteratedLocalSearchParameters | Specifies the behavior of a search based on ILS |
| COperationsResearch.MPAbsConstraint | Sets a variable's value to the absolute value of another variable |
| COperationsResearch.MPArrayConstraint | Sets a variable's value equal to a function on a set of variables |
| COperationsResearch.MPArrayWithConstantConstraint | Sets a variable's value equal to a function on a set of variables and, optionally, a constant |
| COperationsResearch.MPConstraintProto | A linear constraint is always of the form: lower_bound <= sum of linear term elements <= upper_bound, where lower_bound and upper_bound: |
| COperationsResearch.MPGeneralConstraintProto | General constraints. See each individual proto type for more information |
| COperationsResearch.MPIndicatorConstraint | 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 |
| COperationsResearch.MPModelDeltaProto | Encodes a full MPModelProto by way of referencing to a "baseline" MPModelProto stored in a file, and a "delta" to apply to this model |
| COperationsResearch.MPModelProto | MPModelProto contains all the information for a Linear Programming model |
| COperationsResearch.MPModelProto.Types.Annotation | Annotations can be freely added by users who want to attach arbitrary payload to the model's variables or constraints |
| COperationsResearch.MPModelRequest | Next id: 18 |
| COperationsResearch.MPQuadraticConstraint | 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 |
| COperationsResearch.MPQuadraticObjective | Quadratic part of a model's objective. Added with other objectives (such as linear), this creates the model's objective function to be optimized |
| COperationsResearch.MPSolution | |
| COperationsResearch.MPSolutionResponse | Next id: 12 |
| COperationsResearch.MPSolveInfo | |
| COperationsResearch.MPSolverCommonParameters | 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 |
| COperationsResearch.MPSosConstraint | 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 |
| COperationsResearch.MPVariableProto | A variable is always constrained in the form: lower_bound <= x <= upper_bound where lower_bound and upper_bound: |
| COperationsResearch.OptionalDouble | 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) |
| COperationsResearch.PartialVariableAssignment | 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 |
| COperationsResearch.PerturbationStrategy | Defines how a reference solution is perturbed |
| COperationsResearch.RuinRecreateParameters | Parameters to configure a perturbation based on a ruin and recreate approach |
| COperationsResearch.RuinStrategy | Ruin strategies, used in perturbation based on ruin and recreate approaches |
| COperationsResearch.SetCoverProto | |
| COperationsResearch.SetCoverProto.Types.Subset | |
| COperationsResearch.SetCoverSolutionResponse | |
| ►CGoogle.OrTools.ConstraintSolver.IConstraintWithStatus | |
| ►CGoogle.OrTools.ConstraintSolver.BaseEquality | |
| CGoogle.OrTools.ConstraintSolver.ConstraintEquality | |
| CGoogle.OrTools.ConstraintSolver.IntExprEquality | |
| CGoogle.OrTools.ConstraintSolver.WrappedConstraint | |
| ►CGoogle.OrTools.ConstraintSolver.Constraint | |
| CGoogle.OrTools.ConstraintSolver.CastConstraint | |
| CGoogle.OrTools.ConstraintSolver.DisjunctiveConstraint | |
| CGoogle.OrTools.ConstraintSolver.GlobalVehicleBreaksConstraint | |
| CGoogle.OrTools.ConstraintSolver.NetConstraint | |
| CGoogle.OrTools.ConstraintSolver.Pack | |
| CGoogle.OrTools.ConstraintSolver.TypeRegulationsConstraint | |
| CGoogle.OrTools.ConstraintSolver.Constraint | |
| ►CIDisposable | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.Solver | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| ►Cglobal.SystemCollections.Generic.IEnumerable | |
| CGoogle.OrTools.Algorithms.Int64Matrix | |
| CGoogle.OrTools.ConstraintSolver.Int64VectorVector | |
| CGoogle.OrTools.ConstraintSolver.IntVectorVector | |
| CGoogle.OrTools.Util.Int64VectorVector | |
| ►Cglobal.SystemCollections.IEnumerable | |
| CGoogle.OrTools.Algorithms.Int64Matrix | |
| CGoogle.OrTools.Algorithms.Int64Vector | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.Int64Vector | |
| CGoogle.OrTools.ConstraintSolver.Int64VectorVector | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntVector | |
| CGoogle.OrTools.ConstraintSolver.IntVectorVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| CGoogle.OrTools.LinearSolver.DoubleVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| CGoogle.OrTools.ModelBuilder.DoubleVector | |
| CGoogle.OrTools.ModelBuilder.IntVector | |
| CGoogle.OrTools.Util.Int64Vector | |
| CGoogle.OrTools.Util.Int64VectorVector | |
| ►CSystem.Collections.IEnumerable | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.IntVarIterator | |
| CGoogle.OrTools.ConstraintSolver.IntVarIterator | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| ►Cglobal.SystemCollections.Generic.IEnumerator | |
| CGoogle.OrTools.Algorithms.Int64Matrix.Int64MatrixEnumerator | |
| CGoogle.OrTools.Algorithms.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector.DecisionBuilderVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.Int64VectorVector.Int64VectorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector.IntVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVector.IntVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVectorVector.IntVectorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector.IntervalVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector.LocalSearchFilterVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector.LocalSearchOperatorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector.SearchMonitorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector.SequenceVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector.SymmetryBreakerVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.DoubleVector.DoubleVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector.MPConstraintVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.MPVariableVector.MPVariableVectorEnumerator | |
| CGoogle.OrTools.ModelBuilder.DoubleVector.DoubleVectorEnumerator | |
| CGoogle.OrTools.ModelBuilder.IntVector.IntVectorEnumerator | |
| CGoogle.OrTools.Util.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.Util.Int64VectorVector.Int64VectorVectorEnumerator | |
| ►Cglobal.SystemCollections.IEnumerator | |
| CGoogle.OrTools.Algorithms.Int64Matrix.Int64MatrixEnumerator | |
| CGoogle.OrTools.Algorithms.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector.DecisionBuilderVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.Int64VectorVector.Int64VectorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector.IntVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVector.IntVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVectorVector.IntVectorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector.IntervalVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector.LocalSearchFilterVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector.LocalSearchOperatorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector.SearchMonitorVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector.SequenceVarVectorEnumerator | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector.SymmetryBreakerVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.DoubleVector.DoubleVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector.MPConstraintVectorEnumerator | |
| CGoogle.OrTools.LinearSolver.MPVariableVector.MPVariableVectorEnumerator | |
| CGoogle.OrTools.ModelBuilder.DoubleVector.DoubleVectorEnumerator | |
| CGoogle.OrTools.ModelBuilder.IntVector.IntVectorEnumerator | |
| CGoogle.OrTools.Util.Int64Vector.Int64VectorEnumerator | |
| CGoogle.OrTools.Util.Int64VectorVector.Int64VectorVectorEnumerator | |
| ►CIEnumerator | |
| CGoogle.OrTools.ConstraintSolver.IntVarEnumerator | |
| ►Cglobal.SystemCollections.Generic.IList | |
| CGoogle.OrTools.Algorithms.Int64Vector | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.Int64Vector | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| CGoogle.OrTools.LinearSolver.DoubleVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| CGoogle.OrTools.ModelBuilder.DoubleVector | |
| CGoogle.OrTools.ModelBuilder.IntVector | |
| CGoogle.OrTools.Util.Int64Vector | |
| ►CSystem.Collections.Generic.IList | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| ►CGoogle.OrTools.Sat.ILiteral | Holds a Boolean variable or its negation |
| CGoogle.OrTools.Sat.BoolVar | Holds a Boolean variable |
| CGoogle.OrTools.Sat.NotBoolVar | |
| ►Cpb.IMessage | |
| CGoogle.OrTools.Bop.BopOptimizerMethod | Method used to optimize a solution in Bop |
| CGoogle.OrTools.Bop.BopParameters | Contains the definitions for all the bop algorithm parameters and their default values |
| CGoogle.OrTools.Bop.BopSolverOptimizerSet | Set of optimizer methods to be run by an instance of the portfolio optimizer |
| CGoogle.OrTools.ConstraintSolver.ConstraintSolverParameters | Solver parameters |
| CGoogle.OrTools.ConstraintSolver.ConstraintSolverStatistics | Statistics on the search in the constraint solver |
| CGoogle.OrTools.ConstraintSolver.FirstSolutionStrategy | First solution strategies, used as starting point of local search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchMetaheuristic | Local search metaheuristics used to guide the search. Apart from greedy descent, they will try to escape local minima |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics | Statistics on local search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.FirstSolutionStatistics | First solution statistics collected during search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.LocalSearchFilterStatistics | Statistics on local search filters called during the search |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types.LocalSearchOperatorStatistics | Statistics on local search operators called during the search |
| CGoogle.OrTools.ConstraintSolver.RegularLimitParameters | A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1 |
| CGoogle.OrTools.ConstraintSolver.RoutingModelParameters | Parameters which have to be set when creating a RoutingModel |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters | Parameters defining the search used to solve vehicle routing problems |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters.Types.ImprovementSearchLimitParameters | Parameters required for the improvement search limit |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters.Types.LocalSearchNeighborhoodOperators | Local search neighborhood operators used to build a solutions neighborhood. Next ID: 35 |
| CGoogle.OrTools.ConstraintSolver.SearchStatistics | Search statistics |
| CGoogle.OrTools.Glop.GlopParameters | Next id = 72 |
| CGoogle.OrTools.Graph.FlowArcProto | |
| CGoogle.OrTools.Graph.FlowModelProto | Holds a flow problem, see NodeProto and ArcProto for more details |
| CGoogle.OrTools.Graph.FlowNodeProto | |
| CGoogle.OrTools.PDLP.AdaptiveLinesearchParams | 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 |
| CGoogle.OrTools.PDLP.ConvergenceInformation | Information measuring how close a candidate is to establishing feasibility and optimality; see also TerminationCriteria |
| CGoogle.OrTools.PDLP.FeasibilityPolishingDetails | 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 |
| CGoogle.OrTools.PDLP.InfeasibilityInformation | Information measuring how close a point is to establishing primal or dual infeasibility (i.e. has no solution); see also TerminationCriteria |
| CGoogle.OrTools.PDLP.IterationStats | 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) |
| CGoogle.OrTools.PDLP.MalitskyPockParams | |
| CGoogle.OrTools.PDLP.PointMetadata | |
| CGoogle.OrTools.PDLP.PrimalDualHybridGradientParams | 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: |
| CGoogle.OrTools.PDLP.PrimalDualHybridGradientParams.Types.PresolveOptions | |
| CGoogle.OrTools.PDLP.QuadraticProgramStats | Easy-to-compute statistics for the quadratic program |
| CGoogle.OrTools.PDLP.SolveLog | |
| CGoogle.OrTools.PDLP.TerminationCriteria | 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 |
| CGoogle.OrTools.PDLP.TerminationCriteria.Types.DetailedOptimalityCriteria | |
| CGoogle.OrTools.PDLP.TerminationCriteria.Types.SimpleOptimalityCriteria | |
| CGoogle.OrTools.Sat.AllDifferentConstraintProto | All affine expressions must take different values |
| CGoogle.OrTools.Sat.AutomatonConstraintProto | This constraint forces a sequence of variables to be accepted by an automaton |
| CGoogle.OrTools.Sat.BoolArgumentProto | Argument of the constraints of the form OP(literals) |
| CGoogle.OrTools.Sat.BooleanAssignment | 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 |
| CGoogle.OrTools.Sat.CircuitConstraintProto | 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 |
| CGoogle.OrTools.Sat.ConstraintProto | Next id: 31 |
| CGoogle.OrTools.Sat.CpModelProto | A constraint programming problem |
| CGoogle.OrTools.Sat.CpObjectiveProto | Optimization objective |
| CGoogle.OrTools.Sat.CpSolverRequest | The request sent to the remote solve service |
| CGoogle.OrTools.Sat.CpSolverResponse | The response returned by a solver trying to solve a CpModelProto |
| CGoogle.OrTools.Sat.CpSolverSolution | Just a message used to store dense solution. This is used by the additional_solutions field |
| CGoogle.OrTools.Sat.CumulativeConstraintProto | 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 |
| CGoogle.OrTools.Sat.DecisionStrategyProto | Define the strategy to follow when the solver needs to take a new decision |
| CGoogle.OrTools.Sat.DenseMatrixProto | A dense matrix of numbers encoded in a flat way, row by row. That is matrix[i][j] = entries[i * num_cols + j]; |
| CGoogle.OrTools.Sat.ElementConstraintProto | The constraint target = vars[index]. This enforces that index takes one of the value in [0, vars_size()) |
| CGoogle.OrTools.Sat.FloatObjectiveProto | A linear floating point objective: sum coeffs[i] * vars[i] + offset |
| CGoogle.OrTools.Sat.IntegerVariableProto | An integer variable |
| CGoogle.OrTools.Sat.IntervalConstraintProto | This is not really a constraint. It is there so it can be referred by other constraints using this "interval" concept |
| CGoogle.OrTools.Sat.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 |
| CGoogle.OrTools.Sat.LinearArgumentProto | |
| CGoogle.OrTools.Sat.LinearBooleanConstraint | 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 |
| CGoogle.OrTools.Sat.LinearBooleanProblem | A linear Boolean problem |
| CGoogle.OrTools.Sat.LinearConstraintProto | The linear sum vars[i] * coeffs[i] must fall in the given domain. The domain has the same format as the one in IntegerVariableProto |
| CGoogle.OrTools.Sat.LinearExpressionProto | 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 |
| CGoogle.OrTools.Sat.LinearObjective | The objective of an optimization problem |
| CGoogle.OrTools.Sat.ListOfVariablesProto | A list of variables, without any semantics |
| CGoogle.OrTools.Sat.NoOverlap2DConstraintProto | 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 |
| CGoogle.OrTools.Sat.NoOverlapConstraintProto | 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 |
| CGoogle.OrTools.Sat.PartialVariableAssignment | This message encodes a partial (or full) assignment of the variables of a CpModelProto. The variable indices should be unique and valid variable indices |
| CGoogle.OrTools.Sat.ReservoirConstraintProto | Maintain a reservoir level within bounds. The water level starts at 0, and at any time, it must be within [min_level, max_level] |
| CGoogle.OrTools.Sat.RoutesConstraintProto | The "VRP" (Vehicle Routing Problem) constraint |
| CGoogle.OrTools.Sat.SatParameters | Contains the definitions for all the sat algorithm parameters and their default values |
| CGoogle.OrTools.Sat.SparsePermutationProto | 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] |
| CGoogle.OrTools.Sat.SymmetryProto | EXPERIMENTAL. For now, this is meant to be used by the solver and not filled by clients |
| CGoogle.OrTools.Sat.TableConstraintProto | The values of the n-tuple formed by the given variables 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, ...] |
| CGoogle.OrTools.Util.Int128 | The low 64 bits are stored in "low", and the high 64-bits (including the sign) are stored in "high" |
| COperationsResearch.AcceptanceStrategy | Determines when a neighbor solution, obtained by the application of a perturbation and improvement step to a reference solution, is used to replace the reference solution |
| COperationsResearch.IteratedLocalSearchParameters | Specifies the behavior of a search based on ILS |
| COperationsResearch.MPAbsConstraint | Sets a variable's value to the absolute value of another variable |
| COperationsResearch.MPArrayConstraint | Sets a variable's value equal to a function on a set of variables |
| COperationsResearch.MPArrayWithConstantConstraint | Sets a variable's value equal to a function on a set of variables and, optionally, a constant |
| COperationsResearch.MPConstraintProto | A linear constraint is always of the form: lower_bound <= sum of linear term elements <= upper_bound, where lower_bound and upper_bound: |
| COperationsResearch.MPGeneralConstraintProto | General constraints. See each individual proto type for more information |
| COperationsResearch.MPIndicatorConstraint | 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 |
| COperationsResearch.MPModelDeltaProto | Encodes a full MPModelProto by way of referencing to a "baseline" MPModelProto stored in a file, and a "delta" to apply to this model |
| COperationsResearch.MPModelProto | MPModelProto contains all the information for a Linear Programming model |
| COperationsResearch.MPModelProto.Types.Annotation | Annotations can be freely added by users who want to attach arbitrary payload to the model's variables or constraints |
| COperationsResearch.MPModelRequest | Next id: 18 |
| COperationsResearch.MPQuadraticConstraint | 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 |
| COperationsResearch.MPQuadraticObjective | Quadratic part of a model's objective. Added with other objectives (such as linear), this creates the model's objective function to be optimized |
| COperationsResearch.MPSolution | |
| COperationsResearch.MPSolutionResponse | Next id: 12 |
| COperationsResearch.MPSolveInfo | |
| COperationsResearch.MPSolverCommonParameters | 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 |
| COperationsResearch.MPSosConstraint | 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 |
| COperationsResearch.MPVariableProto | A variable is always constrained in the form: lower_bound <= x <= upper_bound where lower_bound and upper_bound: |
| COperationsResearch.OptionalDouble | 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) |
| COperationsResearch.PartialVariableAssignment | 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 |
| COperationsResearch.PerturbationStrategy | Defines how a reference solution is perturbed |
| COperationsResearch.RuinRecreateParameters | Parameters to configure a perturbation based on a ruin and recreate approach |
| COperationsResearch.RuinStrategy | Ruin strategies, used in perturbation based on ruin and recreate approaches |
| COperationsResearch.SetCoverProto | |
| COperationsResearch.SetCoverProto.Types.Subset | |
| COperationsResearch.SetCoverSolutionResponse | |
| CGoogle.OrTools.Tests.InitTest | |
| CGoogle.OrTools.Util.Int128Reflection | Holder for reflection information generated from ortools/util/int128.proto |
| CGoogle.OrTools.ConstraintSolver.IntArrayHelper | Int[] and long[] helper class |
| CGoogle.OrTools.Sat.IntervalVar | An interval variable |
| CGoogle.OrTools.ConstraintSolver.IntervalVarArrayHelper | IntervalVar[] helper class |
| CGoogle.OrTools.ConstraintSolver.IntVarArrayHelper | IntVar[] helper class |
| CGoogle.OrTools.Tests.KnapsakSolverTest | |
| ►CGoogle.OrTools.LinearSolver.LinearConstraint | |
| CGoogle.OrTools.LinearSolver.Equality | |
| CGoogle.OrTools.LinearSolver.RangeConstraint | |
| CGoogle.OrTools.LinearSolver.VarEquality | |
| CGoogle.OrTools.ModelBuilder.LinearConstraint | Wrapper around a linear constraint stored in the ModelBuilderHelper instance |
| ►CGoogle.OrTools.LinearSolver.LinearExpr | |
| CGoogle.OrTools.LinearSolver.ProductCst | |
| CGoogle.OrTools.LinearSolver.Sum | |
| CGoogle.OrTools.LinearSolver.SumArray | |
| CGoogle.OrTools.LinearSolver.SumCst | |
| CGoogle.OrTools.LinearSolver.SumVarArray | |
| CGoogle.OrTools.LinearSolver.VarWrapper | |
| ►CGoogle.OrTools.ModelBuilder.LinearExpr | Holds a linear expression: sum (ai * xi) + b |
| CGoogle.OrTools.ModelBuilder.LinearExprBuilder | A builder class for linear expressions |
| CGoogle.OrTools.ModelBuilder.Variable | Holds a variable |
| ►CGoogle.OrTools.Sat.LinearExpr | Holds a linear expression: sum (ai * xi) + b |
| ►CGoogle.OrTools.Sat.IntVar | Holds a integer variable with a discrete domain |
| CGoogle.OrTools.Sat.BoolVar | Holds a Boolean variable |
| CGoogle.OrTools.Sat.LinearExprBuilder | A builder class for linear expressions |
| CGoogle.OrTools.Sat.NotBoolVar | |
| CGoogle.OrTools.LinearSolver.LinearExprArrayHelper | |
| COperationsResearch.LinearSolverReflection | Holder for reflection information generated from ortools/linear_solver/linear_solver.proto |
| CGoogle.OrTools.Tests.LinearSolverTest | |
| CGoogle.OrTools.ModelBuilder.Model | Main modeling class |
| CGoogle.OrTools.Tests.ModelBuilderTest | |
| CGoogle.OrTools.NestedArrayHelper | |
| CGoogle.OrTools.Algorithms.operations_research_algorithms | |
| CGoogle.OrTools.Algorithms.operations_research_algorithmsPINVOKE | |
| CGoogle.OrTools.ConstraintSolver.operations_research_constraint_solver | |
| CGoogle.OrTools.ConstraintSolver.operations_research_constraint_solverPINVOKE | |
| CGoogle.OrTools.Graph.operations_research_graph | |
| CGoogle.OrTools.Graph.operations_research_graphPINVOKE | |
| CGoogle.OrTools.Init.operations_research_init | |
| CGoogle.OrTools.Init.operations_research_initPINVOKE | |
| CGoogle.OrTools.LinearSolver.operations_research_linear_solver | |
| CGoogle.OrTools.LinearSolver.operations_research_linear_solverPINVOKE | |
| CGoogle.OrTools.ModelBuilder.operations_research_model_builder | |
| CGoogle.OrTools.ModelBuilder.operations_research_model_builderPINVOKE | |
| CGoogle.OrTools.Sat.operations_research_sat | |
| CGoogle.OrTools.Sat.operations_research_satPINVOKE | |
| CGoogle.OrTools.Util.operations_research_util | |
| CGoogle.OrTools.Util.operations_research_utilPINVOKE | |
| CGoogle.OrTools.Util.OptionalBooleanReflection | Holder for reflection information generated from ortools/util/optional_boolean.proto |
| CGoogle.OrTools.Glop.ParametersReflection | Holder for reflection information generated from ortools/glop/parameters.proto |
| CCreateSigningKey.Program | |
| CGoogle.OrTools.ProtoHelper | |
| CGoogle.OrTools.Tests.RoutingDimensionTest | |
| CGoogle.OrTools.ConstraintSolver.RoutingEnumsReflection | Holder for reflection information generated from ortools/constraint_solver/routing_enums.proto |
| COperationsResearch.RoutingIlsReflection | Holder for reflection information generated from ortools/constraint_solver/routing_ils.proto |
| CGoogle.OrTools.ConstraintSolver.RoutingParametersReflection | Holder for reflection information generated from ortools/constraint_solver/routing_parameters.proto |
| CGoogle.OrTools.Tests.RoutingSolverTest | |
| CGoogle.OrTools.Sat.SatParametersReflection | Holder for reflection information generated from ortools/sat/sat_parameters.proto |
| CGoogle.OrTools.Tests.SatSolverTest | |
| CGoogle.OrTools.ConstraintSolver.SearchLimitReflection | Holder for reflection information generated from ortools/constraint_solver/search_limit.proto |
| CGoogle.OrTools.ConstraintSolver.SearchStatsReflection | Holder for reflection information generated from ortools/constraint_solver/search_stats.proto |
| COperationsResearch.SetCoverReflection | Holder for reflection information generated from ortools/algorithms/set_cover.proto |
| CGoogle.OrTools.PDLP.SolveLogReflection | Holder for reflection information generated from ortools/pdlp/solve_log.proto |
| CGoogle.OrTools.ModelBuilder.Solver | Model solver class |
| CGoogle.OrTools.ConstraintSolver.SolverParametersReflection | Holder for reflection information generated from ortools/constraint_solver/solver_parameters.proto |
| CGoogle.OrTools.PDLP.SolversReflection | Holder for reflection information generated from ortools/pdlp/solvers.proto |
| CGoogle.OrTools.Algorithms.operations_research_algorithmsPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.ConstraintSolver.operations_research_constraint_solverPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.Graph.operations_research_graphPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.Init.operations_research_initPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.LinearSolver.operations_research_linear_solverPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.ModelBuilder.operations_research_model_builderPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.Sat.operations_research_satPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.Util.operations_research_utilPINVOKE.SWIGExceptionHelper | |
| CGoogle.OrTools.Algorithms.operations_research_algorithmsPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.ConstraintSolver.operations_research_constraint_solverPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.Graph.operations_research_graphPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.Init.operations_research_initPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.LinearSolver.operations_research_linear_solverPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.ModelBuilder.operations_research_model_builderPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.Sat.operations_research_satPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.Util.operations_research_utilPINVOKE.SWIGPendingException | |
| CGoogle.OrTools.Algorithms.operations_research_algorithmsPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.ConstraintSolver.operations_research_constraint_solverPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.Graph.operations_research_graphPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.Init.operations_research_initPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.LinearSolver.operations_research_linear_solverPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.ModelBuilder.operations_research_model_builderPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.Sat.operations_research_satPINVOKE.SWIGStringHelper | |
| CGoogle.OrTools.Util.operations_research_utilPINVOKE.SWIGStringHelper | |
| ►Cglobal.SystemIDisposable | |
| CGoogle.OrTools.Algorithms.Int64Matrix | |
| CGoogle.OrTools.Algorithms.Int64Vector | |
| CGoogle.OrTools.Algorithms.KnapsackSolver | |
| ►CGoogle.OrTools.ConstraintSolver.AssignmentElement | |
| CGoogle.OrTools.ConstraintSolver.IntVarElement | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarElement | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarElement | |
| CGoogle.OrTools.ConstraintSolver.AssignmentIntContainer | |
| CGoogle.OrTools.ConstraintSolver.AssignmentIntervalContainer | |
| CGoogle.OrTools.ConstraintSolver.AssignmentSequenceContainer | |
| ►CGoogle.OrTools.ConstraintSolver.BaseObject | |
| ►CGoogle.OrTools.ConstraintSolver.Decision | |
| CGoogle.OrTools.ConstraintSolver.NetDecision | |
| ►CGoogle.OrTools.ConstraintSolver.DecisionBuilder | |
| CGoogle.OrTools.ConstraintSolver.NetDecisionBuilder | |
| ►CGoogle.OrTools.ConstraintSolver.DecisionVisitor | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreaker | |
| ►CGoogle.OrTools.ConstraintSolver.Demon | |
| CGoogle.OrTools.ConstraintSolver.NetDemon | |
| CGoogle.OrTools.ConstraintSolver.IntVarIterator | |
| CGoogle.OrTools.ConstraintSolver.IntVarIterator | |
| ►CGoogle.OrTools.ConstraintSolver.LocalSearchFilter | |
| CGoogle.OrTools.ConstraintSolver.IntVarLocalSearchFilter | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterManager | |
| ►CGoogle.OrTools.ConstraintSolver.LocalSearchOperator | |
| ►CGoogle.OrTools.ConstraintSolver.IntVarLocalSearchOperator | |
| CGoogle.OrTools.ConstraintSolver.BaseLns | |
| CGoogle.OrTools.ConstraintSolver.ChangeValue | |
| CGoogle.OrTools.ConstraintSolver.PathOperator | |
| CGoogle.OrTools.ConstraintSolver.ModelVisitor | |
| ►CGoogle.OrTools.ConstraintSolver.PropagationBaseObject | |
| CGoogle.OrTools.ConstraintSolver.Assignment | |
| CGoogle.OrTools.ConstraintSolver.Constraint | |
| CGoogle.OrTools.ConstraintSolver.Constraint | |
| ►CGoogle.OrTools.ConstraintSolver.IntExpr | |
| CGoogle.OrTools.ConstraintSolver.BaseIntExpr | |
| ►CGoogle.OrTools.ConstraintSolver.IntVar | |
| CGoogle.OrTools.ConstraintSolver.BooleanVar | |
| CGoogle.OrTools.ConstraintSolver.IntExpr | |
| CGoogle.OrTools.ConstraintSolver.IntervalVar | |
| CGoogle.OrTools.ConstraintSolver.SequenceVar | |
| CGoogle.OrTools.ConstraintSolver.RoutingModelVisitor | |
| ►CGoogle.OrTools.ConstraintSolver.SearchMonitor | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchMonitor | |
| ►CGoogle.OrTools.ConstraintSolver.ObjectiveMonitor | |
| CGoogle.OrTools.ConstraintSolver.OptimizeVar | |
| CGoogle.OrTools.ConstraintSolver.PropagationMonitor | |
| ►CGoogle.OrTools.ConstraintSolver.SearchLimit | |
| CGoogle.OrTools.ConstraintSolver.ImprovementSearchLimit | |
| CGoogle.OrTools.ConstraintSolver.RegularLimit | |
| CGoogle.OrTools.ConstraintSolver.SearchLog | |
| CGoogle.OrTools.ConstraintSolver.SolutionCollector | |
| CGoogle.OrTools.ConstraintSolver.SolutionPool | |
| CGoogle.OrTools.ConstraintSolver.BoundCost | |
| CGoogle.OrTools.ConstraintSolver.DecisionBuilderVector | |
| CGoogle.OrTools.ConstraintSolver.DefaultPhaseParameters | |
| CGoogle.OrTools.ConstraintSolver.Domain | |
| CGoogle.OrTools.ConstraintSolver.Int64Vector | |
| CGoogle.OrTools.ConstraintSolver.Int64VectorVector | |
| CGoogle.OrTools.ConstraintSolver.IntBoolPair | |
| CGoogle.OrTools.ConstraintSolver.IntTupleSet | |
| CGoogle.OrTools.ConstraintSolver.IntVarVector | |
| CGoogle.OrTools.ConstraintSolver.IntVector | |
| CGoogle.OrTools.ConstraintSolver.IntVectorVector | |
| CGoogle.OrTools.ConstraintSolver.IntervalVarVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterManager.FilterEvent | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchFilterVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorState | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchOperatorVector | |
| CGoogle.OrTools.ConstraintSolver.LocalSearchPhaseParameters | |
| CGoogle.OrTools.ConstraintSolver.ModelCache | |
| CGoogle.OrTools.ConstraintSolver.PathsMetadata | |
| CGoogle.OrTools.ConstraintSolver.PickupDeliveryPair | |
| CGoogle.OrTools.ConstraintSolver.RevBool | |
| CGoogle.OrTools.ConstraintSolver.RevInteger | |
| CGoogle.OrTools.ConstraintSolver.RevPartialSequence | |
| CGoogle.OrTools.ConstraintSolver.RoutingDimension | |
| CGoogle.OrTools.ConstraintSolver.RoutingIndexManager | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.NodeNeighborsByCostClass | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.PickupDeliveryPosition | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.ResourceGroup | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.ResourceGroup.Attributes | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.ResourceGroup.Resource | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.RouteDimensionTravelInfo | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.RouteDimensionTravelInfo.TransitionInfo | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.RouteDimensionTravelInfo.TransitionInfo.PiecewiseLinearFormulation | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.SecondaryOptimizer | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.VariableValuePair | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.VehicleTypeContainer | |
| CGoogle.OrTools.ConstraintSolver.RoutingModel.VehicleTypeContainer.VehicleClassEntry | |
| CGoogle.OrTools.ConstraintSolver.SearchMonitorVector | |
| CGoogle.OrTools.ConstraintSolver.SequenceVarVector | |
| CGoogle.OrTools.ConstraintSolver.SimpleBoundCosts | |
| CGoogle.OrTools.ConstraintSolver.Solver | |
| CGoogle.OrTools.ConstraintSolver.Solver.IntegerCastInfo | |
| CGoogle.OrTools.ConstraintSolver.SymmetryBreakerVector | |
| ►CGoogle.OrTools.ConstraintSolver.TypeRegulationsChecker | |
| CGoogle.OrTools.ConstraintSolver.TypeIncompatibilityChecker | |
| CGoogle.OrTools.ConstraintSolver.TypeRequirementChecker | |
| CGoogle.OrTools.Graph.LinearSumAssignment | |
| CGoogle.OrTools.Graph.MaxFlow | |
| ►CGoogle.OrTools.Graph.MinCostFlowBase | |
| CGoogle.OrTools.Graph.MinCostFlow | |
| CGoogle.OrTools.Init.CppBridge | |
| CGoogle.OrTools.Init.CppFlags | |
| CGoogle.OrTools.Init.OrToolsVersion | |
| CGoogle.OrTools.LinearSolver.Constraint | |
| CGoogle.OrTools.LinearSolver.DoubleVector | |
| CGoogle.OrTools.LinearSolver.MPConstraintVector | |
| CGoogle.OrTools.LinearSolver.MPSolverParameters | |
| CGoogle.OrTools.LinearSolver.MPVariableVector | |
| CGoogle.OrTools.LinearSolver.Objective | |
| CGoogle.OrTools.LinearSolver.Solver | |
| CGoogle.OrTools.LinearSolver.Variable | Patch the MPVariable class to support the natural language API |
| CGoogle.OrTools.ModelBuilder.DoubleVector | |
| CGoogle.OrTools.ModelBuilder.IntVector | |
| CGoogle.OrTools.ModelBuilder.MbLogCallback | |
| CGoogle.OrTools.ModelBuilder.ModelBuilderHelper | |
| CGoogle.OrTools.ModelBuilder.ModelSolverHelper | |
| ►CGoogle.OrTools.Sat.BestBoundCallback | |
| CGoogle.OrTools.Sat.BestBoundCallbackDelegate | |
| CGoogle.OrTools.Sat.CpSatHelper | |
| ►CGoogle.OrTools.Sat.LogCallback | |
| CGoogle.OrTools.Sat.LogCallbackDelegate | |
| ►CGoogle.OrTools.Sat.SolutionCallback | |
| ►CGoogle.OrTools.Sat.CpSolverSolutionCallback | Parent class to create a callback called at each solution |
| CGoogle.OrTools.Sat.ObjectiveSolutionPrinter | A specialized solution printer |
| ►CSolutionCounter | |
| CSolutionDivisionCounter | |
| CSolutionModuloCounter | |
| CGoogle.OrTools.Sat.SolveWrapper | |
| CGoogle.OrTools.Util.Domain | |
| CGoogle.OrTools.Util.Int64Vector | |
| CGoogle.OrTools.Util.Int64VectorVector | |
| CGoogle.OrTools.ModelBuilder.Term | Holds a term (expression * coefficient) |
| CGoogle.OrTools.Sat.Term | Holds a term (expression * coefficient) |
| CGoogle.OrTools.Bop.BopOptimizerMethod.Types | Container for nested types declared in the BopOptimizerMethod message type |
| CGoogle.OrTools.Bop.BopParameters.Types | Container for nested types declared in the BopParameters message type |
| CGoogle.OrTools.ConstraintSolver.ConstraintSolverParameters.Types | Container for nested types declared in the ConstraintSolverParameters message type |
| CGoogle.OrTools.ConstraintSolver.FirstSolutionStrategy.Types | Container for nested types declared in the FirstSolutionStrategy message type |
| CGoogle.OrTools.ConstraintSolver.LocalSearchMetaheuristic.Types | Container for nested types declared in the LocalSearchMetaheuristic message type |
| CGoogle.OrTools.ConstraintSolver.LocalSearchStatistics.Types | Container for nested types declared in the LocalSearchStatistics message type |
| CGoogle.OrTools.ConstraintSolver.RoutingSearchParameters.Types | Container for nested types declared in the RoutingSearchParameters message type |
| CGoogle.OrTools.Glop.GlopParameters.Types | Container for nested types declared in the GlopParameters message type |
| CGoogle.OrTools.Graph.FlowModelProto.Types | Container for nested types declared in the FlowModelProto message type |
| CGoogle.OrTools.PDLP.PrimalDualHybridGradientParams.Types | Container for nested types declared in the PrimalDualHybridGradientParams message type |
| CGoogle.OrTools.PDLP.TerminationCriteria.Types | Container for nested types declared in the TerminationCriteria message type |
| CGoogle.OrTools.Sat.DecisionStrategyProto.Types | Container for nested types declared in the DecisionStrategyProto message type |
| CGoogle.OrTools.Sat.SatParameters.Types | Container for nested types declared in the SatParameters message type |
| COperationsResearch.AcceptanceStrategy.Types | Container for nested types declared in the AcceptanceStrategy message type |
| COperationsResearch.MPModelProto.Types | Container for nested types declared in the MPModelProto message type |
| COperationsResearch.MPModelProto.Types.Annotation.Types | Container for nested types declared in the Annotation message type |
| COperationsResearch.MPModelRequest.Types | Container for nested types declared in the MPModelRequest message type |
| COperationsResearch.MPSolverCommonParameters.Types | Container for nested types declared in the MPSolverCommonParameters message type |
| COperationsResearch.MPSosConstraint.Types | Container for nested types declared in the MPSosConstraint message type |
| COperationsResearch.PerturbationStrategy.Types | Container for nested types declared in the PerturbationStrategy message type |
| COperationsResearch.RuinStrategy.Types | Container for nested types declared in the RuinStrategy message type |
| COperationsResearch.SetCoverProto.Types | Container for nested types declared in the SetCoverProto message type |
| COperationsResearch.SetCoverSolutionResponse.Types | Container for nested types declared in the SetCoverSolutionResponse message type |
1.12.0