Google OR-Tools 7.3
DotNet Reference
CP-SAT
Graph
Knapsack solver
Linear solver
Routing
Util
DotNet Reference
Namespaces
Classes
Files
Class List
Here are the classes, structs, unions and interfaces with brief descriptions:
[detail level
1
2
3
4
5
6
]
▼
N
CreateSigningKey
C
Program
▼
N
Google
▼
N
OrTools
►
N
ConstraintSolver
C
BaseEquality
C
Constraint
C
ConstraintEquality
►
C
ConstraintSolverParameters
Solver
parameters
C
Types
Container for nested types declared in the
ConstraintSolverParameters
message type
C
DecisionBuilderVector
►
C
FirstSolutionStrategy
First solution strategies, used as starting point of local search
C
Types
Container for nested types declared in the
FirstSolutionStrategy
message type
C
IConstraintWithStatus
C
IntArrayHelper
C
IntervalVarArrayHelper
C
IntervalVarVector
C
IntExpr
C
IntExprEquality
C
IntVarArrayHelper
C
IntVarEnumerator
C
IntVarIterator
C
IntVarVector
C
LocalSearchFilterVector
►
C
LocalSearchMetaheuristic
Local search metaheuristics used to guide the search
C
Types
Container for nested types declared in the
LocalSearchMetaheuristic
message type
C
LocalSearchOperatorVector
C
NetConstraint
C
NetDecision
This class acts as a intermediate step between a c++ decision and a .Net one
C
NetDecisionBuilder
This class acts as a intermediate step between a c++ decision builder and a .Net one
C
NetDemon
C
RegularLimitParameters
A search limit The default values for int64 fields is the maxima value, i.e., 2^63-1
C
RoutingEnumsReflection
Holder for reflection information generated from ortools/constraint_solver/routing_enums.proto
C
RoutingModelParameters
Parameters which have to be set when creating a RoutingModel
C
RoutingParametersReflection
Holder for reflection information generated from ortools/constraint_solver/routing_parameters.proto
►
C
RoutingSearchParameters
Parameters defining the search used to solve vehicle routing problems
►
C
Types
Container for nested types declared in the
RoutingSearchParameters
message type
C
LocalSearchNeighborhoodOperators
Local search neighborhood operators used to build a solutions neighborhood
C
SearchLimitReflection
Holder for reflection information generated from ortools/constraint_solver/search_limit.proto
C
SearchMonitorVector
C
SequenceVarVector
C
Solver
C
SolverParametersReflection
Holder for reflection information generated from ortools/constraint_solver/solver_parameters.proto
C
SymmetryBreakerVector
C
WrappedConstraint
►
N
LinearSolver
C
Equality
C
LinearConstraint
C
LinearExpr
C
LinearExprArrayHelper
C
MPConstraintVector
C
MpDoubleVector
C
MPVariableVector
C
ProductCst
C
RangeConstraint
C
Solver
C
Sum
C
SumArray
C
SumCst
C
SumVarArray
C
VarEquality
C
Variable
C
VarWrapper
►
N
Sat
C
AllDifferentConstraintProto
All variables must take different values
C
AutomatonConstraintProto
This constraint forces a sequence of variables to be accepted by an automaton
C
BoolArgumentProto
Argument of the constraints of the form OP(literals)
C
BoundedLinearExpression
C
CircuitConstraintProto
The circuit constraint is defined on a graph where the arc presence are controlled by literals
C
CircuitCoveringConstraintProto
Another routing constraint
C
Constraint
C
ConstraintProto
Next id: 27
C
CpModel
Wrapper class around the cp_model proto
C
CpModelProto
A constraint programming problem
C
CpModelReflection
Holder for reflection information generated from ortools/sat/cp_model.proto
C
CpObjectiveProto
Optimization objective
C
CpSolver
C
CpSolverResponse
The response returned by a solver trying to solve a
CpModelProto
C
CpSolverSolutionCallback
C
CumulativeConstraintProto
The sum of the demands of the intervals at each interval point cannot exceed a capacity
►
C
DecisionStrategyProto
Define the strategy to follow when the solver needs to take a new decision
►
C
Types
Container for nested types declared in the
DecisionStrategyProto
message type
C
AffineTransformation
Advanced usage
C
ElementConstraintProto
The constraint target = vars[index]
C
ILiteral
C
IntegerArgumentProto
Argument of the constraints of the form target_var = OP(vars)
C
IntegerVariableProto
An integer variable
C
IntervalConstraintProto
This "special" constraint not only enforces (start + size == end) but can also be referred by other constraints using this "interval" concept
C
IntervalVar
C
IntVar
C
IntVarArrayHelper
C
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
C
LinearConstraintProto
The linear sum vars[i] * coeffs[i] must fall in the given domain
C
LinearExpr
C
NoOverlap2DConstraintProto
The boxes defined by [start_x, end_x) * [start_y, end_y) cannot overlap
C
NoOverlapConstraintProto
All the intervals (index of
IntervalConstraintProto
) must be disjoint
C
NotBooleanVariable
C
ObjectiveSolutionPrinter
C
PartialVariableAssignment
This message encodes a partial (or full) assignment of the variables of a
CpModelProto
C
ProductCst
C
ReservoirConstraintProto
Maintain a reservoir level within bounds
C
RoutesConstraintProto
The "VRP" (Vehicle Routing Problem) constraint
C
SumArray
C
TableConstraintProto
The values of the n-tuple formed by the given variables can only be one of the listed n-tuples in values
►
N
Util
C
Domain
C
operations_research_util
►
C
operations_research_utilPINVOKE
C
SWIGExceptionHelper
C
SWIGPendingException
C
SWIGStringHelper
C
OptionalBooleanReflection
Holder for reflection information generated from ortools/util/optional_boolean.proto
►
C
UtilInt64Vector
C
UtilInt64VectorEnumerator
Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified
►
C
UtilInt64VectorVector
C
UtilInt64VectorVectorEnumerator
Note that the IEnumerator documentation requires an InvalidOperationException to be thrown whenever the collection is modified
C
NestedArrayHelper
C
ProtoHelper
C
BinPackingProblemSat
C
BoolOrSampleSat
C
ChannelingSampleSat
C
CpIsFunSat
C
EarlinessTardinessCostSampleSat
C
InitialRoutes
VRP with initial routes
C
IntervalSampleSat
C
Knapsack
C
LinearProgrammingExample
C
LiteralSampleSat
C
NoOverlapSampleSat
C
OptionalIntervalSampleSat
C
RabbitsAndPheasantsSat
C
RankingSampleSat
C
ReifiedSampleSat
C
SearchForAllSolutionsSampleSat
C
SimpleCpProgram
This is a simple CP program
C
SimpleLpProgram
C
SimpleMaxFlowProgram
C
SimpleMinCostFlowProgram
C
SimpleMipProgram
C
SimpleRoutingProgram
This is a sample using the routing library .Net wrapper
C
SimpleSatProgram
C
SolveAndPrintIntermediateSolutionsSampleSat
C
SolveWithTimeLimitSampleSat
C
StepFunctionSampleSat
C
StopAfterNSolutionsSampleSat
C
Tsp
Minimal TSP
C
TspCircuitBoard
Minimal TSP
C
TspCities
Minimal TSP using distance matrix
C
TspDistanceMatrix
Minimal TSP using distance matrix
C
VarArraySolutionPrinter
C
VarArraySolutionPrinterWithLimit
C
VarArraySolutionPrinterWithObjective
C
Vrp
Minimal TSP using distance matrix
C
VrpCapacity
Minimal TSP using distance matrix
C
VrpDropNodes
Minimal
Vrp
with drop nodes
C
VrpGlobalSpan
Minimal TSP using distance matrix
C
VrpPickupDelivery
Minimal Pickup & Delivery Problem (PDP)
C
VrpPickupDeliveryFifo
Minimal Pickup & Delivery Problem (PDP)
C
VrpPickupDeliveryLifo
Minimal Pickup & Delivery Problem (PDP)
C
VrpResources
Vehicles Routing Problem (VRP) with Resource Constraints
C
VrpStartsEnds
Minimal TSP using distance matrix
C
VrpTimeWindows
Vehicles Routing Problem (VRP) with Time Windows