| Class | Description |
|---|---|
| AffineExpression |
A specialized linear expression: a * x + b
|
| AllDifferentConstraintProto |
All affine expressions must take different values.
|
| AllDifferentConstraintProto.Builder |
All affine expressions must take different values.
|
| AutomatonConstraint |
Specialized automaton constraint.
|
| AutomatonConstraintProto |
This constraint forces a sequence of expressions to be accepted by an
automaton.
|
| AutomatonConstraintProto.Builder |
This constraint forces a sequence of expressions to be accepted by an
automaton.
|
| BoolArgumentProto |
Argument of the constraints of the form OP(literals).
|
| BoolArgumentProto.Builder |
Argument of the constraints of the form OP(literals).
|
| BooleanAssignment |
Stores an assignment of variables as a list of true literals using their
signed representation.
|
| BooleanAssignment.Builder |
Stores an assignment of variables as a list of true literals using their
signed representation.
|
| BooleanProblem | |
| BoolVar |
An Boolean variable.
|
| CircuitConstraint |
Specialized circuit constraint.
|
| CircuitConstraintProto |
The circuit constraint is defined on a graph where the arc presence are
controlled by literals.
|
| CircuitConstraintProto.Builder |
The circuit constraint is defined on a graph where the arc presence are
controlled by literals.
|
| ConstantExpression |
A specialized constant linear expression.
|
| Constraint |
Wrapper around a ConstraintProto.
|
| ConstraintProto |
Next id: 31
Protobuf type
operations_research.sat.ConstraintProto |
| ConstraintProto.Builder |
Next id: 31
Protobuf type
operations_research.sat.ConstraintProto |
| CpModel |
Main modeling class.
|
| CpModelProto |
A constraint programming problem.
|
| CpModelProto.Builder |
A constraint programming problem.
|
| CpModelProtobuf | |
| CpObjectiveProto |
Optimization objective.
|
| CpObjectiveProto.Builder |
Optimization objective.
|
| CpSatHelper | |
| CpSolver |
Wrapper around the SAT solver.
|
| CpSolverResponse |
The response returned by a solver trying to solve a CpModelProto.
|
| CpSolverResponse.Builder |
The response returned by a solver trying to solve a CpModelProto.
|
| CpSolverSolution |
Just a message used to store dense solution.
|
| CpSolverSolution.Builder |
Just a message used to store dense solution.
|
| CpSolverSolutionCallback |
Parent class to create a callback called at each solution.
|
| CumulativeConstraint |
Specialized cumulative constraint.
|
| CumulativeConstraintProto |
The sum of the demands of the intervals at each interval point cannot exceed
a capacity.
|
| CumulativeConstraintProto.Builder |
The sum of the demands of the intervals at each interval point cannot exceed
a capacity.
|
| DecisionStrategyProto |
Define the strategy to follow when the solver needs to take a new decision.
|
| DecisionStrategyProto.Builder |
Define the strategy to follow when the solver needs to take a new decision.
|
| DenseMatrixProto |
A dense matrix of numbers encoded in a flat way, row by row.
|
| DenseMatrixProto.Builder |
A dense matrix of numbers encoded in a flat way, row by row.
|
| DoubleLinearExpr |
A linear expression interface that can be parsed.
|
| ElementConstraintProto |
The constraint target = vars[index].
|
| ElementConstraintProto.Builder |
The constraint target = vars[index].
|
| FloatObjectiveProto |
A linear floating point objective: sum coeffs[i] * vars[i] + offset.
|
| FloatObjectiveProto.Builder |
A linear floating point objective: sum coeffs[i] * vars[i] + offset.
|
| IntegerVariableProto |
An integer variable.
|
| IntegerVariableProto.Builder |
An integer variable.
|
| IntervalConstraintProto |
This is not really a constraint.
|
| IntervalConstraintProto.Builder |
This is not really a constraint.
|
| IntervalVar |
An interval variable.
|
| IntVar |
An integer variable.
|
| 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.
|
| InverseConstraintProto.Builder |
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.
|
| LinearArgumentProto |
Protobuf type
operations_research.sat.LinearArgumentProto |
| LinearArgumentProto.Builder |
Protobuf type
operations_research.sat.LinearArgumentProto |
| LinearBooleanConstraint |
A linear Boolean constraint which is a bounded sum of linear terms.
|
| LinearBooleanConstraint.Builder |
A linear Boolean constraint which is a bounded sum of linear terms.
|
| LinearBooleanProblem |
A linear Boolean problem.
|
| LinearBooleanProblem.Builder |
A linear Boolean problem.
|
| LinearConstraintProto |
The linear sum vars[i] * coeffs[i] must fall in the given domain.
|
| LinearConstraintProto.Builder |
The linear sum vars[i] * coeffs[i] must fall in the given domain.
|
| LinearExprBuilder |
Builder class for the LinearExpr container.
|
| LinearExpressionProto |
Some constraints supports linear expression instead of just using a reference
to a variable.
|
| LinearExpressionProto.Builder |
Some constraints supports linear expression instead of just using a reference
to a variable.
|
| LinearObjective |
The objective of an optimization problem.
|
| LinearObjective.Builder |
The objective of an optimization problem.
|
| ListOfVariablesProto |
A list of variables, without any semantics.
|
| ListOfVariablesProto.Builder |
A list of variables, without any semantics.
|
| main | |
| mainJNI | |
| MultipleCircuitConstraint |
Specialized multiple circuit constraint.
|
| NoOverlap2dConstraint |
Specialized NoOverlap2D constraint.
|
| NoOverlap2DConstraintProto |
The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap.
|
| NoOverlap2DConstraintProto.Builder |
The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap.
|
| NoOverlapConstraintProto |
All the intervals (index of IntervalConstraintProto) must be disjoint.
|
| NoOverlapConstraintProto.Builder |
All the intervals (index of IntervalConstraintProto) must be disjoint.
|
| NotBoolVar |
The negation of a boolean variable.
|
| PartialVariableAssignment |
This message encodes a partial (or full) assignment of the variables of a
CpModelProto.
|
| PartialVariableAssignment.Builder |
This message encodes a partial (or full) assignment of the variables of a
CpModelProto.
|
| ReservoirConstraint |
Specialized reservoir constraint.
|
| ReservoirConstraintProto |
Maintain a reservoir level within bounds.
|
| ReservoirConstraintProto.Builder |
Maintain a reservoir level within bounds.
|
| RoutesConstraintProto |
The "VRP" (Vehicle Routing Problem) constraint.
|
| RoutesConstraintProto.Builder |
The "VRP" (Vehicle Routing Problem) constraint.
|
| SatParameters |
Contains the definitions for all the sat algorithm parameters and their
default values.
|
| SatParameters.Builder |
Contains the definitions for all the sat algorithm parameters and their
default values.
|
| SatParametersOuterClass | |
| SolutionCallback | |
| SolveWrapper | |
| SparsePermutationProto |
A permutation of integers encoded as a list of cycles, hence the "sparse"
format.
|
| SparsePermutationProto.Builder |
A permutation of integers encoded as a list of cycles, hence the "sparse"
format.
|
| SymmetryProto |
EXPERIMENTAL.
|
| SymmetryProto.Builder |
EXPERIMENTAL.
|
| TableConstraint |
Specialized assignment constraint.
|
| TableConstraintProto |
The values of the n-tuple formed by the given expression can only be one of
the listed n-tuples in values.
|
| TableConstraintProto.Builder |
The values of the n-tuple formed by the given expression can only be one of
the listed n-tuples in values.
|
| WeightedSumExpression |
A specialized linear expression: sum(ai * xi) + b.
|
| Enum | Description |
|---|---|
| ConstraintProto.ConstraintCase | |
| CpSolverStatus |
The status returned by a solver trying to solve a CpModelProto.
|
| DecisionStrategyProto.DomainReductionStrategy |
Once a variable (resp. affine expression) has been chosen, this enum
describe what decision is taken on its domain.
|
| DecisionStrategyProto.VariableSelectionStrategy |
The order in which the variables (resp. affine expression) above should be
considered.
|
| SatParameters.BinaryMinizationAlgorithm |
Whether to expoit the binary clause to minimize learned clauses further.
|
| SatParameters.ClauseOrdering |
The clauses that will be kept during a cleanup are the ones that come
first under this order.
|
| SatParameters.ClauseProtection |
Each time a clause activity is bumped, the clause has a chance to be
protected during the next cleanup phase.
|
| SatParameters.ConflictMinimizationAlgorithm |
Do we try to minimize conflicts (greedily) when creating them.
|
| SatParameters.FPRoundingMethod |
Rounding method to use for feasibility pump.
|
| SatParameters.MaxSatAssumptionOrder |
In what order do we add the assumptions in a core-based max-sat algorithm
Protobuf enum
operations_research.sat.SatParameters.MaxSatAssumptionOrder |
| SatParameters.MaxSatStratificationAlgorithm |
What stratification algorithm we use in the presence of weight.
|
| SatParameters.Polarity |
Specifies the initial polarity (true/false) when the solver branches on a
variable.
|
| SatParameters.RestartAlgorithm |
Restart algorithms.
|
| SatParameters.SearchBranching |
The search branching will be used to decide how to branch on unfixed nodes.
|
| SatParameters.SharedTreeSplitStrategy |
Protobuf enum
operations_research.sat.SatParameters.SharedTreeSplitStrategy |
| SatParameters.VariableOrder |
Variables without activity (i.e. at the beginning of the search) will be
tried in this preferred order.
|
| Exception | Description |
|---|---|
| CpModel.MismatchedArrayLengths |
Exception thrown when parallel arrays have mismatched lengths.
|
| CpModel.WrongLength |
Exception thrown when an array has a wrong length.
|
Copyright © 2025. All rights reserved.