![]() |
OR-Tools
8.1
|
Go to the source code of this file.
Classes | |
struct | TableStruct_ortools_2fsat_2fcp_5fmodel_2eproto |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
class | PROTOBUF_FINAL |
struct | is_proto_enum< ::operations_research::sat::DecisionStrategyProto_VariableSelectionStrategy > |
struct | is_proto_enum< ::operations_research::sat::DecisionStrategyProto_DomainReductionStrategy > |
struct | is_proto_enum< ::operations_research::sat::CpSolverStatus > |
Namespaces | |
internal | |
operations_research | |
The vehicle routing library lets one model and solve generic vehicle routing problems ranging from the Traveling Salesman Problem to more complex problems such as the Capacitated Vehicle Routing Problem with Time Windows. | |
operations_research::sat | |
Macros | |
#define | PROTOBUF_INTERNAL_EXPORT_ortools_2fsat_2fcp_5fmodel_2eproto |
Variables | |
const ::PROTOBUF_NAMESPACE_ID::internal::DescriptorTable | descriptor_table_ortools_2fsat_2fcp_5fmodel_2eproto |
constexpr DecisionStrategyProto_VariableSelectionStrategy | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_MIN = DecisionStrategyProto_VariableSelectionStrategy_CHOOSE_FIRST |
constexpr DecisionStrategyProto_VariableSelectionStrategy | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_MAX = DecisionStrategyProto_VariableSelectionStrategy_CHOOSE_MAX_DOMAIN_SIZE |
constexpr int | DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_ARRAYSIZE = DecisionStrategyProto_VariableSelectionStrategy_VariableSelectionStrategy_MAX + 1 |
constexpr DecisionStrategyProto_DomainReductionStrategy | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_MIN = DecisionStrategyProto_DomainReductionStrategy_SELECT_MIN_VALUE |
constexpr DecisionStrategyProto_DomainReductionStrategy | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_MAX = DecisionStrategyProto_DomainReductionStrategy_SELECT_MEDIAN_VALUE |
constexpr int | DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_ARRAYSIZE = DecisionStrategyProto_DomainReductionStrategy_DomainReductionStrategy_MAX + 1 |
constexpr CpSolverStatus | CpSolverStatus_MIN = UNKNOWN |
constexpr CpSolverStatus | CpSolverStatus_MAX = OPTIMAL |
constexpr int | CpSolverStatus_ARRAYSIZE = CpSolverStatus_MAX + 1 |
#define PROTOBUF_INTERNAL_EXPORT_ortools_2fsat_2fcp_5fmodel_2eproto |
Definition at line 37 of file cp_model.pb.h.
PROTOBUF_NAMESPACE_OPEN ::operations_research::sat::AllDifferentConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::AllDifferentConstraintProto > | ( | Arena * | ) |
::operations_research::sat::AutomatonConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::AutomatonConstraintProto > | ( | Arena * | ) |
::operations_research::sat::BoolArgumentProto* Arena::CreateMaybeMessage<::operations_research::sat::BoolArgumentProto > | ( | Arena * | ) |
::operations_research::sat::CircuitConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::CircuitConstraintProto > | ( | Arena * | ) |
::operations_research::sat::ConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::ConstraintProto > | ( | Arena * | ) |
::operations_research::sat::CpModelProto* Arena::CreateMaybeMessage<::operations_research::sat::CpModelProto > | ( | Arena * | ) |
::operations_research::sat::CpObjectiveProto* Arena::CreateMaybeMessage<::operations_research::sat::CpObjectiveProto > | ( | Arena * | ) |
::operations_research::sat::CpSolverResponse* Arena::CreateMaybeMessage<::operations_research::sat::CpSolverResponse > | ( | Arena * | ) |
::operations_research::sat::CumulativeConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::CumulativeConstraintProto > | ( | Arena * | ) |
::operations_research::sat::DecisionStrategyProto* Arena::CreateMaybeMessage<::operations_research::sat::DecisionStrategyProto > | ( | Arena * | ) |
::operations_research::sat::DecisionStrategyProto_AffineTransformation* Arena::CreateMaybeMessage<::operations_research::sat::DecisionStrategyProto_AffineTransformation > | ( | Arena * | ) |
::operations_research::sat::ElementConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::ElementConstraintProto > | ( | Arena * | ) |
::operations_research::sat::IntegerArgumentProto* Arena::CreateMaybeMessage<::operations_research::sat::IntegerArgumentProto > | ( | Arena * | ) |
::operations_research::sat::IntegerVariableProto* Arena::CreateMaybeMessage<::operations_research::sat::IntegerVariableProto > | ( | Arena * | ) |
::operations_research::sat::IntervalConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::IntervalConstraintProto > | ( | Arena * | ) |
::operations_research::sat::InverseConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::InverseConstraintProto > | ( | Arena * | ) |
::operations_research::sat::LinearArgumentProto* Arena::CreateMaybeMessage<::operations_research::sat::LinearArgumentProto > | ( | Arena * | ) |
::operations_research::sat::LinearConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::LinearConstraintProto > | ( | Arena * | ) |
::operations_research::sat::LinearExpressionProto* Arena::CreateMaybeMessage<::operations_research::sat::LinearExpressionProto > | ( | Arena * | ) |
::operations_research::sat::NoOverlap2DConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::NoOverlap2DConstraintProto > | ( | Arena * | ) |
::operations_research::sat::NoOverlapConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::NoOverlapConstraintProto > | ( | Arena * | ) |
::operations_research::sat::PartialVariableAssignment* Arena::CreateMaybeMessage<::operations_research::sat::PartialVariableAssignment > | ( | Arena * | ) |
::operations_research::sat::ReservoirConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::ReservoirConstraintProto > | ( | Arena * | ) |
::operations_research::sat::RoutesConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::RoutesConstraintProto > | ( | Arena * | ) |
::operations_research::sat::TableConstraintProto* Arena::CreateMaybeMessage<::operations_research::sat::TableConstraintProto > | ( | Arena * | ) |
|
inline |
Definition at line 11337 of file cp_model.pb.h.
|
inline |
Definition at line 11332 of file cp_model.pb.h.
|
inline |
Definition at line 11327 of file cp_model.pb.h.
|
extern |
Definition at line 966 of file cp_model.pb.cc.