All Classes
| Class | Description |
|---|---|
| AllDifferentConstraintProto |
All variables must take different values.
|
| AllDifferentConstraintProto.Builder |
All variables must take different values.
|
| AllDifferentConstraintProtoOrBuilder | |
| Assignment |
An Assignment is a variable -> domains mapping, used
to report solutions to the user. |
| AssignmentElement | |
| AssignmentIntContainer | |
| AssignmentIntervalContainer | |
| AssignmentSequenceContainer | |
| AutomatonConstraintProto |
This constraint forces a sequence of variables to be accepted by an
automaton.
|
| AutomatonConstraintProto.Builder |
This constraint forces a sequence of variables to be accepted by an
automaton.
|
| AutomatonConstraintProtoOrBuilder | |
| BaseIntExpr | |
| BaseLns |
This is the base class for building an Lns operator.
|
| BaseObject |
A BaseObject is the root of all reversibly allocated objects.
A DebugString method and the associated << operator are implemented as a convenience. |
| BoolArgumentProto |
Argument of the constraints of the form OP(literals).
|
| BoolArgumentProto.Builder |
Argument of the constraints of the form OP(literals).
|
| BoolArgumentProtoOrBuilder | |
| BooleanVar | |
| CastConstraint |
Cast constraints are special channeling constraints designed
to keep a variable in sync with an expression. |
| ChangeValue |
Defines operators which change the value of variables;
each neighbor corresponds to *one* modified variable. Sub-classes have to define ModifyValue which determines what the new variable value is going to be (given the current value and the variable). |
| 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.
|
| CircuitConstraintProtoOrBuilder | |
| Constraint |
A constraint is the main modeling object.
|
| Constraint |
Wrapper around a ConstraintProto.
|
| ConstraintProto |
Next id: 30
|
| ConstraintProto.Builder |
Next id: 30
|
| ConstraintProto.ConstraintCase | |
| ConstraintProtoOrBuilder | |
| ConstraintSolverParameters |
Solver parameters.
|
| ConstraintSolverParameters.Builder |
Solver parameters.
|
| ConstraintSolverParameters.TrailCompression |
Internal parameters of the solver.
|
| ConstraintSolverParametersOrBuilder | |
| CpModel |
Main modeling class.
|
| CpModel.MismatchedArrayLengths |
Exception thrown when parallel arrays have mismatched lengths.
|
| CpModel.WrongLength |
Exception thrown when an array has a wrong length.
|
| CpModelProto |
A constraint programming problem.
|
| CpModelProto.Builder |
A constraint programming problem.
|
| CpModelProtobuf | |
| CpModelProtoOrBuilder | |
| CpObjectiveProto |
Optimization objective.
|
| CpObjectiveProto.Builder |
Optimization objective.
|
| CpObjectiveProtoOrBuilder | |
| CppBridge |
This class performs various C++ initialization.
It is meant to be used once at the start of a program. |
| CppFlags |
Simple structure that holds useful C++ flags to setup from non-C++ languages.
|
| 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.
|
| CpSolverResponseOrBuilder | |
| CpSolverSolutionCallback |
Parent class to create a callback called at each solution.
|
| CpSolverStatus |
The status returned by a solver trying to solve a CpModelProto.
|
| 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.
|
| CumulativeConstraintProtoOrBuilder | |
| Decision |
A Decision represents a choice point in the search tree.
|
| DecisionBuilder |
A DecisionBuilder is responsible for creating the search tree.
|
| DecisionStrategyProto |
Define the strategy to follow when the solver needs to take a new decision.
|
| DecisionStrategyProto.AffineTransformation |
Advanced usage.
|
| DecisionStrategyProto.AffineTransformation.Builder |
Advanced usage.
|
| DecisionStrategyProto.AffineTransformationOrBuilder | |
| DecisionStrategyProto.Builder |
Define the strategy to follow when the solver needs to take a new decision.
|
| DecisionStrategyProto.DomainReductionStrategy |
Once a variable has been chosen, this enum describe what decision is taken
on its domain.
|
| DecisionStrategyProto.VariableSelectionStrategy |
The order in which the variables above should be considered.
|
| DecisionStrategyProtoOrBuilder | |
| DecisionVisitor |
A DecisionVisitor is used to inspect a decision.
It contains virtual methods for all type of 'declared' decisions. |
| DefaultPhaseParameters |
This struct holds all parameters for the default search.
DefaultPhaseParameters is only used by Solver::MakeDefaultPhase methods. Note this is for advanced users only. |
| Demon |
A Demon is the base element of a propagation queue.
|
| 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.
|
| DenseMatrixProtoOrBuilder | |
| DisjunctiveConstraint | |
| Domain |
We call domain any subset of Int64 = [kint64min, kint64max].
This class can be used to represent such set efficiently as a sorted and non-adjacent list of intervals. |
| ElementConstraintProto |
The constraint target = vars[index].
|
| ElementConstraintProto.Builder |
The constraint target = vars[index].
|
| ElementConstraintProtoOrBuilder | |
| FirstSolutionStrategy |
First solution strategies, used as starting point of local search.
|
| FirstSolutionStrategy.Builder |
First solution strategies, used as starting point of local search.
|
| FirstSolutionStrategy.Value |
Protobuf enum
operations_research.FirstSolutionStrategy.Value |
| FirstSolutionStrategyOrBuilder | |
| GlobalVehicleBreaksConstraint |
GlobalVehicleBreaksConstraint ensures breaks constraints are enforced on
all vehicles in the dimension passed to its constructor. It is intended to be used for dimensions representing time. A break constraint ensures break intervals fit on the route of a vehicle. For a given vehicle, it forces break intervals to be disjoint from visit intervals, where visit intervals start at CumulVar(node) and last for node_visit_transit[node]. |
| ImprovementSearchLimit | |
| IntBoolPair | |
| IntegerArgumentProto |
Argument of the constraints of the form target_var = OP(vars).
|
| IntegerArgumentProto.Builder |
Argument of the constraints of the form target_var = OP(vars).
|
| IntegerArgumentProtoOrBuilder | |
| IntegerVariableProto |
An integer variable.
|
| IntegerVariableProto.Builder |
An integer variable.
|
| IntegerVariableProtoOrBuilder | |
| IntervalConstraintProto |
This "special" constraint not only enforces (start + size == end) and (size
>= 0) but can also be referred by other constraints using this "interval"
concept.
|
| IntervalConstraintProto.Builder |
This "special" constraint not only enforces (start + size == end) and (size
>= 0) but can also be referred by other constraints using this "interval"
concept.
|
| IntervalConstraintProtoOrBuilder | |
| IntervalVar |
Interval variables are often used in scheduling.
|
| IntervalVar |
An interval variable.
|
| IntervalVarElement | |
| IntExpr |
The class IntExpr is the base of all integer expressions in
constraint programming. It contains the basic protocol for an expression: - setting and modifying its bound - querying if it is bound - listening to events modifying its bounds - casting it into a variable (instance of IntVar) |
| IntIntToLongFunction |
Represents a function that accepts two int-valued arguments and produces a
long-valued result.
|
| IntTupleSet | |
| IntVar |
The class IntVar is a subset of IntExpr.
|
| IntVar |
An integer variable.
|
| IntVarElement | |
| IntVarIterator |
The class Iterator has two direct subclasses.
|
| IntVarLocalSearchFilter | |
| IntVarLocalSearchHandler | |
| IntVarLocalSearchOperator | |
| IntVarLocalSearchOperatorTemplate |
Base operator class for operators manipulating variables.
|
| 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.
|
| InverseConstraintProtoOrBuilder | |
| JavaDecisionBuilder |
This class acts as a intermediate step between a c++ decision builder
and a java one.
|
| KnapsackSolver |
This library solves knapsack problems.
Problems the library solves include: - 0-1 knapsack problems, - Multi-dimensional knapsack problems, Given n items, each with a profit and a weight, given a knapsack of capacity c, the goal is to find a subset of items which fits inside c and maximizes the total profit. The knapsack problem can easily be extended from 1 to d dimensions. As an example, this can be useful to constrain the maximum number of items inside the knapsack. Without loss of generality, profits and weights are assumed to be positive. From a mathematical point of view, the multi-dimensional knapsack problem can be modeled by d linear constraints: ForEach(j:1..d)(Sum(i:1..n)(weight_ij * item_i) <= c_j where item_i is a 0-1 integer variable. Then the goal is to maximize: Sum(i:1..n)(profit_i * item_i). There are several ways to solve knapsack problems. |
| KnapsackSolver.SolverType |
Enum controlling which underlying algorithm is used.
This enum is passed to the constructor of the KnapsackSolver object. It selects which solving method will be used. |
| LinearArgumentProto |
Protobuf type
operations_research.sat.LinearArgumentProto |
| LinearArgumentProto.Builder |
Protobuf type
operations_research.sat.LinearArgumentProto |
| LinearArgumentProtoOrBuilder | |
| 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.
|
| LinearConstraintProtoOrBuilder | |
| LinearExpr |
A linear expression interface that can be parsed.
|
| 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.
|
| LinearExpressionProtoOrBuilder | |
| LinearSolver | |
| LinearSumAssignment | |
| LinearSumAssignment.Status | |
| Literal |
Interface to describe a boolean variable or its negation.
|
| Loader |
Load native libraries needed for using ortools-java.
|
| LocalSearchFilter |
Classes to which this template function can be applied to as of 04/2014.
Usage: LocalSearchOperator* op = MakeLocalSearchOperator<Relocate>(...); class TwoOpt; class Relocate; class Exchange; class Cross; class MakeActiveOperator; class MakeInactiveOperator; class MakeChainInactiveOperator; class SwapActiveOperator; class ExtendedSwapActiveOperator; class MakeActiveAndRelocate; class RelocateAndMakeActiveOperator; class RelocateAndMakeInactiveOperator; Local Search Filters are used for fast neighbor pruning. Filtering a move is done in several phases: - in the Relax phase, filters determine which parts of their internals will be changed by the candidate, and modify intermediary State - in the Accept phase, filters check that the candidate is feasible, - if the Accept phase succeeds, the solver may decide to trigger a Synchronize phase that makes filters change their internal representation to the last candidate, - otherwise (Accept fails or the solver does not want to synchronize), a Revert phase makes filters erase any intermediary State generated by the Relax and Accept phases. A given filter has phases called with the following pattern: (Relax.Accept.Synchronize | Relax.Accept.Revert | Relax.Revert)*. Filters's Revert() is always called in the reverse order their Accept() was called, to allow late filters to use state done/undone by early filters' Accept()/Revert(). |
| LocalSearchFilterManager |
Filter manager: when a move is made, filters are executed to decide whether
the solution is feasible and compute parts of the new cost. |
| LocalSearchFilterManager.FilterEvent | |
| LocalSearchMetaheuristic |
Local search metaheuristics used to guide the search.
|
| LocalSearchMetaheuristic.Builder |
Local search metaheuristics used to guide the search.
|
| LocalSearchMetaheuristic.Value |
Protobuf enum
operations_research.LocalSearchMetaheuristic.Value |
| LocalSearchMetaheuristicOrBuilder | |
| LocalSearchMonitor | |
| LocalSearchOperator |
This class represent a reversible FIFO structure.
The main difference w.r.t a standard FIFO structure is that a Solver is given as parameter to the modifiers such that the solver can store the backtrack information Iterator's traversing order should not be changed, as some algorithm depend on it to be consistent. It's main use is to store a list of demons in the various classes of variables. The base class for all local search operators. A local search operator is an object that defines the neighborhood of a solution. |
| LocalSearchPhaseParameters | |
| LongTernaryOperator |
Represents an operation upon three
long-valued operands and producing a
long-valued result. |
| LongTernaryPredicate |
Represents a predicate (boolean-valued function) uppon
three
long-valued operands. |
| main | |
| main | |
| main | |
| main | |
| main | |
| main | |
| main_research_linear_solver | |
| main_research_linear_solverJNI | |
| mainConstants | |
| mainJNI | |
| mainJNI | |
| mainJNI | |
| mainJNI | |
| mainJNI | |
| mainJNI | |
| MaxFlow | |
| MaxFlow.Status | |
| MinCostFlow | |
| MinCostFlowBase | |
| MinCostFlowBase.Status | |
| ModelCache |
Implements a complete cache for model elements: expressions and
constraints. |
| ModelVisitor |
Model visitor.
|
| MPAbsConstraint |
Sets a variable's value to the absolute value of another variable.
|
| MPAbsConstraint.Builder |
Sets a variable's value to the absolute value of another variable.
|
| MPAbsConstraintOrBuilder | |
| MPArrayConstraint |
Sets a variable's value equal to a function on a set of variables.
|
| MPArrayConstraint.Builder |
Sets a variable's value equal to a function on a set of variables.
|
| MPArrayConstraintOrBuilder | |
| MPArrayWithConstantConstraint |
Sets a variable's value equal to a function on a set of variables and,
optionally, a constant.
|
| MPArrayWithConstantConstraint.Builder |
Sets a variable's value equal to a function on a set of variables and,
optionally, a constant.
|
| MPArrayWithConstantConstraintOrBuilder | |
| MPConstraint |
The class for constraints of a Mathematical Programming (MP) model.
A constraint is represented as a linear equation or inequality. |
| MPConstraintProto |
A linear constraint is always of the form:
lower_bound <= sum of linear term elements <= upper_bound,
where lower_bound and upper_bound:
- Can form a singleton: lower_bound == upper_bound.
|
| MPConstraintProto.Builder |
A linear constraint is always of the form:
lower_bound <= sum of linear term elements <= upper_bound,
where lower_bound and upper_bound:
- Can form a singleton: lower_bound == upper_bound.
|
| MPConstraintProtoOrBuilder | |
| MPGeneralConstraintProto |
General constraints.
|
| MPGeneralConstraintProto.Builder |
General constraints.
|
| MPGeneralConstraintProto.GeneralConstraintCase | |
| MPGeneralConstraintProtoOrBuilder | |
| MPIndicatorConstraint |
Indicator constraints encode the activation or deactivation of linear
constraints given the value of one Boolean variable in the model.
|
| MPIndicatorConstraint.Builder |
Indicator constraints encode the activation or deactivation of linear
constraints given the value of one Boolean variable in the model.
|
| MPIndicatorConstraintOrBuilder | |
| 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.
|
| MPModelDeltaProto.Builder |
Encodes a full MPModelProto by way of referencing to a "baseline"
MPModelProto stored in a file, and a "delta" to apply to this model.
|
| MPModelDeltaProtoOrBuilder | |
| MPModelExportOptions |
Export options.
|
| MPModelProto |
MPModelProto contains all the information for a Linear Programming model.
|
| MPModelProto.Builder |
MPModelProto contains all the information for a Linear Programming model.
|
| MPModelProtoOrBuilder | |
| MPModelRequest |
Next id: 12.
|
| MPModelRequest.Builder |
Next id: 12.
|
| MPModelRequest.SolverType |
The solver type, which will select a specific implementation, and will also
impact the interpretation of the model (i.e.
|
| MPModelRequestOrBuilder | |
| MPObjective |
A class to express a linear objective.
|
| 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.
|
| MPQuadraticConstraint.Builder |
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.
|
| MPQuadraticConstraintOrBuilder | |
| MPQuadraticObjective |
Quadratic part of a model's objective.
|
| MPQuadraticObjective.Builder |
Quadratic part of a model's objective.
|
| MPQuadraticObjectiveOrBuilder | |
| MPSolution |
Protobuf type
operations_research.MPSolution |
| MPSolution.Builder |
Protobuf type
operations_research.MPSolution |
| MPSolutionOrBuilder | |
| MPSolutionResponse |
Next id: 9.
|
| MPSolutionResponse.Builder |
Next id: 9.
|
| MPSolutionResponseOrBuilder | |
| MPSolver |
This mathematical programming (MP) solver class is the main class
though which users build and solve problems. |
| MPSolver.BasisStatus |
Advanced usage: possible basis status values for a variable and the slack
variable of a linear constraint. |
| MPSolver.OptimizationProblemType |
The type of problems (LP or MIP) that will be solved and the underlying
solver (GLOP, GLPK, CLP, CBC or SCIP) that will solve them. |
| MPSolver.ResultStatus |
The status of solving the problem.
|
| MPSolverCommonParameters |
MPSolverCommonParameters holds advanced usage parameters that apply to any of
the solvers we support.
|
| MPSolverCommonParameters.Builder |
MPSolverCommonParameters holds advanced usage parameters that apply to any of
the solvers we support.
|
| MPSolverCommonParameters.LPAlgorithmValues |
Protobuf enum
operations_research.MPSolverCommonParameters.LPAlgorithmValues |
| MPSolverCommonParametersOrBuilder | |
| MPSolverParameters |
This class stores parameter settings for LP and MIP solvers.
|
| MPSolverParameters.DoubleParam |
Enumeration of parameters that take continuous values.
|
| MPSolverParameters.IncrementalityValues |
Advanced usage: Incrementality options.
|
| MPSolverParameters.IntegerParam |
Enumeration of parameters that take integer or categorical values.
|
| MPSolverParameters.LpAlgorithmValues |
LP algorithm to use.
|
| MPSolverParameters.PresolveValues |
For each categorical parameter, enumeration of possible values.
|
| MPSolverParameters.ScalingValues |
Advanced usage: Scaling options.
|
| MPSolverResponseStatus |
Status returned by the solver.
|
| MPSosConstraint |
Special Ordered Set (SOS) constraints of type 1 or 2.
|
| MPSosConstraint.Builder |
Special Ordered Set (SOS) constraints of type 1 or 2.
|
| MPSosConstraint.Type |
Protobuf enum
operations_research.MPSosConstraint.Type |
| MPSosConstraintOrBuilder | |
| MPVariable |
The class for variables of a Mathematical Programming (MP) model.
|
| MPVariableProto |
A variable is always constrained in the form:
lower_bound <= x <= upper_bound
where lower_bound and upper_bound:
- Can form a singleton: x = constant = lower_bound = upper_bound.
|
| MPVariableProto.Builder |
A variable is always constrained in the form:
lower_bound <= x <= upper_bound
where lower_bound and upper_bound:
- Can form a singleton: x = constant = lower_bound = upper_bound.
|
| MPVariableProtoOrBuilder | |
| 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.
|
| NoOverlap2DConstraintProtoOrBuilder | |
| NoOverlapConstraintProto |
All the intervals (index of IntervalConstraintProto) must be disjoint.
|
| NoOverlapConstraintProto.Builder |
All the intervals (index of IntervalConstraintProto) must be disjoint.
|
| NoOverlapConstraintProtoOrBuilder | |
| NotBooleanVariable |
The negation of a boolean variable.
|
| OptimizeVar |
This class encapsulates an objective.
|
| OptionalBoolean |
A "three-way" boolean: unspecified, false or true.
|
| OptionalBooleanOuterClass | |
| 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).
|
| OptionalDouble.Builder |
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).
|
| OptionalDoubleOrBuilder | |
| Pack | |
| PartialVariableAssignment |
This message encodes a partial (or full) assignment of the variables of a
MPModelProto problem.
|
| 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
MPModelProto problem.
|
| PartialVariableAssignment.Builder |
This message encodes a partial (or full) assignment of the variables of a
CpModelProto.
|
| PartialVariableAssignmentOrBuilder | |
| PartialVariableAssignmentOrBuilder | |
| PathOperator |
Base class of the local search operators dedicated to path modifications
(a path is a set of nodes linked together by arcs). This family of neighborhoods supposes they are handling next variables representing the arcs (var[i] represents the node immediately after i on a path). Several services are provided: - arc manipulators (SetNext(), ReverseChain(), MoveChain()) - path inspectors (Next(), Prev(), IsPathEnd()) - path iterators: operators need a given number of nodes to define a neighbor; this class provides the iteration on a given number of (base) nodes which can be used to define a neighbor (through the BaseNode method) Subclasses only need to override MakeNeighbor to create neighbors using the services above (no direct manipulation of assignments). |
| PropagationBaseObject |
NOLINT
The PropagationBaseObject is a subclass of BaseObject that is also friend to the Solver class. |
| PropagationMonitor | |
| RegularLimit |
Usual limit based on wall_time, number of explored branches and
number of failures in the search tree |
| RegularLimitParameters |
A search limit
The default values for int64 fields is the maxima value, i.e., 2^63-1
|
| RegularLimitParameters.Builder |
A search limit
The default values for int64 fields is the maxima value, i.e., 2^63-1
|
| RegularLimitParametersOrBuilder | |
| ReservoirConstraintProto |
Maintain a reservoir level within bounds.
|
| ReservoirConstraintProto.Builder |
Maintain a reservoir level within bounds.
|
| ReservoirConstraintProtoOrBuilder | |
| RevBool |
This class adds reversibility to a POD type.
It contains the stamp optimization. |
| RevInteger |
This class adds reversibility to a POD type.
It contains the stamp optimization. |
| RevLong |
This class adds reversibility to a POD type.
It contains the stamp optimization. |
| RevPartialSequence |
----- RevPartialSequence -----
|
| RoutesConstraintProto |
The "VRP" (Vehicle Routing Problem) constraint.
|
| RoutesConstraintProto.Builder |
The "VRP" (Vehicle Routing Problem) constraint.
|
| RoutesConstraintProtoOrBuilder | |
| RoutingDimension |
Dimensions represent quantities accumulated at nodes along the routes.
|
| RoutingEnums | |
| RoutingIndexManager |
Manager for any NodeIndex <-> variable index conversion.
|
| RoutingModel | |
| RoutingModel.VehicleTypeContainer |
Struct used to sort and store vehicles by their type.
|
| RoutingModel.VehicleTypeContainer.VehicleClassEntry | |
| RoutingModelParameters |
Parameters which have to be set when creating a RoutingModel.
|
| RoutingModelParameters.Builder |
Parameters which have to be set when creating a RoutingModel.
|
| RoutingModelParametersOrBuilder | |
| RoutingModelVisitor |
Routing model visitor.
|
| RoutingParameters | |
| RoutingSearchParameters |
Parameters defining the search used to solve vehicle routing problems.
|
| RoutingSearchParameters.Builder |
Parameters defining the search used to solve vehicle routing problems.
|
| RoutingSearchParameters.ImprovementSearchLimitParameters |
Parameters required for the improvement search limit.
|
| RoutingSearchParameters.ImprovementSearchLimitParameters.Builder |
Parameters required for the improvement search limit.
|
| RoutingSearchParameters.ImprovementSearchLimitParametersOrBuilder | |
| RoutingSearchParameters.LocalSearchNeighborhoodOperators |
Local search neighborhood operators used to build a solutions neighborhood.
|
| RoutingSearchParameters.LocalSearchNeighborhoodOperators.Builder |
Local search neighborhood operators used to build a solutions neighborhood.
|
| RoutingSearchParameters.LocalSearchNeighborhoodOperatorsOrBuilder | |
| RoutingSearchParameters.SchedulingSolver |
Underlying solver to use in dimension scheduling, respectively for
continuous and mixed models.
|
| RoutingSearchParametersOrBuilder | |
| SatParameters |
Contains the definitions for all the sat algorithm parameters and their
default values.
|
| SatParameters.BinaryMinizationAlgorithm |
Whether to expoit the binary clause to minimize learned clauses further.
|
| SatParameters.Builder |
Contains the definitions for all the sat algorithm parameters and their
default values.
|
| 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
|
| 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.VariableOrder |
Variables without activity (i.e.
|
| SatParametersOrBuilder | |
| SatParametersOuterClass | |
| ScalProd |
A linear expression interface that can be parsed.
|
| SearchLimit |
Base class of all search limits.
|
| SearchLimitProtobuf | |
| SearchLog |
The base class of all search logs that periodically outputs information when
the search is running. |
| SearchMonitor |
A search monitor is a simple set of callbacks to monitor all search events
|
| SequenceVar |
A sequence variable is a variable whose domain is a set of possible
orderings of the interval variables. |
| SequenceVarElement |
The SequenceVarElement stores a partial representation of ranked
interval variables in the underlying sequence variable. This representation consists of three vectors: - the forward sequence. |
| SequenceVarLocalSearchHandler | |
| SequenceVarLocalSearchOperator | |
| SequenceVarLocalSearchOperatorTemplate |
Base operator class for operators manipulating variables.
|
| SolutionCallback | |
| SolutionCollector |
This class is the root class of all solution collectors.
It implements a basic query API to be used independently of the collector used. |
| SolutionPool |
This class is used to manage a pool of solutions.
|
| Solver |
Solver Class
A solver represents the main computation engine. |
| Solver.FailException |
This exceptions signal that a failure has been raised in the C++ world.
|
| Solver.IntegerCastInfo |
Holds semantic information stating that the 'expression' has been
cast into 'variable' using the Var() method, and that 'maintainer' is responsible for maintaining the equality between 'variable' and 'expression'. |
| SolverParameters | |
| SolveWrapper | |
| SortedDisjointIntervalList |
This class represents a sorted list of disjoint, closed intervals.
|
| 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.
|
| SparsePermutationProtoOrBuilder | |
| SumOfVariables |
A linear expression interface that can be parsed.
|
| SWIGTYPE_p_absl__Duration | |
| SWIGTYPE_p_absl__flat_hash_setT_int_t | |
| SWIGTYPE_p_std__setT_operations_research__ClosedInterval_operations_research__SortedDisjointIntervalList__IntervalComparator_t__iterator | |
| SWIGTYPE_p_std__vectorT_absl__flat_hash_setT_int_t_t | |
| SWIGTYPE_p_std__vectorT_int_t | |
| SWIGTYPE_p_std__vectorT_operations_research__Assignment_const_p_t | |
| SWIGTYPE_p_std__vectorT_operations_research__LocalSearchFilterManager__FilterEvent_t | |
| SWIGTYPE_p_std__vectorT_std__dequeT_int_t_t | |
| SWIGTYPE_p_std__vectorT_std__setT_operations_research__RoutingModel__VehicleTypeContainer__VehicleClassEntry_t_t | |
| SymmetryBreaker |
A symmetry breaker is an object that will visit a decision and
create the 'symmetrical' decision in return. Each symmetry breaker represents one class of symmetry. |
| SymmetryProto |
Experimental.
|
| SymmetryProto.Builder |
Experimental.
|
| SymmetryProtoOrBuilder | |
| TableConstraintProto |
The values of the n-tuple formed by the given variables can only be one of
the listed n-tuples in values.
|
| TableConstraintProto.Builder |
The values of the n-tuple formed by the given variables can only be one of
the listed n-tuples in values.
|
| TableConstraintProtoOrBuilder | |
| TypeIncompatibilityChecker |
Checker for type incompatibilities.
|
| TypeRegulationsChecker | |
| TypeRegulationsConstraint |
The following constraint ensures that incompatibilities and requirements
between types are respected. It verifies both "hard" and "temporal" incompatibilities. Two nodes with hard incompatible types cannot be served by the same vehicle at all, while with a temporal incompatibility they can't be on the same route at the same time. The VisitTypePolicy of a node determines how visiting it impacts the type count on the route. For example, for - three temporally incompatible types T1 T2 and T3 - 2 pairs of nodes a1/r1 and a2/r2 of type T1 and T2 respectively, with - a1 and a2 of VisitTypePolicy TYPE_ADDED_TO_VEHICLE - r1 and r2 of policy ADDED_TYPE_REMOVED_FROM_VEHICLE - 3 nodes A, UV and AR of type T3, respectively with type policies TYPE_ADDED_TO_VEHICLE, TYPE_ON_VEHICLE_UP_TO_VISIT and TYPE_SIMULTANEOUSLY_ADDED_AND_REMOVED the configurations UV --> a1 --> r1 --> a2 --> r2, a1 --> r1 --> a2 --> r2 --> A and a1 --> r1 --> AR --> a2 --> r2 are acceptable, whereas the configurations a1 --> a2 --> r1 --> ..., or A --> a1 --> r1 --> ..., or a1 --> r1 --> UV --> ... |
| TypeRequirementChecker |
Checker for type requirements.
|