![]() |
Google OR-Tools v9.15
a fast and portable software suite for combinatorial optimization
|
OR-Tools root namespace. More...
OR-Tools root namespace.
Namespaces | |
| namespace | internal |
| namespace | ssmf_internal |
| namespace | base |
| namespace | gtl |
| namespace | bop |
| namespace | Source |
| namespace | sat |
| namespace | fz |
| namespace | glop |
| namespace | math_opt |
| namespace | mb |
| namespace | lp_format |
| namespace | packing |
| namespace | pdlp |
| namespace | sysinfo |
| namespace | routing |
| namespace | scheduling |
| namespace | scp |
| namespace | use_only_in_tests |
| namespace | cap_prod_util |
Typedefs | |
| typedef KnapsackItem * | KnapsackItemPtr |
| using | NeighborAccessor |
| using | VariableDomainId = LocalSearchState::VariableDomainId |
| using | NodeId = SubDagComputer::NodeId |
| using | ArcId = SubDagComputer::ArcId |
| typedef std::function< int64_t(int64_t)> | RoutingTransitCallback1 |
| typedef std::function< int64_t(int64_t, int64_t)> | RoutingTransitCallback2 |
| typedef std::function< const FloatSlopePiecewiseLinearFunction *(int64_t, int64_t)> | RoutingCumulDependentTransitCallback2 |
| typedef int | PathNodeIndex |
| using | NodeIndex = BlossomGraph::NodeIndex |
| using | CostValue = BlossomGraph::CostValue |
| typedef uint32_t | PathDistance |
| typedef util::ReverseArcStaticGraph | Graph |
| typedef std::function< MPSolverInterface *(MPSolver *)> | MPSolverInterfaceFactory |
| using | GScipSolution = absl::flat_hash_map<SCIP_VAR*, double> |
| using | GScipBranchingPriority = absl::flat_hash_map<SCIP_VAR*, int> |
| using | GScipMessageHandler |
| typedef std::function< int64_t(RoutingNodeIndex, RoutingNodeIndex)> | RoutingNodeEvaluator2 |
| using | Cost = double |
| using | BaseInt = int32_t |
| using | SubsetRange = util_intops::StrongIntRange<SubsetIndex> |
| using | ElementRange = util_intops::StrongIntRange<ElementIndex> |
| using | ColumnEntryRange = util_intops::StrongIntRange<ColumnEntryIndex> |
| using | SubsetCostVector = util_intops::StrongVector<SubsetIndex, Cost> |
| using | ElementCostVector = util_intops::StrongVector<ElementIndex, Cost> |
| using | SparseColumn = util_intops::StrongVector<ColumnEntryIndex, ElementIndex> |
| using | SparseRow = util_intops::StrongVector<RowEntryIndex, SubsetIndex> |
| using | ElementToIntVector = util_intops::StrongVector<ElementIndex, BaseInt> |
| using | SubsetToIntVector = util_intops::StrongVector<SubsetIndex, BaseInt> |
| using | SparseColumnView = util_intops::StrongVector<SubsetIndex, SparseColumnSparseColumn> |
| using | SparseRowView = util_intops::StrongVector<ElementIndex, SparseRow> |
| using | SubsetBoolVector = util_intops::StrongVector<SubsetIndex, bool> |
| using | ElementBoolVector = util_intops::StrongVector<ElementIndex, bool> |
| using | ElementToSubsetVector |
| using | CompressedColumn = CompressedStrongVector<ColumnEntryIndex, ElementIndex> |
| using | CompressedRow = CompressedStrongVector<RowEntryIndex, SubsetIndex> |
| using | CompressedColumnView |
| using | CompressedRowView |
| using | CompressedColumnIterator |
| using | CompressedRowIterator |
| using | CapacityWeight = int64_t |
| using | CapacityElements |
| using | CapacitySubsets |
| using | CapacityWeights |
| using | CL = SetCoverInvariant::ConsistencyLevel |
| template<typename IndexType, typename ValueType> | |
| using | StrictVector = glop::StrictITIVector<IndexType, ValueType> |
| using | BenchmarksTableRow |
| using | FullElementCostVector = util_intops::StrongVector<FullElementIndex, Cost> |
| using | FullSubsetCostVector = util_intops::StrongVector<FullSubsetIndex, Cost> |
| using | FullElementBoolVector = util_intops::StrongVector<FullElementIndex, bool> |
| using | FullSubsetBoolVector = util_intops::StrongVector<FullSubsetIndex, bool> |
| using | FullElementToIntVector |
| using | FullSubsetToIntVector |
| using | FullToCoreElementMapVector |
| using | CoreToFullElementMapVector |
| using | FullToCoreSubsetMapVector |
| using | CoreToFullSubsetMapVector |
| template<typename T, size_t alignment_bytes> | |
| using | AlignedAllocator |
| template<typename T, size_t alignment_bytes> | |
| using | AlignedVector = std::vector<T, AlignedAllocator<T, alignment_bytes>> |
| template<typename T> | |
| using | UnsafeDenseSet = DenseSet<T, false> |
| using | random_engine_t = std::mt19937_64 |
| typedef std::pair< int64_t, int64_t > | Fraction |
| template<class Iterator> | |
| using | value_type_t = typename std::iterator_traits<Iterator>::value_type |
| using | ScopedTimeDistributionUpdater = DisabledScopedTimeDistributionUpdater |
| using | ScopedTimeStats = DisabledScopedTimeStats |
| typedef ZVector< int8_t > | Int8ZVector |
| typedef ZVector< int16_t > | Int16ZVector |
| typedef ZVector< int32_t > | Int32ZVector |
| typedef ZVector< int64_t > | Int64ZVector |
| typedef ZVector< uint8_t > | UInt8ZVector |
| typedef ZVector< uint16_t > | UInt16ZVector |
| typedef ZVector< uint32_t > | UInt32ZVector |
| typedef ZVector< uint64_t > | UInt64ZVector |
Functions | |
| template<class Point, bool check_bounds = DEBUG_MODE> | |
| Point | BinarySearch (Point x_true, Point x_false, std::function< bool(Point)> f) |
| template<class Point> | |
| Point | BinarySearchMidpoint (Point x, Point y) |
| template<class Point, class Value> | |
| std::pair< Point, Value > | ConvexMinimum (absl::Span< const Point > sorted_points, std::function< Value(Point)> f) |
| template<class Point, class Value> | |
| std::pair< Point, Value > | ConvexMinimum (bool is_to_the_right, std::pair< Point, Value > current_min, absl::Span< const Point > sorted_points, std::function< Value(Point)> f) |
| template<class Point, class Value> | |
| std::pair< Point, Value > | RangeConvexMinimum (Point begin, Point end, absl::FunctionRef< Value(Point)> f) |
| template<class Point, class Value> | |
| std::pair< Point, Value > | RangeConvexMinimum (std::pair< Point, Value > current_min, Point begin, Point end, absl::FunctionRef< Value(Point)> f) |
| std::vector< int > | CountTriangles (const ::util::StaticGraph< int, int > &graph, int max_degree) |
| void | LocalBfs (const ::util::StaticGraph< int, int > &graph, int source, int stop_after_num_nodes, std::vector< int > *visited, std::vector< int > *num_within_radius, std::vector< bool > *tmp_mask) |
| bool | InputContainsNan (absl::Span< const std::vector< double > > input) |
| void | MinimizeLinearAssignment (absl::Span< const std::vector< double > > cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment) |
| void | MaximizeLinearAssignment (absl::Span< const std::vector< double > > cost, absl::flat_hash_map< int, int > *direct_assignment, absl::flat_hash_map< int, int > *reverse_assignment) |
| bool | CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder (const KnapsackItemWithEfficiency &item1, const KnapsackItemWithEfficiency &item2) |
| Select next search node to expand Select next item_i to | assign (using primary propagator) - Generate a new search node where item_i is in the knapsack - Check validity of this new partial solution(using propagators) - If valid |
| Select next search node to expand Select next item_i to add this new search node to the search Generate a new search node where item_i is not in the knapsack Check validity of this new partial | solution (using propagators) - If valid |
| absl::StatusOr< int64_t > | NChooseK (int64_t n, int64_t k) |
| template<typename T> | |
| void | RadixSort (absl::Span< T > values, int num_bits=sizeof(T) *8) |
| template<typename T> | |
| int | NumBitsForZeroTo (T max_value) |
| template<typename T, int radix_width, int num_passes> | |
| void | RadixSortTpl (absl::Span< T > values) |
| uint64_t | fasthash64 (const void *buf, size_t len, uint64_t seed) |
| static void | mix (uint64_t &a, uint64_t &b, uint64_t &c) |
| void | FixFlagsAndEnvironmentForSwig () |
| int32_t | strtoint32 (absl::string_view word) |
| int64_t | strtoint64 (absl::string_view word) |
| int32_t | atoi32 (absl::string_view word) |
| int64_t | atoi64 (absl::string_view word) |
| int64_t | GetProcessMemoryUsage () |
| int | OrToolsMajorVersion () |
| int | OrToolsMinorVersion () |
| int | OrToolsPatchVersion () |
| std::string | OrToolsVersionString () |
| template<class Var, class Element, class Proto, class Container> | |
| void | RealLoad (const AssignmentProto &assignment_proto, Container *const container, int(AssignmentProto::*GetSize)() const, const Proto &(AssignmentProto::*GetElem)(int) const) |
| template<class Var, class Element, class Proto, class Container> | |
| void | RealSave (AssignmentProto *const assignment_proto, const Container &container, Proto *(AssignmentProto::*Add)()) |
| template<class Container, class Element> | |
| void | RealDebugString (const Container &container, std::string *const out) |
| void | SetAssignmentFromAssignment (Assignment *target_assignment, const std::vector< IntVar * > &target_vars, const Assignment *source_assignment, const std::vector< IntVar * > &source_vars) |
| NOLINT. | |
| std::ostream & | operator<< (std::ostream &out, const Assignment &assignment) |
| void | InstallDemonProfiler (DemonProfiler *monitor) |
| DemonProfiler * | BuildDemonProfiler (Solver *solver) |
| void | DeleteDemonProfiler (DemonProfiler *monitor) |
| void | InstallLocalSearchProfiler (LocalSearchProfiler *monitor) |
| LocalSearchProfiler * | BuildLocalSearchProfiler (Solver *solver) |
| void | DeleteLocalSearchProfiler (LocalSearchProfiler *monitor) |
| void | CleanVariableOnFail (IntVar *var) |
| void | RestoreBoolValue (IntVar *var) |
| void | InternalSaveBooleanVarValue (Solver *const solver, IntVar *const var) |
| bool | ContinueAtLocalOptimum (Search *search) |
| bool | AcceptDelta (Search *search, Assignment *delta, Assignment *deltadelta) |
| void | AcceptNeighbor (Search *search) |
| void | AcceptUncheckedNeighbor (Search *search) |
| PropagationMonitor * | BuildTrace (Solver *s) |
| LocalSearchMonitor * | BuildLocalSearchMonitorPrimary (Solver *s) |
| ModelCache * | BuildModelCache (Solver *solver) |
| PropagationMonitor * | BuildPrintTrace (Solver *s) |
| std::ostream & | operator<< (std::ostream &out, const Solver *const s) |
| std::ostream & | operator<< (std::ostream &out, const BaseObject *const o) |
| int64_t | CpRandomSeed () |
| int64_t | Zero () |
| NOLINT. | |
| int64_t | One () |
| This method returns 1. | |
| uint64_t | Hash1 (uint64_t value) |
| Hash functions. | |
| uint64_t | Hash1 (uint32_t value) |
| uint64_t | Hash1 (int64_t value) |
| uint64_t | Hash1 (int value) |
| uint64_t | Hash1 (void *const ptr) |
| template<class T> | |
| uint64_t | Hash1 (const std::vector< T * > &ptrs) |
| uint64_t | Hash1 (const std::vector< int64_t > &ptrs) |
| LocalSearchOperator * | MakeTwoOpt (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) |
| --— 2Opt --— | |
| LocalSearchOperator * | MakeRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr, int64_t chain_length=1LL, bool single_path=false, const std::string &name="Relocate") |
| --— Relocate --— | |
| LocalSearchOperator * | MakeExchange (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) |
| --— Exchange --— | |
| LocalSearchOperator * | MakeCross (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) |
| --— Cross --— | |
| LocalSearchOperator * | MakeActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors=nullptr, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors=nullptr) |
| --— MakeActive --— | |
| LocalSearchOperator * | RelocateAndMakeActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| -— RelocateAndMakeActive --— | |
| LocalSearchOperator * | ExchangeAndMakeActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| LocalSearchOperator * | ExchangePathStartEndsAndMakeActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| LocalSearchOperator * | MakeActiveAndRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— MakeActiveAndRelocate --— | |
| LocalSearchOperator * | MakeInactive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— MakeInactive --— | |
| LocalSearchOperator * | RelocateAndMakeInactive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— RelocateAndMakeInactive --— | |
| LocalSearchOperator * | MakeChainInactive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— MakeChainInactive --— | |
| LocalSearchOperator * | MakeSwapActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— SwapActive --— | |
| LocalSearchOperator * | MakeSwapActiveChain (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, int max_chain_size) |
| --— SwapActiveChain --— | |
| LocalSearchOperator * | MakeExtendedSwapActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class) |
| --— ExtendedSwapActive --— | |
| LocalSearchOperator * | MakeTSPOpt (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, Solver::IndexEvaluator3 evaluator, int chain_length) |
| --— TSP-based operators --— | |
| LocalSearchOperator * | MakeTSPLns (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, Solver::IndexEvaluator3 evaluator, int tsp_size) |
| LocalSearchOperator * | MakeLinKernighan (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, const Solver::IndexEvaluator3 &evaluator, bool topt) |
| --— Lin-Kernighan --— | |
| LocalSearchOperator * | MakePathLns (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, int number_of_chunks, int chunk_size, bool unactive_fragments) |
| --— Path-based Large Neighborhood Search --— | |
| template<class T> | |
| bool | IsArrayConstant (const std::vector< T > &values, const T &value) |
| template<class T> | |
| bool | IsArrayBoolean (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllOnes (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllNull (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllGreaterOrEqual (const std::vector< T > &values, const T &value) |
| template<class T> | |
| bool | AreAllLessOrEqual (const std::vector< T > &values, const T &value) |
| template<class T> | |
| bool | AreAllPositive (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllNegative (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllStrictlyPositive (const std::vector< T > &values) |
| template<class T> | |
| bool | AreAllStrictlyNegative (const std::vector< T > &values) |
| template<class T> | |
| bool | IsIncreasingContiguous (const std::vector< T > &values) |
| template<class T> | |
| bool | IsIncreasing (const std::vector< T > &values) |
| template<class T> | |
| bool | IsArrayInRange (const std::vector< IntVar * > &vars, T range_min, T range_max) |
| bool | AreAllBound (const std::vector< IntVar * > &vars) |
| bool | AreAllBooleans (const std::vector< IntVar * > &vars) |
| template<class T> | |
| bool | AreAllBoundOrNull (const std::vector< IntVar * > &vars, const std::vector< T > &values) |
| bool | AreAllBoundTo (const std::vector< IntVar * > &vars, int64_t value) |
| Returns true if all variables are assigned to 'value'. | |
| int64_t | MaxVarArray (const std::vector< IntVar * > &vars) |
| int64_t | MinVarArray (const std::vector< IntVar * > &vars) |
| void | FillValues (const std::vector< IntVar * > &vars, std::vector< int64_t > *const values) |
| int64_t | PosIntDivUp (int64_t e, int64_t v) |
| int64_t | PosIntDivDown (int64_t e, int64_t v) |
| std::vector< int64_t > | ToInt64Vector (const std::vector< int > &input) |
| std::string | DefaultPhaseStatString (DecisionBuilder *db) |
| void | RegisterDemon (Solver *const solver, Demon *const demon, DemonProfiler *const monitor) |
| void | DemonProfilerAddFakeRun (DemonProfiler *const monitor, Demon *const demon, int64_t start_time, int64_t end_time, bool is_fail) |
| void | DemonProfilerExportInformation (DemonProfiler *const monitor, const Constraint *const constraint, int64_t *const fails, int64_t *const initial_propagation_runtime, int64_t *const demon_invocations, int64_t *const total_demon_runtime, int *const demon_count) |
| void | DemonProfilerBeginInitialPropagation (DemonProfiler *const monitor, Constraint *const constraint) |
| void | DemonProfilerEndInitialPropagation (DemonProfiler *const monitor, Constraint *const constraint) |
| void | LinkVarExpr (Solver *s, IntExpr *expr, IntVar *var) |
| Constraint * | SetIsEqual (IntVar *const var, absl::Span< const int64_t > values, const std::vector< IntVar * > &vars) |
| Constraint * | SetIsGreaterOrEqual (IntVar *const var, absl::Span< const int64_t > values, const std::vector< IntVar * > &vars) |
| IntExpr * | BuildStartExpr (IntervalVar *var) |
| IntExpr * | BuildDurationExpr (IntervalVar *var) |
| IntExpr * | BuildEndExpr (IntervalVar *var) |
| IntExpr * | BuildSafeStartExpr (IntervalVar *var, int64_t unperformed_value) |
| IntExpr * | BuildSafeDurationExpr (IntervalVar *var, int64_t unperformed_value) |
| IntExpr * | BuildSafeEndExpr (IntervalVar *var, int64_t unperformed_value) |
| std::unique_ptr< BinCapacities > | MakeBinCapacities (const std::vector< RoutingDimension * > &dimensions, const PathsMetadata &paths_metadata) |
| void | FillPathEvaluation (absl::Span< const int64_t > path, const RoutingModel::TransitCallback2 &evaluator, std::vector< int64_t > *values) |
| bool | SolveModelWithSat (RoutingModel *model, RoutingSearchStats *search_stats, const RoutingSearchParameters &search_parameters, const operations_research::Assignment *initial_solution, operations_research::Assignment *solution) |
| Constraint * | MakeDifferentFromValues (Solver *solver, IntVar *var, std::vector< int64_t > values) |
| Constraint * | MakeResourceConstraint (const RoutingModel::ResourceGroup *resource_group, const std::vector< IntVar * > *vehicle_resource_vars, RoutingModel *model) |
| Constraint * | MakePathSpansAndTotalSlacks (const RoutingDimension *dimension, std::vector< IntVar * > spans, std::vector< IntVar * > total_slacks) |
| Constraint * | MakeRouteConstraint (RoutingModel *model, std::vector< IntVar * > route_cost_vars, std::function< std::optional< int64_t >(const std::vector< int64_t > &)> route_evaluator) |
| Constraint * | MakeGlobalVehicleBreaksConstraint (Solver *solver, const RoutingDimension *dimension) |
| Constraint * | MakeNumActiveVehiclesCapacityConstraint (Solver *solver, std::vector< IntVar * > transit_vars, std::vector< IntVar * > active_vars, std::vector< IntVar * > vehicle_active_vars, std::vector< int64_t > vehicle_capacities, int max_active_vehicles, bool enforce_active_vehicles) |
| DecisionBuilder * | MakeSetValuesFromTargets (Solver *solver, std::vector< IntVar * > variables, std::vector< int64_t > targets) |
| DecisionBuilder * | MakeSetCumulsFromLocalDimensionCosts (Solver *solver, LocalDimensionCumulOptimizer *lp_optimizer, LocalDimensionCumulOptimizer *mp_optimizer, bool optimize_and_pack, std::vector< RoutingModel::RouteDimensionTravelInfo > dimension_travel_info_per_route) |
| DecisionBuilder * | MakeSetCumulsFromGlobalDimensionCosts (Solver *solver, GlobalDimensionCumulOptimizer *global_optimizer, GlobalDimensionCumulOptimizer *global_mp_optimizer, bool optimize_and_pack=false, std::vector< RoutingModel::RouteDimensionTravelInfo > dimension_travel_info_per_route={}) |
| Variant based on global optimizers, handling all routes together. | |
| DecisionBuilder * | MakeRestoreDimensionValuesForUnchangedRoutes (RoutingModel *model) |
| bool | PropagateTransitAndSpan (int path, DimensionValues &dimension_values) |
| template<typename T> | |
| void | DefragmentRanges (std::vector< T > &mutable_input, CommittableArray< IndexRange > &ranges, std::vector< T > &temp_container) |
| IntVarLocalSearchFilter * | MakeRouteConstraintFilter (const RoutingModel &routing_model) |
| Returns a filter tracking route constraints. | |
| IntVarLocalSearchFilter * | MakeMaxActiveVehiclesFilter (const RoutingModel &routing_model) |
| Returns a filter ensuring that max active vehicles constraints are enforced. | |
| IntVarLocalSearchFilter * | MakeActiveNodeGroupFilter (const RoutingModel &routing_model) |
| IntVarLocalSearchFilter * | MakeOrderedActivityGroupFilter (const RoutingModel &routing_model) |
| IntVarLocalSearchFilter * | MakeNodeDisjunctionFilter (const RoutingModel &routing_model, bool filter_cost) |
| Returns a filter ensuring that node disjunction constraints are enforced. | |
| IntVarLocalSearchFilter * | MakeVehicleAmortizedCostFilter (const RoutingModel &routing_model) |
| Returns a filter computing vehicle amortized costs. | |
| IntVarLocalSearchFilter * | MakeSameVehicleCostFilter (const RoutingModel &routing_model) |
| Returns a filter computing same vehicle costs. | |
| IntVarLocalSearchFilter * | MakeTypeRegulationsFilter (const RoutingModel &routing_model) |
| Returns a filter ensuring type regulation constraints are enforced. | |
| bool | FillDimensionValuesFromRoutingDimension (int path, int64_t capacity, int64_t span_upper_bound, absl::Span< const DimensionValues::Interval > cumul_of_node, absl::Span< const DimensionValues::Interval > slack_of_node, absl::AnyInvocable< int64_t(int64_t, int64_t) const > evaluator, DimensionValues &dimension_values) |
| void | FillPrePostVisitValues (int path, const DimensionValues &dimension_values, std::optional< absl::AnyInvocable< int64_t(int64_t, int64_t) const > > pre_travel_evaluator, std::optional< absl::AnyInvocable< int64_t(int64_t, int64_t) const > > post_travel_evaluator, PrePostVisitValues &visit_values) |
| bool | PropagateLightweightVehicleBreaks (int path, DimensionValues &dimension_values, absl::Span< const std::pair< int64_t, int64_t > > interbreaks) |
| IntVarLocalSearchFilter * | MakePathCumulFilter (const RoutingDimension &dimension, bool propagate_own_objective_value, bool filter_objective_cost, bool may_use_optimizers) |
| Returns a filter handling dimension costs and constraints. | |
| void | AppendLightWeightDimensionFilters (const PathState *path_state, const std::vector< RoutingDimension * > &dimensions, std::vector< LocalSearchFilterManager::FilterEvent > *filters) |
| void | AppendDimensionCumulFilters (const std::vector< RoutingDimension * > &dimensions, const RoutingSearchParameters ¶meters, bool filter_objective_cost, bool use_chain_cumul_filter, std::vector< LocalSearchFilterManager::FilterEvent > *filters) |
| LocalSearchFilter * | MakePickupDeliveryFilter (const RoutingModel &routing_model, const PathState *path_state, absl::Span< const PickupDeliveryPair > pairs, const std::vector< RoutingModel::PickupAndDeliveryPolicy > &vehicle_policies) |
| LocalSearchFilter * | MakeVehicleVarFilter (const RoutingModel &routing_model, const PathState *path_state) |
| Returns a filter checking that vehicle variable domains are respected. | |
| IntVarLocalSearchFilter * | MakeCumulBoundsPropagatorFilter (const RoutingDimension &dimension) |
| Returns a filter handling dimension cumul bounds. | |
| IntVarLocalSearchFilter * | MakeGlobalLPCumulFilter (GlobalDimensionCumulOptimizer *lp_optimizer, GlobalDimensionCumulOptimizer *mp_optimizer, bool filter_objective_cost) |
| Returns a filter checking global linear constraints and costs. | |
| LocalSearchFilter * | MakeResourceAssignmentFilter (LocalDimensionCumulOptimizer *lp_optimizer, LocalDimensionCumulOptimizer *mp_optimizer, bool propagate_own_objective_value, bool filter_objective_cost) |
| IntVarLocalSearchFilter * | MakeCPFeasibilityFilter (RoutingModel *routing_model) |
| Returns a filter checking the current solution using CP propagation. | |
| LocalSearchFilter * | MakePathStateFilter (Solver *solver, std::unique_ptr< PathState > path_state, const std::vector< IntVar * > &nexts) |
| LocalSearchFilter * | MakeDimensionFilter (Solver *solver, std::unique_ptr< DimensionChecker > checker, absl::string_view dimension_name) |
| LocalSearchFilter * | MakeLightVehicleBreaksFilter (Solver *solver, std::unique_ptr< LightVehicleBreaksChecker > checker, absl::string_view dimension_name) |
| LocalSearchFilter * | MakePathEnergyCostFilter (Solver *solver, std::unique_ptr< PathEnergyCostChecker > checker, absl::string_view dimension_name) |
| DecisionBuilder * | MakeRuinAndRecreateDecisionBuilder (const RoutingSearchParameters ¶meters, RoutingModel *model, std::mt19937 *rnd, const Assignment *assignment, std::function< bool()> stop_search, LocalSearchFilterManager *filter_manager) |
| DecisionBuilder * | MakePerturbationDecisionBuilder (const RoutingSearchParameters ¶meters, RoutingModel *model, std::mt19937 *rnd, const Assignment *assignment, std::function< bool()> stop_search, LocalSearchFilterManager *filter_manager) |
| std::unique_ptr< NeighborAcceptanceCriterion > | MakeNeighborAcceptanceCriterion (const RoutingModel &model, const AcceptanceStrategy &acceptance_strategy, const NeighborAcceptanceCriterion::SearchState &final_search_state, std::mt19937 *rnd) |
| std::pair< double, double > | GetSimulatedAnnealingTemperatures (const RoutingModel &model, const SimulatedAnnealingAcceptanceStrategy &sa_params, std::mt19937 *rnd) |
| RecreateParameters::ParametersCase | GetParameterCaseForRecreateHeuristic (FirstSolutionStrategy::Value recreate_heuristic) |
| std::vector< RecreateParameters::ParametersCase > | GetSupportedRecreateParametersCases () |
| std::string | GetRecreateParametersName (RecreateParameters::ParametersCase parameters_case) |
| std::vector< SlopeAndYIntercept > | PiecewiseLinearFunctionToSlopeAndYIntercept (const FloatSlopePiecewiseLinearFunction &pwl_function, int index_start, int index_end) |
| std::vector< bool > | SlopeAndYInterceptToConvexityRegions (absl::Span< const SlopeAndYIntercept > slope_and_y_intercept) |
| bool | ComputeVehicleToResourceClassAssignmentCosts (int v, double solve_duration_ratio, const RoutingModel::ResourceGroup &resource_group, const util_intops::StrongVector< RoutingModel::ResourceClassIndex, absl::flat_hash_set< int > > &ignored_resources_per_class, const std::function< int64_t(int64_t)> &next_accessor, const std::function< int64_t(int64_t, int64_t)> &transit_accessor, bool optimize_vehicle_costs, LocalDimensionCumulOptimizer *lp_optimizer, LocalDimensionCumulOptimizer *mp_optimizer, std::vector< int64_t > *assignment_costs, std::vector< std::vector< int64_t > > *cumul_values, std::vector< std::vector< int64_t > > *break_values) |
| int64_t | ComputeBestVehicleToResourceAssignment (absl::Span< const int > vehicles, const util_intops::StrongVector< RoutingModel::ResourceClassIndex, std::vector< int > > &resource_indices_per_class, const util_intops::StrongVector< RoutingModel::ResourceClassIndex, absl::flat_hash_set< int > > &ignored_resources_per_class, std::function< const std::vector< int64_t > *(int)> vehicle_to_resource_class_assignment_costs, std::vector< int > *resource_indices) |
| std::string | Int64ToStr (int64_t number) |
| std::string | DomainToString (const ::google::protobuf::RepeatedField< int64_t > *domain) |
| std::string | VariableToString (std::pair< sat::IntegerVariableProto, int > &variable_pair, const sat::CpSolverResponse &response_) |
| std::string | ConstraintToString (const sat::ConstraintProto &constraint, const sat::CpModelProto &model_, bool show_enforcement=true) |
| std::string | VariablesToString (absl::flat_hash_map< std::string, std::pair< sat::IntegerVariableProto, int > > &variables, absl::flat_hash_map< std::string, std::vector< int > > &variable_instances, absl::flat_hash_map< std::string, absl::flat_hash_set< std::string > > &variable_childs, const sat::CpSolverResponse &response_, absl::string_view variable, std::string prefix="") |
| LocalSearchOperator * | MakeRelocateNeighbors (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, RoutingTransitCallback2 arc_evaluator) |
| LocalSearchOperator * | MakeRelocateNeighbors (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, RoutingTransitCallback2 arc_evaluator) |
| LocalSearchOperator * | MakeTwoOptWithShortestPath (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::vector< std::vector< int64_t > > alternative_sets, RoutingTransitCallback2 arc_evaluator) |
| LocalSearchOperator * | MakeSwapActiveToShortestPath (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::vector< std::vector< int64_t > > alternative_sets, RoutingTransitCallback2 arc_evaluator) |
| LocalSearchOperator * | MakePairActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakePairInactive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakePairRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakeGroupPairAndRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakeGroupPairAndRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakeLightPairRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, const std::vector< PickupDeliveryPair > &pairs, std::function< bool(int64_t)> force_lifo) |
| LocalSearchOperator * | MakeLightPairRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs, std::function< bool(int64_t)> force_lifo) |
| LocalSearchOperator * | MakePairExchange (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakePairExchange (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakePairExchangeRelocate (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakeIndexPairSwapActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| LocalSearchOperator * | MakeRelocateExpensiveChain (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, int num_arcs_to_consider, std::function< int64_t(int64_t, int64_t, int64_t)> arc_cost_for_path_start) |
| LocalSearchOperator * | MakeRelocateSubtrip (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, absl::Span< const PickupDeliveryPair > pairs) |
| LocalSearchOperator * | MakeRelocateSubtrip (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, absl::Span< const PickupDeliveryPair > pairs) |
| LocalSearchOperator * | MakeExchangeSubtrip (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, std::function< const std::vector< int > &(int, int)> get_incoming_neighbors, std::function< const std::vector< int > &(int, int)> get_outgoing_neighbors, absl::Span< const PickupDeliveryPair > pairs) |
| LocalSearchOperator * | MakeExchangeSubtrip (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, absl::Span< const PickupDeliveryPair > pairs) |
| template<bool swap_first> | |
| LocalSearchOperator * | MakePairNodeSwapActive (Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, std::function< int(int64_t)> start_empty_path_class, const std::vector< PickupDeliveryPair > &pairs) |
| RoutingModelParameters | DefaultRoutingModelParameters () |
| RoutingSearchParameters | DefaultRoutingSearchParameters () |
| RoutingSearchParameters | DefaultSecondaryRoutingSearchParameters () |
| std::string | FindErrorInRoutingSearchParameters (const RoutingSearchParameters &search_parameters) |
| std::vector< std::string > | FindErrorsInRoutingSearchParameters (const RoutingSearchParameters &search_parameters) |
| std::vector< LocalCheapestInsertionParameters::InsertionSortingProperty > | GetLocalCheapestInsertionSortingProperties (absl::Span< const int > lci_insertion_sorting_properties) |
| void | DisableAllLocalSearchOperators (RoutingSearchParameters::LocalSearchNeighborhoodOperators *operators) |
| const Assignment * | SolveWithAlternativeSolvers (RoutingModel *primary_model, const std::vector< RoutingModel * > &alternative_models, const RoutingSearchParameters ¶meters, int max_non_improving_iterations) |
| const Assignment * | SolveFromAssignmentWithAlternativeSolvers (const Assignment *assignment, RoutingModel *primary_model, const std::vector< RoutingModel * > &alternative_models, const RoutingSearchParameters ¶meters, int max_non_improving_iterations) |
| const Assignment * | SolveFromAssignmentWithAlternativeSolversAndParameters (const Assignment *assignment, RoutingModel *primary_model, const RoutingSearchParameters &primary_parameters, const std::vector< RoutingModel * > &alternative_models, const std::vector< RoutingSearchParameters > &alternative_parameters, int max_non_improving_iterations) |
| FirstSolutionStrategy::Value | AutomaticFirstSolutionStrategy (bool has_pickup_deliveries, bool has_node_precedences, bool has_single_vehicle_node) |
| std::vector< int64_t > | ComputeVehicleEndChainStarts (const RoutingModel &model) |
| DecisionBuilder * | MakeSweepDecisionBuilder (RoutingModel *model, bool check_assignment) |
| DecisionBuilder * | MakeAllUnperformed (RoutingModel *model) |
| DEFINE_STRONG_INDEX_TYPE (RoutingNodeIndex) | |
| DEFINE_STRONG_INDEX_TYPE (RoutingCostClassIndex) | |
| DEFINE_STRONG_INDEX_TYPE (RoutingDimensionIndex) | |
| DEFINE_STRONG_INDEX_TYPE (RoutingDisjunctionIndex) | |
| DEFINE_STRONG_INDEX_TYPE (RoutingVehicleClassIndex) | |
| DEFINE_STRONG_INDEX_TYPE (RoutingResourceClassIndex) | |
| bool | FindMostExpensiveArcsOnRoute (int num_arcs, int64_t start, const std::function< int64_t(int64_t)> &next_accessor, const std::function< bool(int64_t)> &is_end, const std::function< int64_t(int64_t, int64_t, int64_t)> &arc_cost_for_route_start, std::vector< std::pair< int64_t, int > > *most_expensive_arc_starts_and_ranks, std::pair< int, int > *first_expensive_arc_indices) |
| BaseAssignVariables::Mode | ChooseMode (Solver::IntValueStrategy val_str) |
| template<typename NodeIndex, typename DistanceType> | |
| std::pair< DistanceType, std::vector< NodeIndex > > | SimpleOneToOneShortestPath (NodeIndex source, NodeIndex destination, absl::Span< const NodeIndex > tails, absl::Span< const NodeIndex > heads, absl::Span< const DistanceType > lengths, DistanceType limit=std::numeric_limits< DistanceType >::max()) |
| template<typename CostType, typename WeightFunctionType, typename GraphType> | |
| absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > | ComputeMinimumWeightMatching (const GraphType &graph, const WeightFunctionType &weight) |
| template<typename WeightFunctionType, typename GraphType> | |
| absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > | ComputeMinimumWeightMatchingWithMIP (const GraphType &graph, const WeightFunctionType &weight) |
| void | FindCliques (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int > &)> callback) |
| void | CoverArcsByCliques (std::function< bool(int, int)> graph, int node_count, std::function< bool(const std::vector< int > &)> callback) |
| std::vector< Bitset64< int64_t > > | ComputeDagConnectivity (absl::Span< const std::pair< int, int > > arcs, bool *error_was_cyclic, std::vector< int > *error_cycle_out) |
| std::vector< Bitset64< int64_t > > | ComputeDagConnectivityOrDie (absl::Span< const std::pair< int, int > > arcs) |
| PathWithLength | ConstrainedShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLengthAndResources > arcs_with_length_and_resources, int source, int destination, const std::vector< double > &max_resources) |
| PathWithLength | ShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLength > arcs_with_length, const int source, const int destination) |
| std::vector< PathWithLength > | KShortestPathsOnDag (const int num_nodes, absl::Span< const ArcWithLength > arcs_with_length, const int source, const int destination, const int path_count) |
| template<class GraphType, typename ArcLengths> | |
| absl::Status | TopologicalOrderIsValid (const GraphType &graph, absl::Span< const typename GraphType::NodeIndex > topological_order) |
| template<typename GraphType> | |
| std::vector< typename GraphType::NodeIndex > | NodePathImpliedBy (absl::Span< const typename GraphType::ArcIndex > arc_path, const GraphType &graph) |
| template<class GraphType> | |
| void | CheckNodeIsValid (typename GraphType::NodeIndex node, const GraphType &graph) |
| template<class GraphType> | |
| absl::Status | TopologicalOrderIsValid (const GraphType &graph, absl::Span< const typename GraphType::NodeIndex > topological_order) |
| template<typename Graph> | |
| bool | IsEulerianGraph (const Graph &graph, bool assume_connectivity=true) |
| template<typename NodeIndex, typename Graph> | |
| bool | IsSemiEulerianGraph (const Graph &graph, std::vector< NodeIndex > *odd_nodes, bool assume_connectivity=true) |
| template<typename NodeIndex, typename Graph> | |
| std::vector< NodeIndex > | BuildEulerianPathFromNode (const Graph &graph, NodeIndex root) |
| template<typename NodeIndex, typename Graph> | |
| std::vector< NodeIndex > | BuildEulerianTourFromNode (const Graph &graph, NodeIndex root, bool assume_connectivity=true) |
| template<typename Graph> | |
| std::vector< typename Graph::NodeIndex > | BuildEulerianTour (const Graph &graph, bool assume_connectivity=true) |
| template<typename Graph> | |
| std::vector< typename Graph::NodeIndex > | BuildEulerianPath (const Graph &graph, bool assume_connectivity=true) |
| template<typename CostType, typename CostFunction> | |
| HamiltonianPathSolver< CostType, CostFunction > | MakeHamiltonianPathSolver (int num_nodes, CostFunction cost) |
| template<class GraphType> | |
| KShortestPaths< GraphType > | YenKShortestPaths (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, typename GraphType::NodeIndex source, typename GraphType::NodeIndex destination, unsigned k) |
| template<typename Graph> | |
| std::vector< typename Graph::ArcIndex > | BuildKruskalMinimumSpanningTreeFromSortedArcs (const Graph &graph, absl::Span< const typename Graph::ArcIndex > sorted_arcs) |
| template<typename Graph, typename ArcComparator> | |
| std::vector< typename Graph::ArcIndex > | BuildKruskalMinimumSpanningTree (const Graph &graph, const ArcComparator &arc_comparator) |
| template<typename Graph, typename ArcValue> | |
| std::vector< typename Graph::ArcIndex > | BuildPrimMinimumSpanningTree (const Graph &graph, const ArcValue &arc_value) |
| std::vector< bool > | BipartiteMinimumVertexCover (const std::vector< std::vector< int > > &left_to_right_arcs, int num_right) |
| template<class DistanceType> | |
| std::ostream & | operator<< (std::ostream &out, DistanceAndParentArc< DistanceType > distance_and_parent_arc) |
| template<class DistanceType, class Graph, class ArcLengthFunctor, class SettledNodeCallbackType> | |
| std::vector< absl::flat_hash_map< int, DistanceAndParentArc< DistanceType > > > | MultiDijkstra (const Graph &graph, ArcLengthFunctor arc_length_functor, const std::vector< std::vector< int > > &source_sets, SettledNodeCallbackType settled_node_callback) |
| template<typename Graph> | |
| absl::StatusOr< RootedTree< typename Graph::NodeType > > | RootedTreeFromGraph (typename Graph::NodeType root, const Graph &graph, std::vector< typename Graph::NodeType > *topological_order=nullptr, std::vector< typename Graph::NodeType > *depths=nullptr) |
| template<typename Graph> | |
| absl::StatusOr< RootedTree< typename Graph::NodeIndex > > | RootedTreeFromGraph (const typename Graph::NodeIndex root, const Graph &graph, std::vector< typename Graph::NodeIndex > *const topological_order, std::vector< typename Graph::NodeIndex > *const depths) |
| template<class GraphType> | |
| void | GetGraphNodes (const GraphType &graph, std::vector< typename GraphType::NodeIndex > *nodes) |
| template<class GraphType> | |
| void | GetGraphNodesFromGraph (const GraphType &graph, std::vector< typename GraphType::NodeIndex > *nodes) |
| template<class GraphType> | |
| void | ComputeOneToAllShortestPaths (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, typename GraphType::NodeIndex source, GenericPathContainer< GraphType > *const path_container) |
| template<class GraphType> | |
| void | ComputeOneToManyShortestPaths (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, typename GraphType::NodeIndex source, const std::vector< typename GraphType::NodeIndex > &destinations, GenericPathContainer< GraphType > *const path_container) |
| template<class GraphType> | |
| std::vector< typename GraphType::NodeIndex > | ComputeOneToOneShortestPath (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, typename GraphType::NodeIndex source, typename GraphType::NodeIndex destination) |
| template<class GraphType> | |
| void | ComputeManyToAllShortestPathsWithMultipleThreads (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< typename GraphType::NodeIndex > &sources, int num_threads, GenericPathContainer< GraphType > *const path_container) |
| template<class GraphType> | |
| void | ComputeAllToAllShortestPathsWithMultipleThreads (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, int num_threads, GenericPathContainer< GraphType > *const path_container) |
| template<class GraphType> | |
| void | ComputeManyToManyShortestPathsWithMultipleThreads (const GraphType &graph, const std::vector< PathDistance > &arc_lengths, const std::vector< typename GraphType::NodeIndex > &sources, const std::vector< typename GraphType::NodeIndex > &destinations, int num_threads, GenericPathContainer< GraphType > *const paths) |
| void | ConvertFlowModelToDimacs (const FlowModelProto &flow_model, std::string *dimacs) |
| bool | ConvertDimacsToFlowModel (absl::string_view file, FlowModelProto *flow_model) |
| void | SolveMinCostFlow (const FlowModelProto &flow_model, double *loading_time, double *solving_time) |
| template<typename GraphType> | |
| void | SolveMaxFlow (const FlowModelProto &flow_model, double *loading_time, double *solving_time, std::function< void(GraphType *graph)> configure_graph_options=nullptr) |
| testing::Matcher< std::string > | EmptyOrGurobiLicenseWarning () |
| testing::Matcher< std::string > | EmptyOrGurobiLicenseWarningIfGurobi (const bool is_gurobi) |
| MPSolver::ResultStatus | GlopToMPSolverResultStatus (glop::ProblemStatus s) |
| MPSolver::BasisStatus | GlopToMPSolverVariableStatus (glop::VariableStatus s) |
| glop::VariableStatus | MPSolverToGlopVariableStatus (MPSolver::BasisStatus s) |
| MPSolver::BasisStatus | GlopToMPSolverConstraintStatus (glop::ConstraintStatus s) |
| glop::ConstraintStatus | MPSolverToGlopConstraintStatus (MPSolver::BasisStatus s) |
| void | GLPKGatherInformationCallback (glp_tree *tree, void *info) |
| bool | GurobiIsCorrectlyInstalled () |
| absl::StatusOr< GRBenv * > | GetGurobiEnv () |
| std::string | GurobiParamInfoForLogging (GRBenv *grb, bool one_liner_output) |
| std::ostream & | operator<< (std::ostream &stream, const LinearExpr &linear_expr) |
| LinearExpr | operator+ (LinearExpr lhs, const LinearExpr &rhs) |
| LinearExpr | operator- (LinearExpr lhs, const LinearExpr &rhs) |
| LinearExpr | operator* (LinearExpr lhs, double rhs) |
| LinearExpr | operator/ (LinearExpr lhs, double rhs) |
| LinearExpr | operator* (double lhs, LinearExpr rhs) |
| LinearRange | operator<= (const LinearExpr &lhs, const LinearExpr &rhs) |
| LinearRange | operator== (const LinearExpr &lhs, const LinearExpr &rhs) |
| LinearRange | operator>= (const LinearExpr &lhs, const LinearExpr &rhs) |
| bool | SolverTypeIsMip (MPModelRequest::SolverType solver_type) |
| absl::string_view | ToString (MPSolver::OptimizationProblemType optimization_problem_type) |
| bool | AbslParseFlag (const absl::string_view text, MPSolver::OptimizationProblemType *solver_type, std::string *error) |
| bool | MPSolverResponseStatusIsRpcError (MPSolverResponseStatus status) |
| bool | SolverTypeIsMip (MPSolver::OptimizationProblemType solver_type) |
| std::ostream & | operator<< (std::ostream &os, MPSolver::OptimizationProblemType optimization_problem_type) |
| std::ostream & | operator<< (std::ostream &os, MPSolver::ResultStatus status) |
| std::string | AbslUnparseFlag (MPSolver::OptimizationProblemType solver_type) |
| std::string | ToString (MPCallbackEvent event) |
| absl::StatusOr< std::string > | ExportModelAsLpFormat (const MPModelProto &model, const MPModelExportOptions &options) |
| absl::StatusOr< std::string > | ExportModelAsMpsFormat (const MPModelProto &model, const MPModelExportOptions &options) |
| absl::Status | WriteModelToMpsFile (absl::string_view filename, const MPModelProto &model, const MPModelExportOptions &options) |
| std::string | FindErrorInMPModelProto (const MPModelProto &model, double abs_value_threshold, const bool accept_trivially_infeasible_bounds) |
| std::optional< LazyMutableCopy< MPModelProto > > | ExtractValidMPModelOrPopulateResponseStatus (const MPModelRequest &request, MPSolutionResponse *response) |
| std::optional< LazyMutableCopy< MPModelProto > > | GetMPModelOrPopulateResponse (LazyMutableCopy< MPModelRequest > &request, MPSolutionResponse *response) |
| std::string | FindFeasibilityErrorInSolutionHint (const MPModelProto &model, double tolerance) |
| std::string | FindErrorInMPModelDeltaProto (const MPModelDeltaProto &delta, const MPModelProto &model) |
| void | MergeMPConstraintProtoExceptTerms (const MPConstraintProto &from, MPConstraintProto *to) |
| void | ApplyVerifiedMPModelDelta (const MPModelDeltaProto &delta, MPModelProto *model) |
| MPSolutionResponse | GlopSolveProto (LazyMutableCopy< MPModelRequest > request, std::atomic< bool > *interrupt_solve, std::function< void(const std::string &)> logging_callback) |
| std::string | GlopSolverVersion () |
| absl::Status | SetSolverSpecificParameters (absl::string_view parameters, GRBenv *gurobi) |
| absl::StatusOr< MPSolutionResponse > | GurobiSolveProto (LazyMutableCopy< MPModelRequest > request, GRBenv *gurobi_env) |
| absl::Status | SetSolverSpecificParameters (const std::string ¶meters, Highs &highs) |
| absl::StatusOr< MPSolutionResponse > | HighsSolveProto (LazyMutableCopy< MPModelRequest > request, HighsSolveInfo *solve_info) |
| absl::StatusOr< MPSolutionResponse > | PdlpSolveProto (LazyMutableCopy< MPModelRequest > request, const bool relax_integer_variables, const std::atomic< bool > *interrupt_solve) |
| bool | AreBoundsValid (Fractional lower_bound, Fractional upper_bound) |
| MPSolutionResponse | ConvertStatusOrMPSolutionResponse (bool log_error, absl::StatusOr< MPSolutionResponse > response) |
| template<typename P> | |
| std::string | EncodeParametersAsString (const P ¶meters) |
| MPSolutionResponse | SatSolveProtoInternal (LazyMutableCopy< MPModelRequest > request, sat::Model *sat_model, sat::CpSolverResponse *cp_response, std::function< void(const MPSolution &)> solution_callback) |
| MPSolutionResponse | SatSolveProto (LazyMutableCopy< MPModelRequest > request, std::atomic< bool > *interrupt_solve, std::function< void(const std::string &)> logging_callback, std::function< void(const MPSolution &)> solution_callback, std::function< void(const double)> best_bound_callback) |
| std::string | SatSolverVersion () |
| glop::ProblemStatus | ApplyMipPresolveSteps (const glop::GlopParameters &glop_params, MPModelProto *model, std::vector< std::unique_ptr< glop::Preprocessor > > *for_postsolve, SolverLogger *logger) |
| absl::Status | LegacyScipSetSolverSpecificParameters (absl::string_view parameters, SCIP *scip) |
| std::string | FindErrorInMPModelForScip (const MPModelProto &model, SCIP *scip) |
| absl::StatusOr< MPSolutionResponse > | ScipSolveProto (LazyMutableCopy< MPModelRequest > request) |
| bool | LinearConstraintIsViolated (const ScipConstraintHandlerContext &context, const LinearRange &constraint) |
| ScipSeparationResult | RunSeparation (internal::ScipCallbackRunner *runner, const ScipConstraintHandlerContext &context, absl::Span< SCIP_CONS * > constraints, bool is_integral) |
| template<typename Constraint> | |
| void | RegisterConstraintHandler (ScipConstraintHandler< Constraint > *handler, SCIP *scip) |
| template<typename ConstraintData> | |
| void | AddCallbackConstraint (SCIP *scip, ScipConstraintHandler< ConstraintData > *handler, const std::string &constraint_name, const ConstraintData *constraint_data, const ScipCallbackConstraintOptions &options) |
| template<typename ConstraintData> | |
| void | RegisterConstraintHandler (ScipConstraintHandler< ConstraintData > *handler, SCIP *scip) |
| MPSolutionResponse | SolveMPModel (LazyMutableCopy< MPModelRequest > request, const SolveInterrupter *absl_nullable interrupter) |
| bool | SolverTypeSupportsInterruption (const MPModelRequest::SolverType solver) |
| std::string | MPModelRequestLoggingInfo (const MPModelRequest &request) |
| std::string | getSolverVersion (XPRSprob const &prob) |
| bool | readParameter (XPRSprob const &prob, std::string const &name, std::string const &value) |
| void | printError (const XPRSprob &mLp, int line) |
| void XPRS_CC | XpressIntSolCallbackImpl (XPRSprob cbprob, void *cbdata) |
| void XPRS_CC | optimizermsg (XPRSprob prob, void *data, const char *sMsg, int nLen, int nMsgLvl) |
| int | getnumcols (const XPRSprob &mLp) |
| int | getnumrows (const XPRSprob &mLp) |
| int | getitcnt (const XPRSprob &mLp) |
| int | getnodecnt (const XPRSprob &mLp) |
| int | setobjoffset (const XPRSprob &mLp, double value) |
| void | addhint (const XPRSprob &mLp, int length, const double solval[], const int colind[]) |
| void | interruptXPRESS (XPRSprob &xprsProb, CUSTOM_INTERRUPT_REASON reason) |
| static int | MPSolverToXpressBasisStatus (MPSolver::BasisStatus mpsolver_basis_status) |
| static MPSolver::BasisStatus | XpressToMPSolverBasisStatus (int xpress_basis_status) |
| static std::map< std::string, int > & | getMapStringControls () |
| static std::map< std::string, int > & | getMapDoubleControls () |
| static std::map< std::string, int > & | getMapIntControls () |
| static std::map< std::string, int > & | getMapInt64Controls () |
| std::vector< int > | XpressBasisStatusesFrom (const std::vector< MPSolver::BasisStatus > &statuses) |
| template<class Container> | |
| void | splitMyString (const std::string &str, Container &cont, char delim=' ') |
| bool | stringToCharPtr (const std::string &var, const char **out) |
| absl::StatusOr< MPModelProto > | ModelProtoFromLpFormat (absl::string_view model) |
| absl::StatusOr< glop::DenseRow > | ParseSolFile (absl::string_view file_name, const glop::LinearProgram &model) |
| absl::StatusOr< MPSolutionResponse > | ParseSolFile (absl::string_view file_name, const MPModelProto &model) |
| absl::StatusOr< glop::DenseRow > | ParseSolString (const std::string &solution, const glop::LinearProgram &model) |
| absl::StatusOr< MPSolutionResponse > | ParseSolString (const std::string &solution, const MPModelProto &model) |
| const GScipVariableOptions & | DefaultGScipVariableOptions () |
| const GScipConstraintOptions & | DefaultGScipConstraintOptions () |
| SCIP_RESULT | ConvertGScipCallbackResult (const GScipCallbackResult result) |
| int | ConstraintHandlerResultPriority (const GScipCallbackResult result, const ConstraintHandlerCallbackType callback_type) |
| GScipCallbackResult | MergeConstraintHandlerResults (const GScipCallbackResult result1, const GScipCallbackResult result2, const ConstraintHandlerCallbackType callback_type) |
| SCIP_RETCODE | DropAllEvents (GScipEventHandler &handler) |
| GScipLinearExpr | GScipDifference (GScipLinearExpr left, const GScipLinearExpr &right) |
| GScipLinearExpr | GScipNegate (GScipLinearExpr expr) |
| GScipLinearRange | GScipLe (const GScipLinearExpr left, const GScipLinearExpr &right) |
| absl::Status | GScipCreateAbs (GScip *gscip, SCIP_Var *x, SCIP_Var *abs_x, absl::string_view name) |
| absl::Status | GScipCreateMaximum (GScip *gscip, const GScipLinearExpr &resultant, absl::Span< const GScipLinearExpr > terms, absl::string_view name) |
| absl::Status | GScipCreateMinimum (GScip *gscip, const GScipLinearExpr &resultant, absl::Span< const GScipLinearExpr > terms, absl::string_view name) |
| absl::Status | GScipAddQuadraticObjectiveTerm (GScip *gscip, std::vector< SCIP_Var * > quadratic_variables1, std::vector< SCIP_Var * > quadratic_variables2, std::vector< double > quadratic_coefficients, absl::string_view name) |
| absl::Status | GScipCreateIndicatorRange (GScip *gscip, const GScipIndicatorRangeConstraint &indicator_range, absl::string_view name, const GScipConstraintOptions &options) |
| void | GScipSetTimeLimit (absl::Duration time_limit, GScipParameters *parameters) |
| absl::Duration | GScipTimeLimit (const GScipParameters ¶meters) |
| bool | GScipTimeLimitSet (const GScipParameters ¶meters) |
| void | GScipSetMaxNumThreads (int num_threads, GScipParameters *parameters) |
| int | GScipMaxNumThreads (const GScipParameters ¶meters) |
| bool | GScipMaxNumThreadsSet (const GScipParameters ¶meters) |
| void | GScipSetLogLevel (GScipParameters *parameters, int log_level) |
| int | GScipLogLevel (const GScipParameters ¶meters) |
| bool | GScipLogLevelSet (const GScipParameters ¶meters) |
| void | GScipSetOutputEnabled (GScipParameters *parameters, bool output_enabled) |
| bool | GScipOutputEnabled (const GScipParameters ¶meters) |
| bool | GScipOutputEnabledSet (const GScipParameters ¶meters) |
| void | GScipSetRandomSeed (GScipParameters *parameters, int random_seed) |
| int | GScipRandomSeed (const GScipParameters ¶meters) |
| bool | GScipRandomSeedSet (const GScipParameters ¶meters) |
| void | GScipSetCatchCtrlC (const bool catch_ctrl_c, GScipParameters *const parameters) |
| bool | GScipCatchCtrlC (const GScipParameters ¶meters) |
| bool | GScipCatchCtrlCSet (const GScipParameters ¶meters) |
| void | DisableAllCutsExceptUserDefined (GScipParameters *parameters) |
| GScipParameters | TestGScipParameters () |
| std::string | SolutionToString (const GScipSolution &solution) |
| bool | SolutionsAlmostEqual (const GScipSolution &left, const GScipSolution &right, const double tolerance) |
| testing::Matcher< GScipSolution > | GScipSolutionEquals (const GScipSolution &rhs) |
| testing::Matcher< GScipSolution > | GScipSolutionAlmostEquals (const GScipSolution &rhs, double tolerance) |
| void | AssertOptimalWithBestSolution (const GScipResult &actual_result, const double expected_objective_value, const GScipSolution &expected_solution, const double tolerance) |
| void | AssertOptimalWithPartialBestSolution (const GScipResult &actual_result, const double expected_objective_value, const GScipSolution &expected_solution, const double tolerance) |
| void | ParseAndSolve (const std::string &filename, absl::string_view solver, const std::string ¶ms) |
| ::absl::Status | PortableFileSetContents (absl::string_view file_name, absl::string_view content) |
| ::absl::Status | PortableFileGetContents (absl::string_view file_name, std::string *output) |
| ::absl::Status | PortableDeleteFile (absl::string_view file_name) |
| std::string | ProtobufTextFormatPrintToStringForFlag (const google::protobuf::Message &proto) |
| std::string | ProtobufTextFormatPrintToStringForFlag (const google::protobuf::MessageLite &proto) |
| template<class P> | |
| std::string | ProtobufDebugString (const P &message) |
| template<class P> | |
| std::string | ProtobufShortDebugString (const P &message) |
| template<typename ProtoEnumType> | |
| std::string | ProtoEnumToString (ProtoEnumType enum_value) |
| template<typename ProtoType> | |
| bool | ProtobufTextFormatMergeFromString (absl::string_view proto_text_string, ProtoType *proto) |
| template<typename ProtoType> | |
| bool | ProtobufParseTextProtoForFlag (absl::string_view text, ProtoType *message_out, std::string *error_out) |
| int32_t | GetSeed (bool deterministic) |
| void | DisplayPlan (const RoutingIndexManager &manager, const RoutingModel &routing, const operations_research::Assignment &plan, bool use_same_vehicle_costs, int64_t max_nodes_per_group, int64_t same_vehicle_cost, absl::Span< const std::string > dimension_names) |
| void | Main () |
| DEFINE_STRONG_INT_TYPE (SubsetIndex, BaseInt) | |
| DEFINE_STRONG_INT_TYPE (ElementIndex, BaseInt) | |
| DEFINE_STRONG_INT_TYPE (ColumnEntryIndex, BaseInt) | |
| DEFINE_STRONG_INT_TYPE (RowEntryIndex, BaseInt) | |
| template<class Index> | |
| IndexRange (Index a, Index b) -> IndexRange< Index > | |
| template<typename T> | |
| IterableContainer (const T &data_source) -> IterableContainer< T > | |
| DEFINE_STRONG_INT_TYPE (CapacityTermIndex, BaseInt) | |
| constexpr SubsetIndex | kNotFound (-1) |
| std::vector< SubsetIndex > | ClearRandomSubsets (BaseInt num_subsets, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | ClearRandomSubsets (absl::Span< const SubsetIndex > focus, BaseInt num_subsets_to_choose, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | ClearMostCoveredElements (BaseInt max_num_subsets, SetCoverInvariant *inv) |
| std::vector< SubsetIndex > | ClearMostCoveredElements (absl::Span< const SubsetIndex > focus, BaseInt max_num_subsets, SetCoverInvariant *inv) |
| template<typename T> | |
| SetCoverModel::Stats | ComputeStats (std::vector< T > samples) |
| template<typename T> | |
| std::vector< T > | ComputeDeciles (std::vector< T > values) |
| SetCoverModel | ReadOrlibScp (absl::string_view filename) |
| SetCoverModel | ReadOrlibRail (absl::string_view filename) |
| SetCoverModel | ReadFimiDat (absl::string_view filename) |
| SetCoverModel | ReadSetCoverProto (absl::string_view filename, bool binary) |
| void | WriteOrlibScp (const SetCoverModel &model, absl::string_view filename) |
| void | WriteOrlibRail (const SetCoverModel &model, absl::string_view filename) |
| void | WriteSetCoverProto (const SetCoverModel &model, absl::string_view filename, bool binary) |
| SubsetBoolVector | ReadSetCoverSolutionText (absl::string_view filename) |
| SubsetBoolVector | ReadSetCoverSolutionProto (absl::string_view filename, bool binary) |
| void | WriteSetCoverSolutionText (const SetCoverModel &model, const SubsetBoolVector &solution, absl::string_view filename) |
| void | WriteSetCoverSolutionProto (const SetCoverModel &model, const SubsetBoolVector &solution, absl::string_view filename, bool binary) |
| int64_t | RunTimeInMicroseconds (const SetCoverSolutionGenerator &gen) |
| int64_t | RunTimeInNanoseconds (const SetCoverSolutionGenerator &gen) |
| void | LogStats (const SetCoverModel &model) |
| void | LogCostAndTiming (const absl::string_view problem_name, absl::string_view alg_name, const SetCoverInvariant &inv, int64_t run_time) |
| void | LogCostAndTiming (const SetCoverSolutionGenerator &generator) |
| FileFormat | ParseFileFormat (const std::string &format_name) |
| SetCoverModel | ReadModel (absl::string_view filename, FileFormat format) |
| SubsetBoolVector | ReadSolution (absl::string_view filename, FileFormat format) |
| void | WriteModel (const SetCoverModel &model, const std::string &filename, FileFormat format) |
| void | WriteSolution (const SetCoverModel &model, const SubsetBoolVector &solution, absl::string_view filename, FileFormat format) |
| SetCoverInvariant | RunLazyElementDegree (SetCoverModel *model) |
| SetCoverInvariant | RunGreedy (SetCoverModel *model) |
| std::vector< BenchmarksTableRow > | BenchmarksTable () |
| void | Benchmarks () |
| void | Run () |
| DEFINE_STRONG_INT_TYPE (FullSubsetIndex, BaseInt) | |
| DEFINE_STRONG_INT_TYPE (FullElementIndex, BaseInt) | |
| ENABLE_EXPLICIT_STRONG_TYPE_CAST (SubsetIndex, FullSubsetIndex) | |
| ENABLE_EXPLICIT_STRONG_TYPE_CAST (FullSubsetIndex, SubsetIndex) | |
| ENABLE_EXPLICIT_STRONG_TYPE_CAST (ElementIndex, FullElementIndex) | |
| ENABLE_EXPLICIT_STRONG_TYPE_CAST (FullElementIndex, ElementIndex) | |
| int | ComputeFormVarStatus (glp_prob *const problem, const int num_cstrs, const int k) |
| double | ComputeFormVarReducedCost (glp_prob *const problem, const int num_cstrs, const int k) |
| double | ComputeFormVarPrimalValue (glp_prob *const problem, const int num_cstrs, const int k) |
| double | ComputeFormVarLowerBound (glp_prob *const problem, const int num_cstrs, const int k) |
| double | ComputeFormVarUpperBound (glp_prob *const problem, const int num_cstrs, const int k) |
| void | SetupGlpkEnvAutomaticDeletion () |
| std::string | SolutionStatusString (const int status) |
| std::string | BasisStatusString (const int stat) |
| std::string | ReturnCodeString (const int rc) |
| std::string | TruncateAndQuoteGLPKName (const std::string_view original_name) |
| void | LoadGurobiFunctions (DynamicLibrary *gurobi_dynamic_library) |
| std::vector< std::string > | GurobiDynamicLibraryPotentialPaths () |
| absl::Status | LoadGurobiDynamicLibrary (std::vector< absl::string_view > potential_paths) |
| void | LoadXpressFunctions (DynamicLibrary *xpress_dynamic_library) |
| void | printXpressBanner (bool error) |
| std::vector< std::string > | XpressDynamicLibraryPotentialPaths () |
| absl::Status | LoadXpressDynamicLibrary (std::string &xpresspath) |
| void | log_message_about_XPRSinit_argument () |
| void | log_full_license_error (int code, const std::string &xpress_lib_dir) |
| bool | initXpressEnv (bool verbose, int xpress_oem_license_key) |
| init XPRESS environment. | |
| bool | XpressIsCorrectlyInstalled () |
| template<size_t alignment_bytes, typename Value> | |
| Value * | AlignUp (Value *ptr) |
| template<size_t alignment_bytes, typename Value> | |
| Value * | AlignDown (Value *ptr) |
| template<size_t alignment_bytes, typename Value> | |
| bool | IsAligned (Value *ptr) |
| uint64_t | OneBit64 (int pos) |
| uint32_t | OneBit32 (int pos) |
| uint64_t | BitCount64 (uint64_t n) |
| uint32_t | BitCount32 (uint32_t n) |
| uint64_t | LeastSignificantBitWord64 (uint64_t n) |
| uint32_t | LeastSignificantBitWord32 (uint32_t n) |
| int | LeastSignificantBitPosition64DeBruijn (uint64_t n) |
| int | LeastSignificantBitPosition64Default (uint64_t n) |
| int | LeastSignificantBitPosition64 (uint64_t n) |
| int | LeastSignificantBitPosition32DeBruijn (uint32_t n) |
| int | LeastSignificantBitPosition32Default (uint32_t n) |
| int | LeastSignificantBitPosition32 (uint32_t n) |
| int | MostSignificantBitPosition64Default (uint64_t n) |
| int | MostSignificantBitPosition64 (uint64_t n) |
| int | MostSignificantBitPosition32Default (uint32_t n) |
| int | MostSignificantBitPosition32 (uint32_t n) |
| uint64_t | OneRange64 (uint64_t s, uint64_t e) |
| uint32_t | OneRange32 (uint32_t s, uint32_t e) |
| uint64_t | IntervalUp64 (uint64_t s) |
| uint32_t | IntervalUp32 (uint32_t s) |
| uint64_t | IntervalDown64 (uint64_t s) |
| uint32_t | IntervalDown32 (uint32_t s) |
| uint32_t | BitPos64 (uint64_t pos) |
| uint32_t | BitPos32 (uint32_t pos) |
| uint64_t | BitOffset64 (uint64_t pos) |
| uint32_t | BitOffset32 (uint32_t pos) |
| uint64_t | BitLength64 (uint64_t size) |
| uint32_t | BitLength32 (uint32_t size) |
| uint64_t | BitShift64 (uint64_t v) |
| uint32_t | BitShift32 (uint32_t v) |
| bool | IsBitSet64 (const uint64_t *const bitset, uint64_t pos) |
| bool | IsBitSet32 (const uint32_t *const bitset, uint32_t pos) |
| void | SetBit64 (uint64_t *const bitset, uint64_t pos) |
| void | SetBit32 (uint32_t *const bitset, uint32_t pos) |
| void | ClearBit64 (uint64_t *const bitset, uint64_t pos) |
| void | ClearBit32 (uint32_t *const bitset, uint32_t pos) |
| uint64_t | BitCountRange64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| uint32_t | BitCountRange32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| bool | IsEmptyRange64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| bool | IsEmptyRange32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| int64_t | LeastSignificantBitPosition64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| int | LeastSignificantBitPosition32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| int64_t | MostSignificantBitPosition64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| int | MostSignificantBitPosition32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| int64_t | UnsafeLeastSignificantBitPosition64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| int32_t | UnsafeLeastSignificantBitPosition32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| int64_t | UnsafeMostSignificantBitPosition64 (const uint64_t *bitset, uint64_t start, uint64_t end) |
| int32_t | UnsafeMostSignificantBitPosition32 (const uint32_t *bitset, uint32_t start, uint32_t end) |
| uint64_t | TwoBitsFromPos64 (uint64_t pos) |
| absl::StatusOr< std::string > | ReadFileToString (absl::string_view filename) |
| absl::Status | ReadFileToProto (absl::string_view filename, google::protobuf::Message *proto, bool allow_partial) |
| absl::Status | StringToProto (absl::string_view data, google::protobuf::Message *proto, bool allow_partial) |
| absl::Status | WriteProtoToFile (absl::string_view filename, const google::protobuf::Message &proto, ProtoWriteFormat proto_write_format, bool gzipped, bool append_extension_to_file_name) |
| template<typename Proto> | |
| absl::StatusOr< Proto > | ReadFileToProto (absl::string_view filename, bool allow_partial=false) |
| template<typename Proto> | |
| std::vector< Proto > | ReadAllRecordsOrDie (absl::string_view filename) |
| template<typename Proto> | |
| std::vector< Proto > | ReadAllRecordsOrDie (File *file) |
| template<typename Proto> | |
| Proto | ReadOneRecordOrDie (absl::string_view filename) |
| template<typename Proto> | |
| void | WriteRecordsOrDie (absl::string_view filename, const std::vector< Proto > &protos) |
| DEFINE_STRONG_INDEX_TYPE (TreeNodeIndex) | |
| DEFINE_STRONG_INDEX_TYPE (LeafIndex) | |
| std::ostream & | operator<< (std::ostream &out, const RoundTripDoubleFormat &format) |
| void | ComputeScalingErrors (absl::Span< const double > input, absl::Span< const double > lb, absl::Span< const double > ub, double scaling_factor, double *max_relative_coeff_error, double *max_scaled_sum_error) |
| double | GetBestScalingOfDoublesToInt64 (absl::Span< const double > input, absl::Span< const double > lb, absl::Span< const double > ub, int64_t max_absolute_sum) |
| void | GetBestScalingOfDoublesToInt64 (absl::Span< const double > input, int64_t max_absolute_sum, double *scaling_factor, double *max_relative_coeff_error) |
| int64_t | ComputeGcdOfRoundedDoubles (absl::Span< const double > x, double scaling_factor) |
| template<typename FloatType> | |
| bool | IsPositiveOrNegativeInfinity (FloatType x) |
| template<typename FloatType> | |
| bool | AreWithinAbsoluteOrRelativeTolerances (FloatType x, FloatType y, FloatType relative_tolerance, FloatType absolute_tolerance) |
| template<typename FloatType> | |
| bool | AreWithinAbsoluteTolerance (FloatType x, FloatType y, FloatType absolute_tolerance) |
| template<typename FloatType> | |
| bool | IsSmallerWithinTolerance (FloatType x, FloatType y, FloatType tolerance) |
| template<typename FloatType> | |
| bool | IsIntegerWithinTolerance (FloatType x, FloatType tolerance) |
| template<typename FloatType> | |
| FloatType | Interpolate (FloatType x, FloatType y, FloatType alpha) |
| int | fast_ilogb (double value) |
| double | fast_scalbn (double value, int exponent) |
| std::string | FormatCounter (int64_t num) |
| bool | ParseTextProtoForFlag (const absl::string_view text, google::protobuf::Message *const message_out, std::string *const error_out) |
| std::string | FullProtocolMessageAsString (const google::protobuf::Message &message, int indent_level) |
| template<class Proto> | |
| absl::StatusOr< Proto * > | SafeProtoDownCast (google::protobuf::Message *proto) |
| template<class Proto> | |
| absl::StatusOr< const Proto * > | SafeProtoConstDownCast (const google::protobuf::Message *proto) |
| void | ExploreAndCountAllProtoPathsInInstance (const google::protobuf::Message &message, absl::flat_hash_map< std::string, int > *proto_path_counts) |
| QapProblem | ReadQapProblemOrDie (absl::string_view filepath) |
| RangeIntToIntFunction * | MakeBareIntToIntFunction (std::function< int64_t(int64_t)> f) |
| RangeIntToIntFunction * | MakeCachedIntToIntFunction (const std::function< int64_t(int64_t)> &f, int64_t domain_start, int64_t domain_end) |
| RangeMinMaxIndexFunction * | MakeCachedRangeMinMaxIndexFunction (const std::function< int64_t(int64_t)> &f, int64_t domain_start, int64_t domain_end) |
| Fraction | RationalApproximation (const double x, const double precision) |
| bool | AtMinOrMaxInt64 (int64_t x) |
| int64_t | CapOpp (int64_t v) |
| int64_t | CapAbs (int64_t v) |
| int64_t | TwosComplementAddition (int64_t x, int64_t y) |
| int64_t | TwosComplementSubtraction (int64_t x, int64_t y) |
| bool | AddHadOverflow (int64_t x, int64_t y, int64_t sum) |
| bool | SubHadOverflow (int64_t x, int64_t y, int64_t diff) |
| bool | AddOverflows (int64_t x, int64_t y) |
| int64_t | SubOverflows (int64_t x, int64_t y) |
| template<typename IntegerType> | |
| bool | SafeAddInto (IntegerType a, IntegerType *b) |
| int64_t | CapWithSignOf (int64_t x) |
| int64_t | CapAddGeneric (int64_t x, int64_t y) |
| int64_t | CapSubGeneric (int64_t x, int64_t y) |
| int64_t | CapProdGeneric (int64_t x, int64_t y) |
| template<typename T> | |
| T | CapOrFloatAdd (T x, T y) |
| int64_t | CapAdd (int64_t x, int64_t y) |
| bool | AddIntoOverflow (int64_t x, int64_t *y) |
| void | CapAddTo (int64_t x, int64_t *y) |
| int64_t | CapSub (int64_t x, int64_t y) |
| void | CapSubFrom (int64_t amount, int64_t *target) |
| int64_t | CapProd (int64_t x, int64_t y) |
| template<class Iterator, class Compare = std::less<value_type_t<Iterator>>> | |
| void | IncrementalSort (int max_comparisons, Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false) |
| template<class Iterator, class Compare = std::less<value_type_t<Iterator>>> | |
| void | InsertionSort (Iterator begin, Iterator end, Compare comp=Compare{}) |
| template<class Iterator, class Compare = std::less<value_type_t<Iterator>>> | |
| void | IncrementalSort (Iterator begin, Iterator end, Compare comp=Compare{}, bool is_stable=false) |
| bool | IntervalsAreSortedAndNonAdjacent (absl::Span< const ClosedInterval > intervals) |
| int64_t | CeilRatio (int64_t value, int64_t positive_coeff) |
| int64_t | FloorRatio (int64_t value, int64_t positive_coeff) |
| std::ostream & | operator<< (std::ostream &out, const ClosedInterval &interval) |
| std::ostream & | operator<< (std::ostream &out, const std::vector< ClosedInterval > &intervals) |
| std::ostream & | operator<< (std::ostream &out, const Domain &domain) |
| int64_t | SumOfKMinValueInDomain (const Domain &domain, int k) |
| int64_t | SumOfKMaxValueInDomain (const Domain &domain, int k) |
| ClosedInterval::Iterator | begin (ClosedInterval interval) |
| ClosedInterval::Iterator | end (ClosedInterval interval) |
| std::string | MemoryUsage () |
| template<class T> | |
| std::string | JoinDebugString (const std::vector< T > &v, absl::string_view separator) |
| template<class T> | |
| std::string | JoinDebugStringPtr (const std::vector< T > &v, absl::string_view separator) |
| template<class T> | |
| std::string | JoinNamePtr (const std::vector< T > &v, absl::string_view separator) |
| template<class T> | |
| std::string | JoinNameFieldPtr (const std::vector< T > &v, absl::string_view separator) |
| std::string | CropMultiLineString (const std::string &s, int max_line_length, int max_num_lines) |
| template<typename StrongIndexName> | |
| std::ostream & | operator<< (std::ostream &os, StrongIndex< StrongIndexName > arg) |
| template<typename Sink, typename... T> | |
| void | AbslStringify (Sink &sink, StrongIndex< T... > arg) |
| template<typename StrongIntegerName> | |
| std::ostream & | operator<< (std::ostream &os, StrongInt64< StrongIntegerName > arg) |
| template<typename Sink, typename... T> | |
| void | AbslStringify (Sink &sink, StrongInt64< T... > arg) |
| STRONG_TYPE_ARITHMETIC_OP (StrongIndex, int,+) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongIndex, int, -) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongIndex, int, *) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongIndex, int, %) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t,+) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t, -) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t, *) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t,/) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t,<<) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t, > >) | |
| STRONG_TYPE_ARITHMETIC_OP (StrongInt64, int64_t, %) | |
| STRONG_TYPE_COMPARISON_OP (StrongIndex, int,==) | |
| STRONG_TYPE_COMPARISON_OP (StrongIndex, int, !=) | |
| STRONG_TYPE_COMPARISON_OP (StrongIndex, int,<=) | |
| STRONG_TYPE_COMPARISON_OP (StrongIndex, int, >=) | |
| STRONG_TYPE_COMPARISON_OP (StrongInt64, int64_t,==) | |
| STRONG_TYPE_COMPARISON_OP (StrongInt64, int64_t, !=) | |
| STRONG_TYPE_COMPARISON_OP (StrongInt64, int64_t,<=) | |
| STRONG_TYPE_COMPARISON_OP (StrongInt64, int64_t, >=) | |
| template<typename StrongIndexName, typename H> | |
| H | AbslHashValue (H h, const StrongIndex< StrongIndexName > &i) |
| template<typename StrongIntegerName, typename H> | |
| H | AbslHashValue (H h, const StrongInt64< StrongIntegerName > &i) |
| bool | ProbablyRunningInsideUnitTest () |
| float | AlignedVectorSum (absl::Span< const float > values) |
| float | VectorSum (absl::Span< const float > values) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | FirstSolutionStrategy_Value_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | LocalSearchMetaheuristic_Value_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | RoutingSearchStatus_Value_descriptor () |
| bool | FirstSolutionStrategy_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | FirstSolutionStrategy_Value_Name (T value) |
| template<> | |
| const ::std::string & | FirstSolutionStrategy_Value_Name (FirstSolutionStrategy_Value value) |
| bool | FirstSolutionStrategy_Value_Parse (::absl::string_view name, FirstSolutionStrategy_Value *PROTOBUF_NONNULL value) |
| bool | LocalSearchMetaheuristic_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | LocalSearchMetaheuristic_Value_Name (T value) |
| template<> | |
| const ::std::string & | LocalSearchMetaheuristic_Value_Name (LocalSearchMetaheuristic_Value value) |
| bool | LocalSearchMetaheuristic_Value_Parse (::absl::string_view name, LocalSearchMetaheuristic_Value *PROTOBUF_NONNULL value) |
| bool | RoutingSearchStatus_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | RoutingSearchStatus_Value_Name (T value) |
| template<> | |
| const ::std::string & | RoutingSearchStatus_Value_Name (RoutingSearchStatus_Value value) |
| bool | RoutingSearchStatus_Value_Parse (::absl::string_view name, RoutingSearchStatus_Value *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor () |
| bool | LocalCheapestInsertionParameters_PairInsertionStrategy_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | LocalCheapestInsertionParameters_PairInsertionStrategy_Name (T value) |
| template<> | |
| const ::std::string & | LocalCheapestInsertionParameters_PairInsertionStrategy_Name (LocalCheapestInsertionParameters_PairInsertionStrategy value) |
| bool | LocalCheapestInsertionParameters_PairInsertionStrategy_Parse (::absl::string_view name, LocalCheapestInsertionParameters_PairInsertionStrategy *PROTOBUF_NONNULL value) |
| bool | LocalCheapestInsertionParameters_InsertionSortingProperty_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | LocalCheapestInsertionParameters_InsertionSortingProperty_Name (T value) |
| template<> | |
| const ::std::string & | LocalCheapestInsertionParameters_InsertionSortingProperty_Name (LocalCheapestInsertionParameters_InsertionSortingProperty value) |
| bool | LocalCheapestInsertionParameters_InsertionSortingProperty_Parse (::absl::string_view name, LocalCheapestInsertionParameters_InsertionSortingProperty *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | RuinCompositionStrategy_Value_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | PerturbationStrategy_Value_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | CoolingScheduleStrategy_Value_descriptor () |
| bool | RuinCompositionStrategy_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | RuinCompositionStrategy_Value_Name (T value) |
| template<> | |
| const ::std::string & | RuinCompositionStrategy_Value_Name (RuinCompositionStrategy_Value value) |
| bool | RuinCompositionStrategy_Value_Parse (::absl::string_view name, RuinCompositionStrategy_Value *PROTOBUF_NONNULL value) |
| bool | PerturbationStrategy_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | PerturbationStrategy_Value_Name (T value) |
| template<> | |
| const ::std::string & | PerturbationStrategy_Value_Name (PerturbationStrategy_Value value) |
| bool | PerturbationStrategy_Value_Parse (::absl::string_view name, PerturbationStrategy_Value *PROTOBUF_NONNULL value) |
| bool | CoolingScheduleStrategy_Value_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | CoolingScheduleStrategy_Value_Name (T value) |
| template<> | |
| const ::std::string & | CoolingScheduleStrategy_Value_Name (CoolingScheduleStrategy_Value value) |
| bool | CoolingScheduleStrategy_Value_Parse (::absl::string_view name, CoolingScheduleStrategy_Value *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | RoutingSearchParameters_SchedulingSolver_descriptor () |
| bool | RoutingSearchParameters_SchedulingSolver_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | RoutingSearchParameters_SchedulingSolver_Name (T value) |
| template<> | |
| const ::std::string & | RoutingSearchParameters_SchedulingSolver_Name (RoutingSearchParameters_SchedulingSolver value) |
| bool | RoutingSearchParameters_SchedulingSolver_Parse (::absl::string_view name, RoutingSearchParameters_SchedulingSolver *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | ConstraintSolverParameters_TrailCompression_descriptor () |
| bool | ConstraintSolverParameters_TrailCompression_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | ConstraintSolverParameters_TrailCompression_Name (T value) |
| template<> | |
| const ::std::string & | ConstraintSolverParameters_TrailCompression_Name (ConstraintSolverParameters_TrailCompression value) |
| bool | ConstraintSolverParameters_TrailCompression_Parse (::absl::string_view name, ConstraintSolverParameters_TrailCompression *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | FlowModelProto_ProblemType_descriptor () |
| bool | FlowModelProto_ProblemType_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | FlowModelProto_ProblemType_Name (T value) |
| template<> | |
| const ::std::string & | FlowModelProto_ProblemType_Name (FlowModelProto_ProblemType value) |
| bool | FlowModelProto_ProblemType_Parse (::absl::string_view name, FlowModelProto_ProblemType *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | MPSosConstraint_Type_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | MPModelProto_Annotation_TargetType_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | MPSolverCommonParameters_LPAlgorithmValues_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | MPModelRequest_SolverType_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | MPSolverResponseStatus_descriptor () |
| bool | MPSosConstraint_Type_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | MPSosConstraint_Type_Name (T value) |
| template<> | |
| const ::std::string & | MPSosConstraint_Type_Name (MPSosConstraint_Type value) |
| bool | MPSosConstraint_Type_Parse (::absl::string_view name, MPSosConstraint_Type *PROTOBUF_NONNULL value) |
| bool | MPModelProto_Annotation_TargetType_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | MPModelProto_Annotation_TargetType_Name (T value) |
| template<> | |
| const ::std::string & | MPModelProto_Annotation_TargetType_Name (MPModelProto_Annotation_TargetType value) |
| bool | MPModelProto_Annotation_TargetType_Parse (::absl::string_view name, MPModelProto_Annotation_TargetType *PROTOBUF_NONNULL value) |
| bool | MPSolverCommonParameters_LPAlgorithmValues_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | MPSolverCommonParameters_LPAlgorithmValues_Name (T value) |
| template<> | |
| const ::std::string & | MPSolverCommonParameters_LPAlgorithmValues_Name (MPSolverCommonParameters_LPAlgorithmValues value) |
| bool | MPSolverCommonParameters_LPAlgorithmValues_Parse (::absl::string_view name, MPSolverCommonParameters_LPAlgorithmValues *PROTOBUF_NONNULL value) |
| bool | MPModelRequest_SolverType_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | MPModelRequest_SolverType_Name (T value) |
| bool | MPModelRequest_SolverType_Parse (::absl::string_view name, MPModelRequest_SolverType *PROTOBUF_NONNULL value) |
| bool | MPSolverResponseStatus_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | MPSolverResponseStatus_Name (T value) |
| bool | MPSolverResponseStatus_Parse (::absl::string_view name, MPSolverResponseStatus *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | GScipParameters_Emphasis_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | GScipParameters_MetaParamValue_descriptor () |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | GScipOutput_Status_descriptor () |
| bool | GScipParameters_Emphasis_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | GScipParameters_Emphasis_Name (T value) |
| template<> | |
| const ::std::string & | GScipParameters_Emphasis_Name (GScipParameters_Emphasis value) |
| bool | GScipParameters_Emphasis_Parse (::absl::string_view name, GScipParameters_Emphasis *PROTOBUF_NONNULL value) |
| bool | GScipParameters_MetaParamValue_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | GScipParameters_MetaParamValue_Name (T value) |
| template<> | |
| const ::std::string & | GScipParameters_MetaParamValue_Name (GScipParameters_MetaParamValue value) |
| bool | GScipParameters_MetaParamValue_Parse (::absl::string_view name, GScipParameters_MetaParamValue *PROTOBUF_NONNULL value) |
| bool | GScipOutput_Status_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | GScipOutput_Status_Name (T value) |
| template<> | |
| const ::std::string & | GScipOutput_Status_Name (GScipOutput_Status value) |
| bool | GScipOutput_Status_Parse (::absl::string_view name, GScipOutput_Status *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | CourseSchedulingResultStatus_descriptor () |
| bool | CourseSchedulingResultStatus_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | CourseSchedulingResultStatus_Name (T value) |
| template<> | |
| const ::std::string & | CourseSchedulingResultStatus_Name (CourseSchedulingResultStatus value) |
| bool | CourseSchedulingResultStatus_Parse (::absl::string_view name, CourseSchedulingResultStatus *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | SetCoverSolutionResponse_Status_descriptor () |
| bool | SetCoverSolutionResponse_Status_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | SetCoverSolutionResponse_Status_Name (T value) |
| template<> | |
| const ::std::string & | SetCoverSolutionResponse_Status_Name (SetCoverSolutionResponse_Status value) |
| bool | SetCoverSolutionResponse_Status_Parse (::absl::string_view name, SetCoverSolutionResponse_Status *PROTOBUF_NONNULL value) |
| const ::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL | OptionalBoolean_descriptor () |
| bool | OptionalBoolean_IsValid (int value) |
| template<typename T> | |
| const ::std::string & | OptionalBoolean_Name (T value) |
| template<> | |
| const ::std::string & | OptionalBoolean_Name (OptionalBoolean value) |
| bool | OptionalBoolean_Parse (::absl::string_view name, OptionalBoolean *PROTOBUF_NONNULL value) |
| template<class Graph> | |
| bool | GraphIsSymmetric (const Graph &graph) |
| template<class T> | |
| Demon * | MakeConstraintDemon0 (Solver *const s, T *const ct, void(T::*method)(), const std::string &name) |
| template<class P> | |
| std::string | ParameterDebugString (P param) |
| template<class P> | |
| std::string | ParameterDebugString (P *param) |
| Support limited to pointers to classes which define DebugString(). | |
| template<class T, class P> | |
| Demon * | MakeConstraintDemon1 (Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1) |
| template<class T, class P, class Q> | |
| Demon * | MakeConstraintDemon2 (Solver *const s, T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2) |
| template<class T, class P, class Q, class R> | |
| Demon * | MakeConstraintDemon3 (Solver *const s, T *const ct, void(T::*method)(P, Q, R), const std::string &name, P param1, Q param2, R param3) |
| template<class T> | |
| Demon * | MakeDelayedConstraintDemon0 (Solver *const s, T *const ct, void(T::*method)(), const std::string &name) |
| template<class T, class P> | |
| Demon * | MakeDelayedConstraintDemon1 (Solver *const s, T *const ct, void(T::*method)(P), const std::string &name, P param1) |
| template<class T, class P, class Q> | |
| Demon * | MakeDelayedConstraintDemon2 (Solver *const s, T *const ct, void(T::*method)(P, Q), const std::string &name, P param1, Q param2) |
Variables | |
| const bool | DEBUG_MODE = true |
| static const int | kUnassigned = -1 |
| template<typename NodeIndex> | |
| const double | BronKerboschAlgorithm< NodeIndex >::kPushStateDeterministicTimeSecondsPerCandidate = 0.54663e-7 |
| const PathDistance | kDisconnectedPathDistance |
| constexpr NamedOptimizationProblemType | kOptimizationProblemTypeNames [] |
| constexpr double | kDefaultPrimalTolerance = 1e-07 |
| static constexpr Cost | kMaxPossibleCost = std::numeric_limits<Cost>::max() |
| static constexpr double | kInfinity = std::numeric_limits<float>::infinity() |
| num_uncovered_elements_ | |
| num_free_elements_ [subset] | |
| static const char *const | kRailFiles [] |
| static const char *const | kScp4To6Files [] |
| static const char *const | kScpAToEFiles [] |
| static const char *const | kScpNrFiles [] |
| static const char *const | kScpClrFiles [] |
| static const char *const | kScpCycFiles [] |
| static const char *const | kWedelinFiles [] |
| static const char *const | kBalasFiles [] |
| static const char *const | kFimiFiles [] |
| constexpr std::size_t | kMaxGLPKNameLen = 255 |
| std::function< int(GRBmodel *model, const char *attrname)> | GRBisattravailable |
| std::function< int(GRBmodel *model, const char *attrname, int *valueP)> | GRBgetintattr = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int newvalue)> | GRBsetintattr = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, int *valueP)> | GRBgetintattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, int newvalue)> | GRBsetintattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, int *values)> | GRBgetintattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, int *newvalues)> | GRBsetintattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, int *newvalues)> | GRBsetintattrlist = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, char *valueP)> | GRBgetcharattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, char newvalue)> | GRBsetcharattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, char *values)> | GRBgetcharattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, char *newvalues)> | GRBsetcharattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, char *newvalues)> | GRBsetcharattrlist = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, double *valueP)> | GRBgetdblattr = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, double newvalue)> | GRBsetdblattr = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, double *valueP)> | GRBgetdblattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int element, double newvalue)> | GRBsetdblattrelement = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, double *values)> | GRBgetdblattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, double *newvalues)> | GRBsetdblattrarray = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, double *newvalues)> | GRBsetdblattrlist = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, char **valueP)> | GRBgetstrattr = nullptr |
| std::function< int(GRBmodel *model, const char *attrname, const char *newvalue)> | GRBsetstrattr = nullptr |
| std::function< int(GRBmodel *model, int(GUROBI_STDCALL *cb)(CB_ARGS), void *usrdata)> | GRBsetcallbackfunc = nullptr |
| std::function< int(void *cbdata, int where, int what, void *resultP)> | GRBcbget |
| std::function< int(void *cbdata, const double *solution, double *objvalP)> | GRBcbsolution = nullptr |
| std::function< int(void *cbdata, int cutlen, const int *cutind, const double *cutval, char cutsense, double cutrhs)> | GRBcbcut = nullptr |
| std::function< int(void *cbdata, int lazylen, const int *lazyind, const double *lazyval, char lazysense, double lazyrhs)> | GRBcblazy = nullptr |
| std::function< int(GRBmodel *model, int *numnzP, int *vbeg, int *vind, double *vval, int start, int len)> | GRBgetvars = nullptr |
| std::function< int(GRBmodel *model)> | GRBoptimize = nullptr |
| std::function< int(GRBmodel *model)> | GRBcomputeIIS = nullptr |
| std::function< int(GRBmodel *model, const char *filename)> | GRBwrite = nullptr |
| std::function< int(GRBenv *env, GRBmodel **modelP, const char *Pname, int numvars, double *obj, double *lb, double *ub, char *vtype, char **varnames)> | GRBnewmodel = nullptr |
| std::function< int(GRBmodel *model, int numnz, int *vind, double *vval, double obj, double lb, double ub, char vtype, const char *varname)> | GRBaddvar = nullptr |
| std::function< int(GRBmodel *model, int numvars, int numnz, int *vbeg, int *vind, double *vval, double *obj, double *lb, double *ub, char *vtype, char **varnames)> | GRBaddvars = nullptr |
| std::function< int(GRBmodel *model, int numnz, int *cind, double *cval, char sense, double rhs, const char *constrname)> | GRBaddconstr = nullptr |
| std::function< int(GRBmodel *model, int numconstrs, int numnz, int *cbeg, int *cind, double *cval, char *sense, double *rhs, char **constrnames)> | GRBaddconstrs = nullptr |
| std::function< int(GRBmodel *model, int numnz, int *cind, double *cval, double lower, double upper, const char *constrname)> | GRBaddrangeconstr = nullptr |
| std::function< int(GRBmodel *model, int numsos, int nummembers, int *types, int *beg, int *ind, double *weight)> | GRBaddsos = nullptr |
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars, double constant)> | GRBaddgenconstrMax = nullptr |
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars, double constant)> | GRBaddgenconstrMin = nullptr |
| std::function< int(GRBmodel *model, const char *name, int resvar, int argvar)> | GRBaddgenconstrAbs = nullptr |
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars)> | GRBaddgenconstrAnd = nullptr |
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars)> | GRBaddgenconstrOr = nullptr |
| std::function< int(GRBmodel *model, const char *name, int binvar, int binval, int nvars, const int *vars, const double *vals, char sense, double rhs)> | GRBaddgenconstrIndicator = nullptr |
| std::function< int(GRBmodel *model, int numlnz, int *lind, double *lval, int numqnz, int *qrow, int *qcol, double *qval, char sense, double rhs, const char *QCname)> | GRBaddqconstr = nullptr |
| std::function< int(GRBmodel *model, int numqnz, int *qrow, int *qcol, double *qval)> | GRBaddqpterms = nullptr |
| std::function< int(GRBmodel *model, int len, int *ind)> | GRBdelvars = nullptr |
| std::function< int(GRBmodel *model, int len, int *ind)> | GRBdelconstrs = nullptr |
| std::function< int(GRBmodel *model, int len, int *ind)> | GRBdelsos = nullptr |
| std::function< int(GRBmodel *model, int len, int *ind)> | GRBdelgenconstrs |
| std::function< int(GRBmodel *model, int len, int *ind)> | GRBdelqconstrs = nullptr |
| std::function< int(GRBmodel *model)> | GRBdelq = nullptr |
| std::function< int(GRBmodel *model, int cnt, int *cind, int *vind, double *val)> | GRBchgcoeffs = nullptr |
| std::function< int(GRBmodel *model)> | GRBupdatemodel = nullptr |
| std::function< int(GRBmodel *model)> | GRBfreemodel = nullptr |
| std::function< void(GRBmodel *model)> | GRBterminate = nullptr |
| std::function< int(GRBmodel *model, int index, int priority, double weight, double abstol, double reltol, const char *name, double constant, int lnz, int *lind, double *lval)> | GRBsetobjectiven = nullptr |
| std::function< int(GRBenv *env, const char *paramname, int *valueP)> | GRBgetintparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, double *valueP)> | GRBgetdblparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, char *valueP)> | GRBgetstrparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, int *valueP, int *minP, int *maxP, int *defP)> | GRBgetintparaminfo = nullptr |
| std::function< int(GRBenv *env, const char *paramname, double *valueP, double *minP, double *maxP, double *defP)> | GRBgetdblparaminfo = nullptr |
| std::function< int(GRBenv *env, const char *paramname, char *valueP, char *defP)> | GRBgetstrparaminfo = nullptr |
| std::function< int(GRBenv *env, const char *paramname)> | GRBgetparamtype |
| std::function< int(GRBenv *env, int i, char **paramnameP)> | GRBgetparamname |
| std::function< int(GRBenv *env, const char *paramname, const char *value)> | GRBsetparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, int value)> | GRBsetintparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, double value)> | GRBsetdblparam = nullptr |
| std::function< int(GRBenv *env, const char *paramname, const char *value)> | GRBsetstrparam = nullptr |
| std::function< int(GRBenv *env)> | GRBresetparams = nullptr |
| std::function< int(GRBenv *dest, GRBenv *src)> | GRBcopyparams = nullptr |
| std::function< int(GRBenv *env)> | GRBgetnumparams = nullptr |
| std::function< int(GRBenv **envP)> | GRBemptyenv = nullptr |
| std::function< int(GRBenv **envP, const char *logfilename)> | GRBloadenv = nullptr |
| std::function< int(GRBenv *env)> | GRBstartenv = nullptr |
| std::function< GRBenv *(GRBmodel *model)> | GRBgetenv = nullptr |
| std::function< GRBenv *(GRBmodel *model, int num)> | GRBgetmultiobjenv = nullptr |
| std::function< GRBenv *(GRBmodel *model)> | GRBdiscardmultiobjenvs = nullptr |
| std::function< void(GRBenv *env)> | GRBfreeenv = nullptr |
| std::function< const char *(GRBenv *env)> | GRBgeterrormsg = nullptr |
| std::function< void(int *majorP, int *minorP, int *technicalP)> | GRBversion |
| std::function< char *(void)> | GRBplatform = nullptr |
| std::function< int(XPRSprob *p_prob)> | XPRScreateprob = nullptr |
| std::function< int(XPRSprob prob)> | XPRSdestroyprob = nullptr |
| std::function< int(const char *path)> | XPRSinit = nullptr |
| std::function< int(void)> | XPRSfree = nullptr |
| std::function< int(char *buffer, int maxbytes)> | XPRSgetlicerrmsg = nullptr |
| std::function< int(int *p_i, char *p_c)> | XPRSlicense = nullptr |
| std::function< int(char *banner)> | XPRSgetbanner = nullptr |
| std::function< int(char *version)> | XPRSgetversion = nullptr |
| std::function< int(int *p_major, int *p_minor, int *p_build)> | XPRSgetversionnumbers = nullptr |
| std::function< int(XPRSprob prob, const char *probname)> | XPRSsetprobname = nullptr |
| std::function< int(XPRSprob prob, int control)> | XPRSsetdefaultcontrol = nullptr |
| std::function< int(XPRSprob prob, int reason)> | XPRSinterrupt = nullptr |
| std::function< int(XPRSprob prob, int control, int value)> | XPRSsetintcontrol = nullptr |
| std::function< int(XPRSprob prob, int control, XPRSint64 value)> | XPRSsetintcontrol64 = nullptr |
| std::function< int(XPRSprob prob, int control, double value)> | XPRSsetdblcontrol = nullptr |
| std::function< int(XPRSprob prob, int control, const char *value)> | XPRSsetstrcontrol = nullptr |
| std::function< int(XPRSprob prob, int objidx, int control, int value)> | XPRSsetobjintcontrol = nullptr |
| std::function< int(XPRSprob prob, int objidx, int control, double value)> | XPRSsetobjdblcontrol = nullptr |
| std::function< int(XPRSprob prob, int control, int *p_value)> | XPRSgetintcontrol = nullptr |
| std::function< int(XPRSprob prob, int control, XPRSint64 *p_value)> | XPRSgetintcontrol64 = nullptr |
| std::function< int(XPRSprob prob, int control, double *p_value)> | XPRSgetdblcontrol = nullptr |
| std::function< int(XPRSprob prob, int control, char *value, int maxbytes, int *p_nbytes)> | XPRSgetstringcontrol = nullptr |
| std::function< int(XPRSprob prob, int attrib, int *p_value)> | XPRSgetintattrib = nullptr |
| std::function< int(XPRSprob prob, int attrib, char *value, int maxbytes, int *p_nbytes)> | XPRSgetstringattrib = nullptr |
| std::function< int(XPRSprob prob, int attrib, double *p_value)> | XPRSgetdblattrib = nullptr |
| std::function< int(XPRSprob prob, int objidx, int attrib, double *p_value)> | XPRSgetobjdblattrib = nullptr |
| std::function< int(XPRSprob prob, int objidx, const double solution[], double *p_objval)> | XPRScalcobjn = nullptr |
| std::function< int(XPRSprob prob, const char *name, int *p_id, int *p_type)> | XPRSgetcontrolinfo = nullptr |
| std::function< int(XPRSprob prob, double objcoef[], int first, int last)> | XPRSgetobj = nullptr |
| std::function< int(XPRSprob prob, double rhs[], int first, int last)> | XPRSgetrhs = nullptr |
| std::function< int(XPRSprob prob, double rng[], int first, int last)> | XPRSgetrhsrange = nullptr |
| std::function< int(XPRSprob prob, double lb[], int first, int last)> | XPRSgetlb = nullptr |
| std::function< int(XPRSprob prob, double ub[], int first, int last)> | XPRSgetub = nullptr |
| std::function< int(XPRSprob prob, int row, int col, double *p_coef)> | XPRSgetcoef = nullptr |
| std::function< int(XPRSprob prob, int *status, double x[], int first, int last)> | XPRSgetsolution = nullptr |
| std::function< int(XPRSprob prob, int *status, double duals[], int first, int last)> | XPRSgetduals = nullptr |
| std::function< int(XPRSprob prob, int *status, double djs[], int first, int last)> | XPRSgetredcosts = nullptr |
| std::function< int(XPRSprob prob, int nrows, int ncoefs, const char rowtype[], const double rhs[], const double rng[], const int start[], const int colind[], const double rowcoef[])> | XPRSaddrows = nullptr |
| std::function< int(XPRSprob prob, int nrows, int ncoefs, const char rowtype[], const double rhs[], const double rng[], const XPRSint64 start[], const int colind[], const double rowcoef[])> | XPRSaddrows64 = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[])> | XPRSdelrows = nullptr |
| std::function< int(XPRSprob prob, int ncols, int ncoefs, const double objcoef[], const int start[], const int rowind[], const double rowcoef[], const double lb[], const double ub[])> | XPRSaddcols = nullptr |
| std::function< int(XPRSprob prob, int ncols, const int colind[], const double objcoef[], int priority, double weight)> | XPRSaddobj = nullptr |
| std::function< int(XPRSprob prob, int row, int ncoefs, const int rowqcol1[], int const rowqcol2[], const double rowqcoef[])> | XPRSaddqmatrix64 = nullptr |
| std::function< int(XPRSprob prob, int type, const char names[], int first, int last)> | XPRSaddnames = nullptr |
| std::function< int(XPRSprob prob, int type, char names[], int first, int last)> | XPRSgetnames = nullptr |
| std::function< int(XPRSprob prob, int nsets, XPRSint64 nelems, const char settype[], const XPRSint64 start[], const int colind[], const double refval[])> | XPRSaddsets64 = nullptr |
| std::function< int(XPRSprob prob, int ncols, const int colind[])> | XPRSdelcols = nullptr |
| std::function< int(XPRSprob prob, int ncols, const int colind[], const char coltype[])> | XPRSchgcoltype = nullptr |
| std::function< int(XPRSprob prob, const int rowstat[], const int colstat[])> | XPRSloadbasis = nullptr |
| std::function< int(XPRSprob prob)> | XPRSpostsolve = nullptr |
| std::function< int(XPRSprob prob, int objsense)> | XPRSchgobjsense = nullptr |
| std::function< int(XPRSprob prob, char *errmsg)> | XPRSgetlasterror = nullptr |
| std::function< int(XPRSprob prob, int rowstat[], int colstat[])> | XPRSgetbasis = nullptr |
| std::function< int(XPRSprob prob, const char *filename, const char *flags)> | XPRSwriteprob = nullptr |
| std::function< int(XPRSprob prob, const char *filename)> | XPRSsaveas = nullptr |
| std::function< int(XPRSprob prob, char rowtype[], int first, int last)> | XPRSgetrowtype = nullptr |
| std::function< int(XPRSprob prob, char coltype[], int first, int last)> | XPRSgetcoltype = nullptr |
| std::function< int(XPRSprob prob, int nbounds, const int colind[], const char bndtype[], const double bndval[])> | XPRSchgbounds = nullptr |
| std::function< int(XPRSprob prob, int length, const double solval[], const int colind[], const char *name)> | XPRSaddmipsol = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[])> | XPRSloaddelayedrows = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const int colind[], const int complement[])> | XPRSsetindicators = nullptr |
| std::function< int(XPRSprob prob, int ndirs, const int colind[], const int priority[], const char dir[], const double uppseudo[], const double downpseudo[])> | XPRSloaddirs |
| std::function< int(XPRSprob prob, double x[], double slack[], double duals[], double djs[])> | XPRSgetlpsol = nullptr |
| std::function< int(XPRSprob prob, double x[], double slack[])> | XPRSgetmipsol = nullptr |
| std::function< int(XPRSprob prob, int ncols, const int colind[], const double objcoef[])> | XPRSchgobj = nullptr |
| std::function< int(XPRSprob prob, int row, int col, double coef)> | XPRSchgcoef = nullptr |
| std::function< int(XPRSprob prob, int ncoefs, const int rowind[], const int colind[], const double rowcoef[])> | XPRSchgmcoef = nullptr |
| std::function< int(XPRSprob prob, XPRSint64 ncoefs, const int rowind[], const int colind[], const double rowcoef[])> | XPRSchgmcoef64 = nullptr |
| std::function< int(XPRSprob prob, int ncoefs, const int objqcol1[], const int objqcol2[], const double objqcoef[])> | XPRSchgmqobj = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const double rhs[])> | XPRSchgrhs = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const double rng[])> | XPRSchgrhsrange = nullptr |
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const char rowtype[])> | XPRSchgrowtype = nullptr |
| std::function< int(XPRSprob prob, int objidx)> | XPRSdelobj = nullptr |
| std::function< int(XPRSprob prob, void(XPRS_CC *f_intsol)(XPRSprob cbprob, void *cbdata), void *p, int priority)> | XPRSaddcbintsol = nullptr |
| std::function< int(XPRSprob prob, void(XPRS_CC *f_intsol)(XPRSprob cbprob, void *cbdata), void *p)> | XPRSremovecbintsol = nullptr |
| std::function< int(XPRSprob prob, void(XPRS_CC *f_message)(XPRSprob cbprob, void *cbdata, const char *msg, int msglen, int msgtype), void *p, int priority)> | XPRSaddcbmessage = nullptr |
| std::function< int(XPRSprob prob, void(XPRS_CC *f_message)(XPRSprob cbprob, void *cbdata, const char *msg, int msglen, int msgtype), void *p)> | XPRSremovecbmessage = nullptr |
| std::function< int(XPRSprob prob, int(XPRS_CC *f_checktime)(XPRSprob cbprob, void *cbdata), void *p, int priority)> | XPRSaddcbchecktime = nullptr |
| std::function< int(XPRSprob prob, int(XPRS_CC *f_checktime)(XPRSprob cbprob, void *cbdata), void *p)> | XPRSremovecbchecktime = nullptr |
| std::function< int(XPRSprob prob, const char *flags)> | XPRSlpoptimize = nullptr |
| std::function< int(XPRSprob prob, const char *flags)> | XPRSmipoptimize = nullptr |
| std::function< int(XPRSprob prob, const char *flags, int *solvestatus, int *solstatus)> | XPRSoptimize = nullptr |
| static const uint64_t | kAllBits64 = uint64_t{0xFFFFFFFFFFFFFFFF} |
| static const uint64_t | kAllBitsButLsb64 = uint64_t{0xFFFFFFFFFFFFFFFE} |
| static const uint32_t | kAllBits32 = 0xFFFFFFFFU |
| ABSL_CONST_INIT const bool | kStdToCharsDoubleIsSupported |
| constexpr double | kRoundTripTestNumber = 0.10000000000000002 |
| constexpr absl::string_view | kRoundTripTestNumberStr |
| constexpr bool | kAsanEnabled = false |
| constexpr bool | kMsanEnabled = false |
| constexpr bool | kTsanEnabled = false |
| constexpr bool | kAnyXsanEnabled |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 WorkerInfoDefaultTypeInternal | _WorkerInfo_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SequenceVarAssignmentDefaultTypeInternal | _SequenceVarAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 IntervalVarAssignmentDefaultTypeInternal | _IntervalVarAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 IntVarAssignmentDefaultTypeInternal | _IntVarAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AssignmentProtoDefaultTypeInternal | _AssignmentProto_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | IntVarAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | IntervalVarAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SequenceVarAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | WorkerInfo_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AssignmentProto_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 DemonRunsDefaultTypeInternal | _DemonRuns_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ConstraintRunsDefaultTypeInternal | _ConstraintRuns_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | DemonRuns_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ConstraintRuns_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutingSearchStatusDefaultTypeInternal | _RoutingSearchStatus_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalSearchMetaheuristicDefaultTypeInternal | _LocalSearchMetaheuristic_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 FirstSolutionStrategyDefaultTypeInternal | _FirstSolutionStrategy_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | FirstSolutionStrategy_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | LocalSearchMetaheuristic_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | RoutingSearchStatus_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | FirstSolutionStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalSearchMetaheuristic_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutingSearchStatus_class_data_ |
| constexpr FirstSolutionStrategy_Value | FirstSolutionStrategy_Value_Value_MIN |
| constexpr FirstSolutionStrategy_Value | FirstSolutionStrategy_Value_Value_MAX |
| constexpr int | FirstSolutionStrategy_Value_Value_ARRAYSIZE = 17 + 1 |
| constexpr LocalSearchMetaheuristic_Value | LocalSearchMetaheuristic_Value_Value_MIN |
| constexpr LocalSearchMetaheuristic_Value | LocalSearchMetaheuristic_Value_Value_MAX |
| constexpr int | LocalSearchMetaheuristic_Value_Value_ARRAYSIZE = 6 + 1 |
| constexpr RoutingSearchStatus_Value | RoutingSearchStatus_Value_Value_MIN |
| constexpr RoutingSearchStatus_Value | RoutingSearchStatus_Value_Value_MAX |
| constexpr int | RoutingSearchStatus_Value_Value_ARRAYSIZE = 7 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SavingsParametersDefaultTypeInternal | _SavingsParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalCheapestInsertionParametersDefaultTypeInternal | _LocalCheapestInsertionParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GlobalCheapestInsertionParametersDefaultTypeInternal | _GlobalCheapestInsertionParameters_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalCheapestInsertionParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SavingsParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GlobalCheapestInsertionParameters_class_data_ |
| constexpr LocalCheapestInsertionParameters_PairInsertionStrategy | LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MIN |
| constexpr LocalCheapestInsertionParameters_PairInsertionStrategy | LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_MAX |
| constexpr int | LocalCheapestInsertionParameters_PairInsertionStrategy_PairInsertionStrategy_ARRAYSIZE = 3 + 1 |
| constexpr LocalCheapestInsertionParameters_InsertionSortingProperty | LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MIN |
| constexpr LocalCheapestInsertionParameters_InsertionSortingProperty | LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_MAX |
| constexpr int | LocalCheapestInsertionParameters_InsertionSortingProperty_InsertionSortingProperty_ARRAYSIZE = 8 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SpatiallyCloseRoutesRuinStrategyDefaultTypeInternal | _SpatiallyCloseRoutesRuinStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SimulatedAnnealingAcceptanceStrategyDefaultTypeInternal | _SimulatedAnnealingAcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SISRRuinStrategyDefaultTypeInternal | _SISRRuinStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RuinCompositionStrategyDefaultTypeInternal | _RuinCompositionStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RandomWalkRuinStrategyDefaultTypeInternal | _RandomWalkRuinStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 PerturbationStrategyDefaultTypeInternal | _PerturbationStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MoreNodesPerformedAcceptanceStrategyDefaultTypeInternal | _MoreNodesPerformedAcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GreedyDescentAcceptanceStrategyDefaultTypeInternal | _GreedyDescentAcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CoolingScheduleStrategyDefaultTypeInternal | _CoolingScheduleStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AllNodesPerformedAcceptanceStrategyDefaultTypeInternal | _AllNodesPerformedAcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AbsencesBasedAcceptanceStrategyDefaultTypeInternal | _AbsencesBasedAcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RuinStrategyDefaultTypeInternal | _RuinStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RecreateParametersDefaultTypeInternal | _RecreateParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 AcceptanceStrategyDefaultTypeInternal | _AcceptanceStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RecreateStrategyDefaultTypeInternal | _RecreateStrategy_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RuinRecreateParametersDefaultTypeInternal | _RuinRecreateParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 IteratedLocalSearchParametersDefaultTypeInternal | _IteratedLocalSearchParameters_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | RuinCompositionStrategy_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | PerturbationStrategy_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | CoolingScheduleStrategy_Value_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SpatiallyCloseRoutesRuinStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RandomWalkRuinStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SISRRuinStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RuinStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RecreateParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RecreateStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RuinCompositionStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RuinRecreateParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | PerturbationStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CoolingScheduleStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GreedyDescentAcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SimulatedAnnealingAcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AllNodesPerformedAcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MoreNodesPerformedAcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AbsencesBasedAcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | AcceptanceStrategy_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | IteratedLocalSearchParameters_class_data_ |
| constexpr RuinCompositionStrategy_Value | RuinCompositionStrategy_Value_Value_MIN |
| constexpr RuinCompositionStrategy_Value | RuinCompositionStrategy_Value_Value_MAX |
| constexpr int | RuinCompositionStrategy_Value_Value_ARRAYSIZE = 3 + 1 |
| constexpr PerturbationStrategy_Value | PerturbationStrategy_Value_Value_MIN |
| constexpr PerturbationStrategy_Value | PerturbationStrategy_Value_Value_MAX |
| constexpr int | PerturbationStrategy_Value_Value_ARRAYSIZE = 1 + 1 |
| constexpr CoolingScheduleStrategy_Value | CoolingScheduleStrategy_Value_Value_MIN |
| constexpr CoolingScheduleStrategy_Value | CoolingScheduleStrategy_Value_Value_MAX |
| constexpr int | CoolingScheduleStrategy_Value_Value_ARRAYSIZE = 2 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutingSearchParameters_LocalSearchNeighborhoodOperatorsDefaultTypeInternal | _RoutingSearchParameters_LocalSearchNeighborhoodOperators_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutingSearchParameters_ImprovementSearchLimitParametersDefaultTypeInternal | _RoutingSearchParameters_ImprovementSearchLimitParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutingModelParametersDefaultTypeInternal | _RoutingModelParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoutingSearchParametersDefaultTypeInternal | _RoutingSearchParameters_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | RoutingSearchParameters_SchedulingSolver_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutingSearchParameters_LocalSearchNeighborhoodOperators_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutingSearchParameters_ImprovementSearchLimitParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutingSearchParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RoutingModelParameters_class_data_ |
| constexpr RoutingSearchParameters_SchedulingSolver | RoutingSearchParameters_SchedulingSolver_SchedulingSolver_MIN |
| constexpr RoutingSearchParameters_SchedulingSolver | RoutingSearchParameters_SchedulingSolver_SchedulingSolver_MAX |
| constexpr int | RoutingSearchParameters_SchedulingSolver_SchedulingSolver_ARRAYSIZE = 2 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RegularLimitParametersDefaultTypeInternal | _RegularLimitParameters_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | RegularLimitParameters_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SubSolverStatisticsDefaultTypeInternal | _SubSolverStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalSearchStatistics_LocalSearchOperatorStatisticsDefaultTypeInternal | _LocalSearchStatistics_LocalSearchOperatorStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalSearchStatistics_LocalSearchFilterStatisticsDefaultTypeInternal | _LocalSearchStatistics_LocalSearchFilterStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalSearchStatistics_FirstSolutionStatisticsDefaultTypeInternal | _LocalSearchStatistics_FirstSolutionStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ConstraintSolverStatisticsDefaultTypeInternal | _ConstraintSolverStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 LocalSearchStatisticsDefaultTypeInternal | _LocalSearchStatistics_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SearchStatisticsDefaultTypeInternal | _SearchStatistics_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalSearchStatistics_FirstSolutionStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalSearchStatistics_LocalSearchOperatorStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalSearchStatistics_LocalSearchFilterStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | LocalSearchStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ConstraintSolverStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SubSolverStatistics_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SearchStatistics_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ConstraintSolverParametersDefaultTypeInternal | _ConstraintSolverParameters_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | ConstraintSolverParameters_TrailCompression_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ConstraintSolverParameters_class_data_ |
| constexpr ConstraintSolverParameters_TrailCompression | ConstraintSolverParameters_TrailCompression_TrailCompression_MIN |
| constexpr ConstraintSolverParameters_TrailCompression | ConstraintSolverParameters_TrailCompression_TrailCompression_MAX |
| constexpr int | ConstraintSolverParameters_TrailCompression_TrailCompression_ARRAYSIZE = 1 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 FlowNodeProtoDefaultTypeInternal | _FlowNodeProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 FlowArcProtoDefaultTypeInternal | _FlowArcProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 FlowModelProtoDefaultTypeInternal | _FlowModelProto_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | FlowModelProto_ProblemType_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | FlowArcProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | FlowNodeProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | FlowModelProto_class_data_ |
| constexpr FlowModelProto_ProblemType | FlowModelProto_ProblemType_ProblemType_MIN |
| constexpr FlowModelProto_ProblemType | FlowModelProto_ProblemType_ProblemType_MAX |
| constexpr int | FlowModelProto_ProblemType_ProblemType_ARRAYSIZE = 2 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 PartialVariableAssignmentDefaultTypeInternal | _PartialVariableAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 OptionalDoubleDefaultTypeInternal | _OptionalDouble_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPVariableProtoDefaultTypeInternal | _MPVariableProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPSosConstraintDefaultTypeInternal | _MPSosConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPSolveInfoDefaultTypeInternal | _MPSolveInfo_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPSolutionDefaultTypeInternal | _MPSolution_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPQuadraticObjectiveDefaultTypeInternal | _MPQuadraticObjective_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPQuadraticConstraintDefaultTypeInternal | _MPQuadraticConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelProto_AnnotationDefaultTypeInternal | _MPModelProto_Annotation_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPConstraintProtoDefaultTypeInternal | _MPConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPArrayWithConstantConstraintDefaultTypeInternal | _MPArrayWithConstantConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPArrayConstraintDefaultTypeInternal | _MPArrayConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPAbsConstraintDefaultTypeInternal | _MPAbsConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPSolverCommonParametersDefaultTypeInternal | _MPSolverCommonParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPSolutionResponseDefaultTypeInternal | _MPSolutionResponse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal | _MPModelDeltaProto_VariableOverridesEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal | _MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPIndicatorConstraintDefaultTypeInternal | _MPIndicatorConstraint_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelDeltaProtoDefaultTypeInternal | _MPModelDeltaProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPGeneralConstraintProtoDefaultTypeInternal | _MPGeneralConstraintProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelProtoDefaultTypeInternal | _MPModelProto_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 MPModelRequestDefaultTypeInternal | _MPModelRequest_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | MPSosConstraint_Type_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | MPModelProto_Annotation_TargetType_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | MPSolverCommonParameters_LPAlgorithmValues_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | MPModelRequest_SolverType_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | MPSolverResponseStatus_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPVariableProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPGeneralConstraintProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPIndicatorConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPSosConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPQuadraticConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPAbsConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPArrayConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPArrayWithConstantConstraint_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPQuadraticObjective_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | PartialVariableAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelProto_Annotation_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | OptionalDouble_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPSolverCommonParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelDeltaProto_VariableOverridesEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelDeltaProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPModelRequest_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPSolution_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPSolveInfo_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | MPSolutionResponse_class_data_ |
| constexpr MPSosConstraint_Type | MPSosConstraint_Type_Type_MIN |
| constexpr MPSosConstraint_Type | MPSosConstraint_Type_Type_MAX |
| constexpr int | MPSosConstraint_Type_Type_ARRAYSIZE = 1 + 1 |
| constexpr MPModelProto_Annotation_TargetType | MPModelProto_Annotation_TargetType_TargetType_MIN |
| constexpr MPModelProto_Annotation_TargetType | MPModelProto_Annotation_TargetType_TargetType_MAX |
| constexpr int | MPModelProto_Annotation_TargetType_TargetType_ARRAYSIZE = 2 + 1 |
| constexpr MPSolverCommonParameters_LPAlgorithmValues | MPSolverCommonParameters_LPAlgorithmValues_LPAlgorithmValues_MIN |
| constexpr MPSolverCommonParameters_LPAlgorithmValues | MPSolverCommonParameters_LPAlgorithmValues_LPAlgorithmValues_MAX |
| constexpr int | MPSolverCommonParameters_LPAlgorithmValues_LPAlgorithmValues_ARRAYSIZE = 3 + 1 |
| constexpr MPModelRequest_SolverType | MPModelRequest_SolverType_SolverType_MIN |
| constexpr MPModelRequest_SolverType | MPModelRequest_SolverType_SolverType_MAX |
| constexpr int | MPModelRequest_SolverType_SolverType_ARRAYSIZE = 102 + 1 |
| constexpr MPSolverResponseStatus | MPSolverResponseStatus_MIN |
| constexpr MPSolverResponseStatus | MPSolverResponseStatus_MAX |
| constexpr int | MPSolverResponseStatus_ARRAYSIZE = 113 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipSolvingStatsDefaultTypeInternal | _GScipSolvingStats_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_StringParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_StringParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_RealParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_RealParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_LongParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_LongParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_IntParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_IntParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_CharParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_CharParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParameters_BoolParamsEntry_DoNotUseDefaultTypeInternal | _GScipParameters_BoolParamsEntry_DoNotUse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipParametersDefaultTypeInternal | _GScipParameters_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 GScipOutputDefaultTypeInternal | _GScipOutput_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | GScipParameters_Emphasis_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | GScipParameters_MetaParamValue_internal_data_ [] |
| PROTOBUF_CONSTINIT const uint32_t | GScipOutput_Status_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_BoolParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_IntParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_LongParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_RealParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_CharParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_StringParamsEntry_DoNotUse_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipParameters_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipSolvingStats_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | GScipOutput_class_data_ |
| constexpr GScipParameters_Emphasis | GScipParameters_Emphasis_Emphasis_MIN |
| constexpr GScipParameters_Emphasis | GScipParameters_Emphasis_Emphasis_MAX |
| constexpr int | GScipParameters_Emphasis_Emphasis_ARRAYSIZE = 9 + 1 |
| constexpr GScipParameters_MetaParamValue | GScipParameters_MetaParamValue_MetaParamValue_MIN |
| constexpr GScipParameters_MetaParamValue | GScipParameters_MetaParamValue_MetaParamValue_MAX |
| constexpr int | GScipParameters_MetaParamValue_MetaParamValue_ARRAYSIZE = 3 + 1 |
| constexpr GScipOutput_Status | GScipOutput_Status_Status_MIN |
| constexpr GScipOutput_Status | GScipOutput_Status_Status_MAX |
| constexpr int | GScipOutput_Status_Status_ARRAYSIZE = 16 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 TeacherDefaultTypeInternal | _Teacher_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 StudentAssignmentDefaultTypeInternal | _StudentAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 StudentDefaultTypeInternal | _Student_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 RoomDefaultTypeInternal | _Room_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CourseDefaultTypeInternal | _Course_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 ClassAssignmentDefaultTypeInternal | _ClassAssignment_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CourseSchedulingResultDefaultTypeInternal | _CourseSchedulingResult_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CourseSchedulingModelDefaultTypeInternal | _CourseSchedulingModel_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | CourseSchedulingResultStatus_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CourseSchedulingModel_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CourseSchedulingResult_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | ClassAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | StudentAssignment_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | Course_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | Teacher_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | Student_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | Room_class_data_ |
| constexpr CourseSchedulingResultStatus | CourseSchedulingResultStatus_MIN |
| constexpr CourseSchedulingResultStatus | CourseSchedulingResultStatus_MAX |
| constexpr int | CourseSchedulingResultStatus_ARRAYSIZE = 6 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CapacityConstraintProto_CapacityTerm_ElementWeightPairDefaultTypeInternal | _CapacityConstraintProto_CapacityTerm_ElementWeightPair_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CapacityConstraintProto_CapacityTermDefaultTypeInternal | _CapacityConstraintProto_CapacityTerm_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 CapacityConstraintProtoDefaultTypeInternal | _CapacityConstraintProto_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CapacityConstraintProto_CapacityTerm_ElementWeightPair_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CapacityConstraintProto_CapacityTerm_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | CapacityConstraintProto_class_data_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SetCoverProto_SubsetDefaultTypeInternal | _SetCoverProto_Subset_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SetCoverSolutionResponseDefaultTypeInternal | _SetCoverSolutionResponse_default_instance_ |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 SetCoverProtoDefaultTypeInternal | _SetCoverProto_default_instance_ |
| PROTOBUF_CONSTINIT const uint32_t | SetCoverSolutionResponse_Status_internal_data_ [] |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SetCoverProto_Subset_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SetCoverProto_class_data_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | SetCoverSolutionResponse_class_data_ |
| constexpr SetCoverSolutionResponse_Status | SetCoverSolutionResponse_Status_Status_MIN |
| constexpr SetCoverSolutionResponse_Status | SetCoverSolutionResponse_Status_Status_MAX |
| constexpr int | SetCoverSolutionResponse_Status_Status_ARRAYSIZE = 4 + 1 |
| PROTOBUF_ATTRIBUTE_NO_DESTROY PROTOBUF_CONSTINIT OR_PROTO_DLL PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 Int128DefaultTypeInternal | _Int128_default_instance_ |
| PROTOBUF_CONSTINIT PROTOBUF_ATTRIBUTE_INIT_PRIORITY1 const::google::protobuf::internal::ClassDataFull | Int128_class_data_ |
| PROTOBUF_CONSTINIT const uint32_t | OptionalBoolean_internal_data_ [] |
| constexpr OptionalBoolean | OptionalBoolean_MIN |
| constexpr OptionalBoolean | OptionalBoolean_MAX |
| constexpr int | OptionalBoolean_ARRAYSIZE = 3 + 1 |
| using operations_research::AlignedAllocator |
Definition at line 72 of file aligned_memory.h.
| using operations_research::AlignedVector = std::vector<T, AlignedAllocator<T, alignment_bytes>> |
Definition at line 78 of file aligned_memory.h.
| using operations_research::ArcId = SubDagComputer::ArcId |
Definition at line 3165 of file local_search.cc.
| using operations_research::BaseInt = int32_t |
Definition at line 39 of file base_types.h.
Definition at line 492 of file set_cover_solve.cc.
Definition at line 48 of file capacity_model.h.
Definition at line 50 of file capacity_model.h.
| using operations_research::CapacityWeight = int64_t |
Definition at line 41 of file capacity_model.h.
Definition at line 52 of file capacity_model.h.
Definition at line 43 of file set_cover_heuristics.cc.
| using operations_research::ColumnEntryRange = util_intops::StrongIntRange<ColumnEntryIndex> |
Definition at line 56 of file base_types.h.
| using operations_research::CompressedColumn = CompressedStrongVector<ColumnEntryIndex, ElementIndex> |
Definition at line 259 of file base_types.h.
Definition at line 267 of file base_types.h.
Definition at line 262 of file base_types.h.
| using operations_research::CompressedRow = CompressedStrongVector<RowEntryIndex, SubsetIndex> |
Definition at line 260 of file base_types.h.
Definition at line 269 of file base_types.h.
Definition at line 264 of file base_types.h.
Definition at line 71 of file set_cover_views.h.
Definition at line 78 of file set_cover_views.h.
| using operations_research::Cost = double |
Definition at line 32 of file base_types.h.
| using operations_research::CostValue = BlossomGraph::CostValue |
Definition at line 121 of file perfect_matching.cc.
| using operations_research::ElementBoolVector = util_intops::StrongVector<ElementIndex, bool> |
Definition at line 72 of file base_types.h.
| using operations_research::ElementCostVector = util_intops::StrongVector<ElementIndex, Cost> |
Definition at line 59 of file base_types.h.
| using operations_research::ElementRange = util_intops::StrongIntRange<ElementIndex> |
Definition at line 55 of file base_types.h.
| using operations_research::ElementToIntVector = util_intops::StrongVector<ElementIndex, BaseInt> |
Definition at line 64 of file base_types.h.
Definition at line 75 of file base_types.h.
| typedef std::pair<int64_t, int64_t> operations_research::Fraction |
Definition at line 25 of file rational_approximation.h.
| using operations_research::FullElementBoolVector = util_intops::StrongVector<FullElementIndex, bool> |
Definition at line 58 of file set_cover_views.h.
| using operations_research::FullElementCostVector = util_intops::StrongVector<FullElementIndex, Cost> |
Definition at line 56 of file set_cover_views.h.
Definition at line 60 of file set_cover_views.h.
| using operations_research::FullSubsetBoolVector = util_intops::StrongVector<FullSubsetIndex, bool> |
Definition at line 59 of file set_cover_views.h.
| using operations_research::FullSubsetCostVector = util_intops::StrongVector<FullSubsetIndex, Cost> |
Definition at line 57 of file set_cover_views.h.
Definition at line 62 of file set_cover_views.h.
Definition at line 69 of file set_cover_views.h.
Definition at line 76 of file set_cover_views.h.
Definition at line 183 of file solve_flow_model.cc.
| using operations_research::GScipBranchingPriority = absl::flat_hash_map<SCIP_VAR*, int> |
Definition at line 36 of file gscip_message_handler.h.
| using operations_research::GScipSolution = absl::flat_hash_map<SCIP_VAR*, double> |
| typedef ZVector<int16_t> operations_research::Int16ZVector |
| typedef ZVector<int32_t> operations_research::Int32ZVector |
| typedef ZVector<int64_t> operations_research::Int64ZVector |
| typedef ZVector<int8_t> operations_research::Int8ZVector |
Definition at line 308 of file knapsack_solver.h.
| typedef std::function<MPSolverInterface*(MPSolver*)> operations_research::MPSolverInterfaceFactory |
Definition at line 1936 of file linear_solver.h.
| typedef std::function< const std::vector< int > &(int, int)> operations_research::NeighborAccessor |
Definition at line 346 of file local_search.cc.
| using operations_research::NodeId = SubDagComputer::NodeId |
Definition at line 3119 of file local_search.cc.
| typedef RoutingIndexManager::NodeIndex operations_research::NodeIndex = BlossomGraph::NodeIndex |
Definition at line 120 of file perfect_matching.cc.
| typedef uint32_t operations_research::PathDistance |
Definition at line 90 of file shortest_paths.h.
| typedef int operations_research::PathNodeIndex |
Definition at line 455 of file hamiltonian_path.h.
| using operations_research::random_engine_t = std::mt19937_64 |
Definition at line 23 of file random_engine.h.
| typedef std::function<const FloatSlopePiecewiseLinearFunction*(int64_t, int64_t)> operations_research::RoutingCumulDependentTransitCallback2 |
Definition at line 54 of file routing_types.h.
| typedef std::function<int64_t(RoutingNodeIndex, RoutingNodeIndex)> operations_research::RoutingNodeEvaluator2 |
Definition at line 33 of file cvrptw_lib.h.
| typedef std::function<int64_t(int64_t)> operations_research::RoutingTransitCallback1 |
Definition at line 50 of file routing_types.h.
| typedef std::function<int64_t(int64_t, int64_t)> operations_research::RoutingTransitCallback2 |
Definition at line 51 of file routing_types.h.
| using operations_research::SparseColumn = util_intops::StrongVector<ColumnEntryIndex, ElementIndex> |
Definition at line 61 of file base_types.h.
| using operations_research::SparseColumnView = util_intops::StrongVector<SubsetIndex, SparseColumnSparseColumn> |
Definition at line 68 of file base_types.h.
| using operations_research::SparseRow = util_intops::StrongVector<RowEntryIndex, SubsetIndex> |
Definition at line 62 of file base_types.h.
| using operations_research::SparseRowView = util_intops::StrongVector<ElementIndex, SparseRow> |
Definition at line 69 of file base_types.h.
| using operations_research::StrictVector = glop::StrictITIVector<IndexType, ValueType> |
Definition at line 44 of file set_cover_mip.cc.
| using operations_research::SubsetBoolVector = util_intops::StrongVector<SubsetIndex, bool> |
Definition at line 71 of file base_types.h.
| using operations_research::SubsetCostVector = util_intops::StrongVector<SubsetIndex, Cost> |
Definition at line 58 of file base_types.h.
| using operations_research::SubsetRange = util_intops::StrongIntRange<SubsetIndex> |
Definition at line 54 of file base_types.h.
| using operations_research::SubsetToIntVector = util_intops::StrongVector<SubsetIndex, BaseInt> |
Definition at line 65 of file base_types.h.
| typedef ZVector<uint16_t> operations_research::UInt16ZVector |
| typedef ZVector<uint32_t> operations_research::UInt32ZVector |
| typedef ZVector<uint64_t> operations_research::UInt64ZVector |
| typedef ZVector<uint8_t> operations_research::UInt8ZVector |
| using operations_research::UnsafeDenseSet = DenseSet<T, false> |
Definition at line 135 of file dense_set.h.
| using operations_research::value_type_t = typename std::iterator_traits<Iterator>::value_type |
| using operations_research::VariableDomainId = LocalSearchState::VariableDomainId |
Definition at line 2988 of file local_search.cc.
|
strong |
|
strong |
|
strong |
| Enumerator | |
|---|---|
| kSepaLp | |
| kSepaSol | |
| kEnfoLp | |
| kEnfoPs | |
| kConsCheck | |
| kConsLock | |
Definition at line 462 of file gscip_constraint_handler.h.
Definition at line 73 of file solver_parameters.pb.h.
Definition at line 224 of file routing_ils.pb.h.
Definition at line 101 of file course_scheduling.pb.h.
| Enumerator | |
|---|---|
| CALLBACK_EXCEPTION | |
Definition at line 201 of file xpress_interface.cc.
|
strong |
| Enumerator | |
|---|---|
| OPTIMAL | |
| RELAXED_OPTIMAL_ONLY | |
| FEASIBLE | |
| INFEASIBLE | |
Definition at line 158 of file routing_lp_scheduling.h.
|
strong |
| Enumerator | |
|---|---|
| EMPTY | |
| ORLIB | |
| RAIL | |
| FIMI | |
| PROTO | |
| PROTO_BIN | |
| TXT | |
Definition at line 157 of file set_cover_solve.cc.
Definition at line 92 of file routing_enums.pb.h.
| Enumerator | |
|---|---|
| FlowModelProto_ProblemType_LINEAR_SUM_ASSIGNMENT | |
| FlowModelProto_ProblemType_MAX_FLOW | |
| FlowModelProto_ProblemType_MIN_COST_FLOW | |
Definition at line 81 of file flow_problem.pb.h.
|
strong |
Definition at line 23 of file gscip_callback_result.h.
|
strong |
|
strong |
| Enumerator | |
|---|---|
| kInfoMessage | |
| kDialogMessage | |
| kWarningMessage | |
Definition at line 28 of file gscip_message_handler.h.
| enum operations_research::GScipOutput_Status : int |
Definition at line 201 of file gscip.pb.h.
Definition at line 119 of file gscip.pb.h.
Definition at line 163 of file gscip.pb.h.
|
strong |
Definition at line 124 of file routing_heuristic_parameters.pb.h.
Definition at line 86 of file routing_heuristic_parameters.pb.h.
Definition at line 144 of file routing_enums.pb.h.
|
strong |
| Enumerator | |
|---|---|
| kUnknown | |
| kPolling | |
| kPresolve | |
| kSimplex | |
| kMip | |
| kMipSolution | |
| kMipNode | |
| kBarrier | |
| kMessage | |
| kMultiObj | |
Definition at line 34 of file linear_solver_callback.h.
| Enumerator | |
|---|---|
| MPModelProto_Annotation_TargetType_VARIABLE_DEFAULT | |
| MPModelProto_Annotation_TargetType_CONSTRAINT | |
| MPModelProto_Annotation_TargetType_GENERAL_CONSTRAINT | |
Definition at line 214 of file linear_solver.pb.h.
Definition at line 281 of file linear_solver.pb.h.
Definition at line 247 of file linear_solver.pb.h.
| enum operations_research::MPSolverResponseStatus : int |
Definition at line 324 of file linear_solver.pb.h.
| enum operations_research::MPSosConstraint_Type : int |
| Enumerator | |
|---|---|
| MPSosConstraint_Type_SOS1_DEFAULT | |
| MPSosConstraint_Type_SOS2 | |
Definition at line 182 of file linear_solver.pb.h.
|
strong |
| Enumerator | |
|---|---|
| kAutoDetect | |
| kFree | |
| kFixed | |
Definition at line 302 of file mps_reader_template.h.
| enum operations_research::OptionalBoolean : int |
| Enumerator | |
|---|---|
| BOOL_UNSPECIFIED | |
| BOOL_FALSE | |
| BOOL_TRUE | |
| OptionalBoolean_INT_MIN_SENTINEL_DO_NOT_USE_ | |
| OptionalBoolean_INT_MAX_SENTINEL_DO_NOT_USE_ | |
Definition at line 66 of file optional_boolean.pb.h.
Definition at line 188 of file routing_ils.pb.h.
|
strong |
| Enumerator | |
|---|---|
| kProtoText | |
| kProtoBinary | |
| kJson | |
| kCanonicalJson | |
Definition at line 61 of file file_util.h.
|
strong |
| Enumerator | |
|---|---|
| kUp | |
| kDown | |
| kBoth | |
Definition at line 109 of file gscip_constraint_handler.h.
Definition at line 92 of file routing_parameters.pb.h.
Definition at line 185 of file routing_enums.pb.h.
Definition at line 150 of file routing_ils.pb.h.
|
strong |
| Enumerator | |
|---|---|
| kLazyConstraintAdded | |
| kCuttingPlaneAdded | |
| kDidNotFind | |
Definition at line 93 of file scip_callback.cc.
|
strong |
| Enumerator | |
|---|---|
| SCIP | |
| SAT | |
| GUROBI | |
| GLOP | |
| PDLP | |
Definition at line 25 of file set_cover_mip.h.
Definition at line 82 of file set_cover.pb.h.
This enum is used internally to do dynamic typing on subclasses of integer variables.
| Enumerator | |
|---|---|
| UNSPECIFIED | |
| DOMAIN_INT_VAR | |
| BOOLEAN_VAR | |
| CONST_VAR | |
| VAR_ADD_CST | |
| VAR_TIMES_CST | |
| CST_SUB_VAR | |
| OPP_VAR | |
| TRACE_VAR | |
Definition at line 130 of file constraint_solveri.h.
| H operations_research::AbslHashValue | ( | H | h, |
| const StrongIndex< StrongIndexName > & | i ) |
Definition at line 339 of file strong_integers.h.
| H operations_research::AbslHashValue | ( | H | h, |
| const StrongInt64< StrongIntegerName > & | i ) |
Definition at line 344 of file strong_integers.h.
| bool operations_research::AbslParseFlag | ( | const absl::string_view | text, |
| MPSolver::OptimizationProblemType * | solver_type, | ||
| std::string * | error ) |
Definition at line 505 of file linear_solver.cc.
| void operations_research::AbslStringify | ( | Sink & | sink, |
| StrongIndex< T... > | arg ) |
Definition at line 257 of file strong_integers.h.
| void operations_research::AbslStringify | ( | Sink & | sink, |
| StrongInt64< T... > | arg ) |
Definition at line 268 of file strong_integers.h.
|
inline |
Definition at line 1017 of file linear_solver.h.
| bool operations_research::AcceptDelta | ( | Search * | search, |
| Assignment * | delta, | ||
| Assignment * | deltadelta ) |
Definition at line 1380 of file constraint_solver.cc.
| void operations_research::AcceptNeighbor | ( | Search * | search | ) |
Definition at line 1384 of file constraint_solver.cc.
| void operations_research::AcceptUncheckedNeighbor | ( | Search * | search | ) |
Definition at line 1386 of file constraint_solver.cc.
| void operations_research::AddCallbackConstraint | ( | SCIP * | scip, |
| ScipConstraintHandler< ConstraintData > * | handler, | ||
| const std::string & | constraint_name, | ||
| const ConstraintData * | constraint_data, | ||
| const ScipCallbackConstraintOptions & | options ) |
Definition at line 261 of file scip_callback.h.
|
inline |
Definition at line 98 of file saturated_arithmetic.h.
| void operations_research::addhint | ( | const XPRSprob & | mLp, |
| int | length, | ||
| const double | solval[], | ||
| const int | colind[] ) |
Definition at line 192 of file xpress_interface.cc.
|
inline |
Definition at line 304 of file saturated_arithmetic.h.
|
inline |
Definition at line 122 of file saturated_arithmetic.h.
|
inline |
Definition at line 56 of file aligned_memory.h.
|
inline |
Definition at line 32 of file vector_sum.h.
|
inline |
Definition at line 45 of file aligned_memory.h.
| void operations_research::AppendDimensionCumulFilters | ( | const std::vector< RoutingDimension * > & | dimensions, |
| const RoutingSearchParameters & | parameters, | ||
| bool | filter_objective_cost, | ||
| bool | use_chain_cumul_filter, | ||
| std::vector< LocalSearchFilterManager::FilterEvent > * | filters ) |
Definition at line 2779 of file routing_filters.cc.
| void operations_research::AppendLightWeightDimensionFilters | ( | const PathState * | path_state, |
| const std::vector< RoutingDimension * > & | dimensions, | ||
| std::vector< LocalSearchFilterManager::FilterEvent > * | filters ) |
Appends dimension-based filters to the given list of filters using a path state.
Definition at line 2706 of file routing_filters.cc.
| glop::ProblemStatus operations_research::ApplyMipPresolveSteps | ( | const glop::GlopParameters & | glop_params, |
| MPModelProto * | model, | ||
| std::vector< std::unique_ptr< glop::Preprocessor > > * | for_postsolve, | ||
| SolverLogger * | logger ) |
Definition at line 38 of file sat_solver_utils.cc.
| void operations_research::ApplyVerifiedMPModelDelta | ( | const MPModelDeltaProto & | delta, |
| MPModelProto * | model ) |
Definition at line 981 of file model_validator.cc.
|
inline |
Definition at line 4308 of file constraint_solveri.h.
|
inline |
Definition at line 4299 of file constraint_solveri.h.
| bool operations_research::AreAllBoundOrNull | ( | const std::vector< IntVar * > & | vars, |
| const std::vector< T > & | values ) |
Returns true if all the variables are assigned to a single value, or if their corresponding value is null.
Definition at line 4315 of file constraint_solveri.h.
|
inline |
Returns true if all variables are assigned to 'value'.
Definition at line 4326 of file constraint_solveri.h.
| bool operations_research::AreAllGreaterOrEqual | ( | const std::vector< T > & | values, |
| const T & | value ) |
Definition at line 4229 of file constraint_solveri.h.
| bool operations_research::AreAllLessOrEqual | ( | const std::vector< T > & | values, |
| const T & | value ) |
Definition at line 4239 of file constraint_solveri.h.
| bool operations_research::AreAllNegative | ( | const std::vector< T > & | values | ) |
Definition at line 4254 of file constraint_solveri.h.
| bool operations_research::AreAllNull | ( | const std::vector< T > & | values | ) |
Definition at line 4224 of file constraint_solveri.h.
| bool operations_research::AreAllOnes | ( | const std::vector< T > & | values | ) |
Definition at line 4219 of file constraint_solveri.h.
| bool operations_research::AreAllPositive | ( | const std::vector< T > & | values | ) |
Definition at line 4249 of file constraint_solveri.h.
| bool operations_research::AreAllStrictlyNegative | ( | const std::vector< T > & | values | ) |
Definition at line 4264 of file constraint_solveri.h.
| bool operations_research::AreAllStrictlyPositive | ( | const std::vector< T > & | values | ) |
Definition at line 4259 of file constraint_solveri.h.
|
inline |
Definition at line 51 of file preprocessor.cc.
| bool operations_research::AreWithinAbsoluteOrRelativeTolerances | ( | FloatType | x, |
| FloatType | y, | ||
| FloatType | relative_tolerance, | ||
| FloatType | absolute_tolerance ) |
Definition at line 131 of file fp_utils.h.
| bool operations_research::AreWithinAbsoluteTolerance | ( | FloatType | x, |
| FloatType | y, | ||
| FloatType | absolute_tolerance ) |
Definition at line 152 of file fp_utils.h.
| void operations_research::AssertOptimalWithBestSolution | ( | const GScipResult & | actual_result, |
| const double | expected_objective_value, | ||
| const GScipSolution & | expected_solution, | ||
| const double | tolerance ) |
Definition at line 118 of file gscip_testing.cc.
| void operations_research::AssertOptimalWithPartialBestSolution | ( | const GScipResult & | actual_result, |
| const double | expected_objective_value, | ||
| const GScipSolution & | expected_solution, | ||
| const double | tolerance ) |
Definition at line 128 of file gscip_testing.cc.
|
new |
|
inline |
Definition at line 53 of file saturated_arithmetic.h.
|
inline |
Definition at line 56 of file strtoint.h.
|
inline |
Definition at line 57 of file strtoint.h.
| operations_research::FirstSolutionStrategy::Value operations_research::AutomaticFirstSolutionStrategy | ( | bool | has_pickup_deliveries, |
| bool | has_node_precedences, | ||
| bool | has_single_vehicle_node ) |
Returns the best value for the automatic first solution strategy, based on the given model parameters.
Definition at line 374 of file routing_search.cc.
| std::string operations_research::BasisStatusString | ( | const int | stat | ) |
Definition at line 50 of file glpk_formatters.cc.
|
inline |
Definition at line 733 of file sorted_interval_list.h.
| void operations_research::Benchmarks | ( | ) |
Definition at line 536 of file set_cover_solve.cc.
| std::vector< BenchmarksTableRow > operations_research::BenchmarksTable | ( | ) |
Definition at line 495 of file set_cover_solve.cc.
| Point operations_research::BinarySearch | ( | Point | x_true, |
| Point | x_false, | ||
| std::function< bool(Point)> | f ) |
Definition at line 219 of file binary_search.h.
| Point operations_research::BinarySearchMidpoint | ( | Point | x, |
| Point | y ) |
Definition at line 188 of file binary_search.h.
| std::vector< bool > operations_research::BipartiteMinimumVertexCover | ( | const std::vector< std::vector< int > > & | left_to_right_arcs, |
| int | num_right ) |
Definition at line 23 of file minimum_vertex_cover.cc.
|
inline |
|
inline |
| uint32_t operations_research::BitCountRange32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
| uint64_t operations_research::BitCountRange64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
|
extern |
Definition at line 445 of file demon_profiler.cc.
| IntExpr * operations_research::BuildDurationExpr | ( | IntervalVar * | var | ) |
Definition at line 171 of file sched_expr.cc.
| IntExpr * operations_research::BuildEndExpr | ( | IntervalVar * | var | ) |
Definition at line 181 of file sched_expr.cc.
| std::vector< typename Graph::NodeIndex > operations_research::BuildEulerianPath | ( | const Graph & | graph, |
| bool | assume_connectivity = true ) |
Definition at line 143 of file eulerian_path.h.
| std::vector< NodeIndex > operations_research::BuildEulerianPathFromNode | ( | const Graph & | graph, |
| NodeIndex | root ) |
Definition at line 79 of file eulerian_path.h.
| std::vector< typename Graph::NodeIndex > operations_research::BuildEulerianTour | ( | const Graph & | graph, |
| bool | assume_connectivity = true ) |
Definition at line 133 of file eulerian_path.h.
| std::vector< NodeIndex > operations_research::BuildEulerianTourFromNode | ( | const Graph & | graph, |
| NodeIndex | root, | ||
| bool | assume_connectivity = true ) |
Definition at line 121 of file eulerian_path.h.
| std::vector< typename Graph::ArcIndex > operations_research::BuildKruskalMinimumSpanningTree | ( | const Graph & | graph, |
| const ArcComparator & | arc_comparator ) |
Definition at line 87 of file minimum_spanning_tree.h.
| std::vector< typename Graph::ArcIndex > operations_research::BuildKruskalMinimumSpanningTreeFromSortedArcs | ( | const Graph & | graph, |
| absl::Span< const typename Graph::ArcIndex > | sorted_arcs ) |
Definition at line 49 of file minimum_spanning_tree.h.
|
extern |
Definition at line 3228 of file constraint_solver.cc.
|
extern |
Definition at line 3750 of file local_search.cc.
|
extern |
Definition at line 846 of file model_cache.cc.
| std::vector< typename Graph::ArcIndex > operations_research::BuildPrimMinimumSpanningTree | ( | const Graph & | graph, |
| const ArcValue & | arc_value ) |
Definition at line 113 of file minimum_spanning_tree.h.
|
extern |
| IntExpr * operations_research::BuildSafeDurationExpr | ( | IntervalVar * | var, |
| int64_t | unperformed_value ) |
Definition at line 196 of file sched_expr.cc.
| IntExpr * operations_research::BuildSafeEndExpr | ( | IntervalVar * | var, |
| int64_t | unperformed_value ) |
Definition at line 201 of file sched_expr.cc.
| IntExpr * operations_research::BuildSafeStartExpr | ( | IntervalVar * | var, |
| int64_t | unperformed_value ) |
Definition at line 191 of file sched_expr.cc.
| IntExpr * operations_research::BuildStartExpr | ( | IntervalVar * | var | ) |
Definition at line 161 of file sched_expr.cc.
|
extern |
Definition at line 3152 of file constraint_solver.cc.
|
inline |
Definition at line 61 of file saturated_arithmetic.h.
|
inline |
Definition at line 292 of file saturated_arithmetic.h.
|
inline |
Definition at line 233 of file saturated_arithmetic.h.
|
inline |
Definition at line 315 of file saturated_arithmetic.h.
|
inline |
Definition at line 59 of file saturated_arithmetic.h.
| T operations_research::CapOrFloatAdd | ( | T | x, |
| T | y ) |
Definition at line 347 of file saturated_arithmetic.h.
|
inline |
Definition at line 332 of file saturated_arithmetic.h.
|
inline |
Definition at line 258 of file saturated_arithmetic.h.
|
inline |
Definition at line 317 of file saturated_arithmetic.h.
|
inline |
Definition at line 328 of file saturated_arithmetic.h.
|
inline |
Definition at line 238 of file saturated_arithmetic.h.
|
inline |
Definition at line 143 of file saturated_arithmetic.h.
| int64_t operations_research::CeilRatio | ( | int64_t | value, |
| int64_t | positive_coeff ) |
Definition at line 106 of file sorted_interval_list.cc.
| void operations_research::CheckNodeIsValid | ( | typename GraphType::NodeIndex | node, |
| const GraphType & | graph ) |
Definition at line 282 of file dag_shortest_path.h.
| BaseAssignVariables::Mode operations_research::ChooseMode | ( | Solver::IntValueStrategy | val_str | ) |
|
extern |
Definition at line 6385 of file expressions.cc.
|
inline |
|
inline |
| std::vector< SubsetIndex > operations_research::ClearMostCoveredElements | ( | absl::Span< const SubsetIndex > | focus, |
| BaseInt | max_num_subsets, | ||
| SetCoverInvariant * | inv ) |
Definition at line 873 of file set_cover_heuristics.cc.
| std::vector< SubsetIndex > operations_research::ClearMostCoveredElements | ( | BaseInt | max_num_subsets, |
| SetCoverInvariant * | inv ) |
Definition at line 867 of file set_cover_heuristics.cc.
| std::vector< SubsetIndex > operations_research::ClearRandomSubsets | ( | absl::Span< const SubsetIndex > | focus, |
| BaseInt | num_subsets_to_choose, | ||
| SetCoverInvariant * | inv ) |
Definition at line 833 of file set_cover_heuristics.cc.
| std::vector< SubsetIndex > operations_research::ClearRandomSubsets | ( | BaseInt | num_subsets, |
| SetCoverInvariant * | inv ) |
Definition at line 828 of file set_cover_heuristics.cc.
| bool operations_research::CompareKnapsackItemWithEfficiencyInDecreasingEfficiencyOrder | ( | const KnapsackItemWithEfficiency & | item1, |
| const KnapsackItemWithEfficiency & | item2 ) |
Definition at line 733 of file knapsack_solver.cc.
| void operations_research::ComputeAllToAllShortestPathsWithMultipleThreads | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| int | num_threads, | ||
| GenericPathContainer< GraphType > *const | path_container ) |
Definition at line 272 of file shortest_paths.h.
| int64_t operations_research::ComputeBestVehicleToResourceAssignment | ( | absl::Span< const int > | vehicles, |
| const util_intops::StrongVector< RoutingModel::ResourceClassIndex, std::vector< int > > & | resource_indices_per_class, | ||
| const util_intops::StrongVector< RoutingModel::ResourceClassIndex, absl::flat_hash_set< int > > & | ignored_resources_per_class, | ||
| std::function< const std::vector< int64_t > *(int)> | vehicle_to_resource_class_assignment_costs, | ||
| std::vector< int > * | resource_indices ) |
Definition at line 3207 of file routing_lp_scheduling.cc.
| std::vector< Bitset64< int64_t > > operations_research::ComputeDagConnectivity | ( | absl::Span< const std::pair< int, int > > | arcs, |
| bool * | error_was_cyclic, | ||
| std::vector< int > * | error_cycle_out ) |
Definition at line 60 of file dag_connectivity.cc.
| std::vector< Bitset64< int64_t > > operations_research::ComputeDagConnectivityOrDie | ( | absl::Span< const std::pair< int, int > > | arcs | ) |
Definition at line 111 of file dag_connectivity.cc.
| std::vector< T > operations_research::ComputeDeciles | ( | std::vector< T > | values | ) |
Definition at line 660 of file set_cover_model.cc.
|
inline |
Definition at line 118 of file glpk_computational_form.h.
|
inline |
Definition at line 108 of file glpk_computational_form.h.
|
inline |
Definition at line 98 of file glpk_computational_form.h.
|
inline |
Definition at line 88 of file glpk_computational_form.h.
|
inline |
Definition at line 128 of file glpk_computational_form.h.
| int64_t operations_research::ComputeGcdOfRoundedDoubles | ( | absl::Span< const double > | x, |
| double | scaling_factor ) |
Definition at line 207 of file fp_utils.cc.
| void operations_research::ComputeManyToAllShortestPathsWithMultipleThreads | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| const std::vector< typename GraphType::NodeIndex > & | sources, | ||
| int | num_threads, | ||
| GenericPathContainer< GraphType > *const | path_container ) |
Definition at line 260 of file shortest_paths.h.
| void operations_research::ComputeManyToManyShortestPathsWithMultipleThreads | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| const std::vector< typename GraphType::NodeIndex > & | sources, | ||
| const std::vector< typename GraphType::NodeIndex > & | destinations, | ||
| int | num_threads, | ||
| GenericPathContainer< GraphType > *const | paths ) |
Definition at line 744 of file shortest_paths.h.
| absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > operations_research::ComputeMinimumWeightMatching | ( | const GraphType & | graph, |
| const WeightFunctionType & | weight ) |
Definition at line 124 of file christofides.h.
| absl::StatusOr< std::vector< std::pair< typename GraphType::NodeIndex, typename GraphType::NodeIndex > > > operations_research::ComputeMinimumWeightMatchingWithMIP | ( | const GraphType & | graph, |
| const WeightFunctionType & | weight ) |
Definition at line 166 of file christofides.h.
| void operations_research::ComputeOneToAllShortestPaths | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| typename GraphType::NodeIndex | source, | ||
| GenericPathContainer< GraphType > *const | path_container ) |
Definition at line 208 of file shortest_paths.h.
| void operations_research::ComputeOneToManyShortestPaths | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| typename GraphType::NodeIndex | source, | ||
| const std::vector< typename GraphType::NodeIndex > & | destinations, | ||
| GenericPathContainer< GraphType > *const | path_container ) |
Definition at line 220 of file shortest_paths.h.
| std::vector< typename GraphType::NodeIndex > operations_research::ComputeOneToOneShortestPath | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| typename GraphType::NodeIndex | source, | ||
| typename GraphType::NodeIndex | destination ) |
Definition at line 239 of file shortest_paths.h.
| void operations_research::ComputeScalingErrors | ( | absl::Span< const double > | input, |
| absl::Span< const double > | lb, | ||
| absl::Span< const double > | ub, | ||
| double | scaling_factor, | ||
| double * | max_relative_coeff_error, | ||
| double * | max_scaled_sum_error ) |
Definition at line 175 of file fp_utils.cc.
| SetCoverModel::Stats operations_research::ComputeStats | ( | std::vector< T > | samples | ) |
Definition at line 635 of file set_cover_model.cc.
| std::vector< int64_t > operations_research::ComputeVehicleEndChainStarts | ( | const RoutingModel & | model | ) |
Computes and returns the first node in the end chain of each vehicle in the model, based on the current bound NextVar values.
Definition at line 386 of file routing_search.cc.
| bool operations_research::ComputeVehicleToResourceClassAssignmentCosts | ( | int | v, |
| double | solve_duration_ratio, | ||
| const RoutingModel::ResourceGroup & | resource_group, | ||
| const util_intops::StrongVector< RoutingModel::ResourceClassIndex, absl::flat_hash_set< int > > & | ignored_resources_per_class, | ||
| const std::function< int64_t(int64_t)> & | next_accessor, | ||
| const std::function< int64_t(int64_t, int64_t)> & | transit_accessor, | ||
| bool | optimize_vehicle_costs, | ||
| LocalDimensionCumulOptimizer * | lp_optimizer, | ||
| LocalDimensionCumulOptimizer * | mp_optimizer, | ||
| std::vector< int64_t > * | assignment_costs, | ||
| std::vector< std::vector< int64_t > > * | cumul_values, | ||
| std::vector< std::vector< int64_t > > * | break_values ) |
Definition at line 3058 of file routing_lp_scheduling.cc.
| PathWithLength operations_research::ConstrainedShortestPathsOnDag | ( | const int | num_nodes, |
| absl::Span< const ArcWithLengthAndResources > | arcs_with_length_and_resources, | ||
| int | source, | ||
| int | destination, | ||
| const std::vector< double > & | max_resources ) |
Definition at line 40 of file dag_constrained_shortest_path.cc.
| int operations_research::ConstraintHandlerResultPriority | ( | const GScipCallbackResult | result, |
| const ConstraintHandlerCallbackType | callback_type ) |
Definition at line 251 of file gscip_constraint_handler.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::ConstraintSolverParameters_TrailCompression_descriptor | ( | ) |
Definition at line 205 of file solver_parameters.pb.cc.
|
inline |
Definition at line 87 of file solver_parameters.pb.h.
|
inline |
Definition at line 100 of file solver_parameters.pb.h.
| const ::std::string & operations_research::ConstraintSolverParameters_TrailCompression_Name | ( | T | value | ) |
Definition at line 93 of file solver_parameters.pb.h.
|
inline |
Definition at line 104 of file solver_parameters.pb.h.
| std::string operations_research::ConstraintToString | ( | const sat::ConstraintProto & | constraint, |
| const sat::CpModelProto & | model_, | ||
| bool | show_enforcement = true ) |
Definition at line 3446 of file routing_lp_scheduling.cc.
| bool operations_research::ContinueAtLocalOptimum | ( | Search * | search | ) |
Definition at line 1376 of file constraint_solver.cc.
| bool operations_research::ConvertDimacsToFlowModel | ( | absl::string_view | file, |
| FlowModelProto * | flow_model ) |
Definition at line 111 of file solve_flow_model.cc.
| void operations_research::ConvertFlowModelToDimacs | ( | const FlowModelProto & | flow_model, |
| std::string * | dimacs ) |
Definition at line 66 of file solve_flow_model.cc.
| SCIP_RESULT operations_research::ConvertGScipCallbackResult | ( | const GScipCallbackResult | result | ) |
Definition at line 21 of file gscip_callback_result.cc.
|
inline |
Definition at line 37 of file proto_utils.h.
| std::pair< Point, Value > operations_research::ConvexMinimum | ( | absl::Span< const Point > | sorted_points, |
| std::function< Value(Point)> | f ) |
Definition at line 324 of file binary_search.h.
| std::pair< Point, Value > operations_research::ConvexMinimum | ( | bool | is_to_the_right, |
| std::pair< Point, Value > | current_min, | ||
| absl::Span< const Point > | sorted_points, | ||
| std::function< Value(Point)> | f ) |
Definition at line 333 of file binary_search.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::CoolingScheduleStrategy_Value_descriptor | ( | ) |
Definition at line 701 of file routing_ils.pb.cc.
|
inline |
Definition at line 239 of file routing_ils.pb.h.
|
inline |
Definition at line 252 of file routing_ils.pb.h.
| const ::std::string & operations_research::CoolingScheduleStrategy_Value_Name | ( | T | value | ) |
Definition at line 245 of file routing_ils.pb.h.
|
inline |
Definition at line 256 of file routing_ils.pb.h.
| std::vector< int > operations_research::CountTriangles | ( | const ::util::StaticGraph< int, int > & | graph, |
| int | max_degree ) |
Definition at line 57 of file find_graph_symmetries.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::CourseSchedulingResultStatus_descriptor | ( | ) |
Definition at line 448 of file course_scheduling.pb.cc.
|
inline |
Definition at line 120 of file course_scheduling.pb.h.
|
inline |
Definition at line 133 of file course_scheduling.pb.h.
| const ::std::string & operations_research::CourseSchedulingResultStatus_Name | ( | T | value | ) |
Definition at line 126 of file course_scheduling.pb.h.
|
inline |
Definition at line 137 of file course_scheduling.pb.h.
| void operations_research::CoverArcsByCliques | ( | std::function< bool(int, int)> | graph, |
| int | node_count, | ||
| std::function< bool(const std::vector< int > &)> | callback ) |
Definition at line 244 of file cliques.cc.
|
inline |
Definition at line 175 of file constraint_solver.h.
| std::string operations_research::CropMultiLineString | ( | const std::string & | s, |
| int | max_line_length, | ||
| int | max_num_lines ) |
Definition at line 25 of file string_util.cc.
| const GScipConstraintOptions & operations_research::DefaultGScipConstraintOptions | ( | ) |
| const GScipVariableOptions & operations_research::DefaultGScipVariableOptions | ( | ) |
| std::string operations_research::DefaultPhaseStatString | ( | DecisionBuilder * | db | ) |
Definition at line 1121 of file default_search.cc.
| RoutingModelParameters operations_research::DefaultRoutingModelParameters | ( | ) |
Definition at line 49 of file routing_parameters.cc.
| RoutingSearchParameters operations_research::DefaultRoutingSearchParameters | ( | ) |
Definition at line 263 of file routing_parameters.cc.
| RoutingSearchParameters operations_research::DefaultSecondaryRoutingSearchParameters | ( | ) |
Definition at line 269 of file routing_parameters.cc.
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | LeafIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingCostClassIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingDimensionIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingDisjunctionIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingNodeIndex | ) |
Defining common types used in the routing library outside the main RoutingModel class has several purposes: 1) It allows some small libraries to avoid a dependency on routing.{h,cc}, eg. routing_neighborhoods.h. 2) It allows an easier wrapping via SWIG, which can have issues with intra-class types. Users that depend on routing.{h,cc} should just use the RoutingModel:: equivalent, eg. RoutingModel::NodeIndex.
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingResourceClassIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | RoutingVehicleClassIndex | ) |
| operations_research::DEFINE_STRONG_INDEX_TYPE | ( | TreeNodeIndex | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | CapacityTermIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | ColumnEntryIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | ElementIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | FullElementIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | FullSubsetIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | RowEntryIndex | , |
| BaseInt | ) |
| operations_research::DEFINE_STRONG_INT_TYPE | ( | SubsetIndex | , |
| BaseInt | ) |
| void operations_research::DefragmentRanges | ( | std::vector< T > & | mutable_input, |
| CommittableArray< IndexRange > & | ranges, | ||
| std::vector< T > & | temp_container ) |
Definition at line 158 of file routing_filter_committables.h.
|
extern |
Definition at line 453 of file demon_profiler.cc.
|
extern |
Definition at line 3757 of file local_search.cc.
| void operations_research::DemonProfilerAddFakeRun | ( | DemonProfiler *const | monitor, |
| Demon *const | demon, | ||
| int64_t | start_time, | ||
| int64_t | end_time, | ||
| bool | is_fail ) |
Definition at line 470 of file demon_profiler.cc.
| void operations_research::DemonProfilerBeginInitialPropagation | ( | DemonProfiler *const | monitor, |
| Constraint *const | constraint ) |
Definition at line 488 of file demon_profiler.cc.
| void operations_research::DemonProfilerEndInitialPropagation | ( | DemonProfiler *const | monitor, |
| Constraint *const | constraint ) |
Definition at line 493 of file demon_profiler.cc.
| void operations_research::DemonProfilerExportInformation | ( | DemonProfiler *const | monitor, |
| const Constraint *const | constraint, | ||
| int64_t *const | fails, | ||
| int64_t *const | initial_propagation_runtime, | ||
| int64_t *const | demon_invocations, | ||
| int64_t *const | total_demon_runtime, | ||
| int *const | demon_count ) |
Definition at line 476 of file demon_profiler.cc.
| void operations_research::DisableAllCutsExceptUserDefined | ( | GScipParameters * | parameters | ) |
Definition at line 147 of file gscip_parameters.cc.
| void operations_research::DisableAllLocalSearchOperators | ( | RoutingSearchParameters::LocalSearchNeighborhoodOperators * | operators | ) |
Definition at line 47 of file routing_parameters_utils.cc.
| void operations_research::DisplayPlan | ( | const RoutingIndexManager & | manager, |
| const RoutingModel & | routing, | ||
| const operations_research::Assignment & | plan, | ||
| bool | use_same_vehicle_costs, | ||
| int64_t | max_nodes_per_group, | ||
| int64_t | same_vehicle_cost, | ||
| absl::Span< const std::string > | dimension_names ) |
Definition at line 165 of file cvrptw_lib.cc.
| std::string operations_research::DomainToString | ( | const ::google::protobuf::RepeatedField< int64_t > * | domain | ) |
Definition at line 3398 of file routing_lp_scheduling.cc.
| SCIP_RETCODE operations_research::DropAllEvents | ( | GScipEventHandler & | handler | ) |
Definition at line 133 of file gscip_event_handler.cc.
| testing::Matcher< std::string > operations_research::EmptyOrGurobiLicenseWarning | ( | ) |
Definition at line 23 of file gurobi_stdout_matchers.cc.
| testing::Matcher< std::string > operations_research::EmptyOrGurobiLicenseWarningIfGurobi | ( | const bool | is_gurobi | ) |
Definition at line 30 of file gurobi_stdout_matchers.cc.
| operations_research::ENABLE_EXPLICIT_STRONG_TYPE_CAST | ( | ElementIndex | , |
| FullElementIndex | ) |
| operations_research::ENABLE_EXPLICIT_STRONG_TYPE_CAST | ( | FullElementIndex | , |
| ElementIndex | ) |
| operations_research::ENABLE_EXPLICIT_STRONG_TYPE_CAST | ( | FullSubsetIndex | , |
| SubsetIndex | ) |
| operations_research::ENABLE_EXPLICIT_STRONG_TYPE_CAST | ( | SubsetIndex | , |
| FullSubsetIndex | ) |
| std::string operations_research::EncodeParametersAsString | ( | const P & | parameters | ) |
Definition at line 71 of file proto_utils.h.
|
inline |
Definition at line 736 of file sorted_interval_list.h.
| LocalSearchOperator * operations_research::ExchangeAndMakeActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
Definition at line 900 of file local_search.cc.
| LocalSearchOperator * operations_research::ExchangePathStartEndsAndMakeActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
Definition at line 947 of file local_search.cc.
| void operations_research::ExploreAndCountAllProtoPathsInInstance | ( | const google::protobuf::Message & | message, |
| absl::flat_hash_map< std::string, int > * | proto_path_counts ) |
| absl::StatusOr< std::string > operations_research::ExportModelAsLpFormat | ( | const MPModelProto & | model, |
| const MPModelExportOptions & | options = MPModelExportOptions() ) |
Outputs the current model (variables, constraints, objective) as a string encoded in the so-called "CPLEX LP file format" as generated by SCIP. The LP file format is easily readable by a human.
Returns false if some error has occurred during execution. The validity of names is automatically checked. If a variable name or a constraint name is invalid or non-existent, a new valid name is automatically generated.
If 'obfuscated' is true, the variable and constraint names of proto_ are not used. Variable and constraint names of the form "V12345" and "C12345" are used instead.
For more information about the different LP file formats: http://lpsolve.sourceforge.net/5.5/lp-format.htm The following give a reasonable idea of the CPLEX LP file format: http://lpsolve.sourceforge.net/5.5/CPLEX-format.htm https://www.ibm.com/docs/en/icos/12.8.0.0?topic=cplex-lp-file-format-algebraic-representation http://www.gurobi.com/documentation/5.1/reference-manual/node871
Definition at line 224 of file model_exporter.cc.
| absl::StatusOr< std::string > operations_research::ExportModelAsMpsFormat | ( | const MPModelProto & | model, |
| const MPModelExportOptions & | options = MPModelExportOptions() ) |
Outputs the current model (variables, constraints, objective) as a string encoded in MPS file format, using the "free" MPS format.
Returns false if some error has occurred during execution. Models with maximization objectives trigger an error, because MPS can encode only minimization problems.
The validity of names is automatically checked. If a variable name or a constraint name is invalid or non-existent, a new valid name is automatically generated.
Name validity and obfuscation works exactly as in ExportModelAsLpFormat().
For more information about the MPS format: http://en.wikipedia.org/wiki/MPS_(format) A close-to-original description coming from OSL: http://tinyurl.com/mps-format-by-osl A recent description from CPLEX: http://tinyurl.com/mps-format-by-cplex CPLEX extensions: http://tinyurl.com/mps-extensions-by-cplex Gurobi's description: http://www.gurobi.com/documentation/5.1/reference-manual/node869
Definition at line 241 of file model_exporter.cc.
| std::optional< LazyMutableCopy< MPModelProto > > operations_research::ExtractValidMPModelOrPopulateResponseStatus | ( | const MPModelRequest & | request, |
| MPSolutionResponse * | response ) |
If the model is valid and non-empty, returns it (possibly after extracting the model_delta). If invalid or empty, updates response and returns null.
Definition at line 685 of file model_validator.cc.
|
inline |
Definition at line 256 of file fp_utils.h.
|
inline |
Definition at line 257 of file fp_utils.h.
| uint64_t operations_research::fasthash64 | ( | const void * | buf, |
| size_t | len, | ||
| uint64_t | seed ) |
| bool operations_research::FillDimensionValuesFromRoutingDimension | ( | int | path, |
| int64_t | capacity, | ||
| int64_t | span_upper_bound, | ||
| absl::Span< const DimensionValues::Interval > | cumul_of_node, | ||
| absl::Span< const DimensionValues::Interval > | slack_of_node, | ||
| absl::AnyInvocable< int64_t(int64_t, int64_t) const > | evaluator, | ||
| DimensionValues & | dimension_values ) |
Definition at line 1474 of file routing_filters.cc.
| void operations_research::FillPathEvaluation | ( | absl::Span< const int64_t > | path, |
| const RoutingModel::TransitCallback2 & | evaluator, | ||
| std::vector< int64_t > * | values ) |
Definition at line 6893 of file routing.cc.
| void operations_research::FillPrePostVisitValues | ( | int | path, |
| const DimensionValues & | dimension_values, | ||
| std::optional< absl::AnyInvocable< int64_t(int64_t, int64_t) const > > | pre_travel_evaluator, | ||
| std::optional< absl::AnyInvocable< int64_t(int64_t, int64_t) const > > | post_travel_evaluator, | ||
| PrePostVisitValues & | visit_values ) |
Definition at line 1554 of file routing_filters.cc.
|
inline |
Definition at line 4355 of file constraint_solveri.h.
| void operations_research::FindCliques | ( | std::function< bool(int, int)> | graph, |
| int | node_count, | ||
| std::function< bool(const std::vector< int > &)> | callback ) |
Definition at line 230 of file cliques.cc.
| std::string operations_research::FindErrorInMPModelDeltaProto | ( | const MPModelDeltaProto & | delta, |
| const MPModelProto & | model ) |
Like FindErrorInMPModelProto, but for a MPModelDeltaProto applied to a given baseline model (assumed valid, eg. FindErrorInMPModelProto(model)=""). Works in O(|model_delta|) + O(num_vars in model), but the latter term has a very small constant factor.
Definition at line 840 of file model_validator.cc.
| std::string operations_research::FindErrorInMPModelForScip | ( | const MPModelProto & | model, |
| SCIP * | scip ) |
Definition at line 595 of file scip_proto_solver.cc.
| std::string operations_research::FindErrorInMPModelProto | ( | const MPModelProto & | model, |
| double | abs_value_threshold = 0.0, | ||
| bool | accept_trivially_infeasible_bounds = false ) |
Returns an empty string iff the model is valid and not trivially infeasible. Otherwise, returns a description of the first error or trivial infeasibility variable or constraint bound encountered.
abs_value_threshold is the (exclusive) limit for the abs value of constraint coefficients, objective coefficients, etc. If unspecified, or 0, it defaults to FLAGS_model_validator_infinity.
NOTE(user): the code of this method (and the client code too!) is considerably simplified by this string-based, simple API. If clients require it, we could add a formal error status enum.
Definition at line 556 of file model_validator.cc.
| std::string operations_research::FindErrorInRoutingSearchParameters | ( | const RoutingSearchParameters & | search_parameters | ) |
Returns an empty std::string if the routing search parameters are valid, and a non-empty, human readable error description if they're not.
Definition at line 627 of file routing_parameters.cc.
| std::vector< std::string > operations_research::FindErrorsInRoutingSearchParameters | ( | const RoutingSearchParameters & | search_parameters | ) |
Returns a list of std::string describing the errors in the routing search parameters. Returns an empty vector if the parameters are valid.
Definition at line 634 of file routing_parameters.cc.
| std::string operations_research::FindFeasibilityErrorInSolutionHint | ( | const MPModelProto & | model, |
| double | tolerance ) |
Returns an empty string if the solution hint given in the model is a feasible solution. Otherwise, returns a description of the first reason for infeasibility.
This function can be useful for debugging/checking that the given solution hint is feasible when it is expected to be the case. The feasibility is checked up to the given tolerance using the ::operations_research::IsLowerWithinTolerance() function.
Definition at line 779 of file model_validator.cc.
| bool operations_research::FindMostExpensiveArcsOnRoute | ( | int | num_arcs, |
| int64_t | start, | ||
| const std::function< int64_t(int64_t)> & | next_accessor, | ||
| const std::function< bool(int64_t)> & | is_end, | ||
| const std::function< int64_t(int64_t, int64_t, int64_t)> & | arc_cost_for_route_start, | ||
| std::vector< std::pair< int64_t, int > > * | most_expensive_arc_starts_and_ranks, | ||
| std::pair< int, int > * | first_expensive_arc_indices ) |
Definition at line 123 of file routing_utils.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::FirstSolutionStrategy_Value_descriptor | ( | ) |
Definition at line 153 of file routing_enums.pb.cc.
|
inline |
Definition at line 122 of file routing_enums.pb.h.
|
inline |
Definition at line 135 of file routing_enums.pb.h.
| const ::std::string & operations_research::FirstSolutionStrategy_Value_Name | ( | T | value | ) |
Definition at line 128 of file routing_enums.pb.h.
|
inline |
Definition at line 139 of file routing_enums.pb.h.
| void operations_research::FixFlagsAndEnvironmentForSwig | ( | ) |
Definition at line 28 of file logging.cc.
| int64_t operations_research::FloorRatio | ( | int64_t | value, |
| int64_t | positive_coeff ) |
Definition at line 113 of file sorted_interval_list.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::FlowModelProto_ProblemType_descriptor | ( | ) |
Definition at line 191 of file flow_problem.pb.cc.
|
inline |
Definition at line 92 of file flow_problem.pb.h.
|
inline |
Definition at line 105 of file flow_problem.pb.h.
| const ::std::string & operations_research::FlowModelProto_ProblemType_Name | ( | T | value | ) |
Definition at line 98 of file flow_problem.pb.h.
|
inline |
Definition at line 109 of file flow_problem.pb.h.
| std::string operations_research::FormatCounter | ( | int64_t | num | ) |
Definition at line 30 of file logging.cc.
| std::string operations_research::FullProtocolMessageAsString | ( | const google::protobuf::Message & | message, |
| int | indent_level ) |
Definition at line 63 of file proto_tools.cc.
| double operations_research::GetBestScalingOfDoublesToInt64 | ( | absl::Span< const double > | input, |
| absl::Span< const double > | lb, | ||
| absl::Span< const double > | ub, | ||
| int64_t | max_absolute_sum ) |
Definition at line 184 of file fp_utils.cc.
| void operations_research::GetBestScalingOfDoublesToInt64 | ( | absl::Span< const double > | input, |
| int64_t | max_absolute_sum, | ||
| double * | scaling_factor, | ||
| double * | max_relative_coeff_error ) |
Definition at line 195 of file fp_utils.cc.
| void operations_research::GetGraphNodes | ( | const GraphType & | graph, |
| std::vector< typename GraphType::NodeIndex > * | nodes ) |
Definition at line 180 of file shortest_paths.h.
| void operations_research::GetGraphNodesFromGraph | ( | const GraphType & | graph, |
| std::vector< typename GraphType::NodeIndex > * | nodes ) |
Definition at line 192 of file shortest_paths.h.
| absl::StatusOr< GRBenv * > operations_research::GetGurobiEnv | ( | ) |
Definition at line 43 of file gurobi_util.cc.
| int operations_research::getitcnt | ( | const XPRSprob & | mLp | ) |
Definition at line 172 of file xpress_interface.cc.
| std::vector< LocalCheapestInsertionParameters::InsertionSortingProperty > operations_research::GetLocalCheapestInsertionSortingProperties | ( | absl::Span< const int > | lci_insertion_sorting_properties | ) |
Definition at line 24 of file routing_parameters_utils.cc.
|
static |
Definition at line 509 of file xpress_interface.cc.
|
static |
Definition at line 831 of file xpress_interface.cc.
|
static |
Definition at line 594 of file xpress_interface.cc.
|
static |
Definition at line 494 of file xpress_interface.cc.
| std::optional< LazyMutableCopy< MPModelProto > > operations_research::GetMPModelOrPopulateResponse | ( | LazyMutableCopy< MPModelRequest > & | request, |
| MPSolutionResponse * | response ) |
Same as ExtractValidMPModelOrPopulateResponseStatus() but if we already have ownership of the request, do not do any copy even when needed. Note that the MPModelProto in the request will be cleared in this case.
Definition at line 691 of file model_validator.cc.
| int operations_research::getnodecnt | ( | const XPRSprob & | mLp | ) |
Definition at line 178 of file xpress_interface.cc.
| int operations_research::getnumcols | ( | const XPRSprob & | mLp | ) |
Definition at line 160 of file xpress_interface.cc.
| int operations_research::getnumrows | ( | const XPRSprob & | mLp | ) |
Definition at line 166 of file xpress_interface.cc.
| RecreateParameters::ParametersCase operations_research::GetParameterCaseForRecreateHeuristic | ( | FirstSolutionStrategy::Value | recreate_heuristic | ) |
Definition at line 24 of file routing_ils_parameters_utils.cc.
| int64_t operations_research::GetProcessMemoryUsage | ( | ) |
Definition at line 91 of file sysinfo.cc.
| std::string operations_research::GetRecreateParametersName | ( | RecreateParameters::ParametersCase | parameters_case | ) |
Definition at line 51 of file routing_ils_parameters_utils.cc.
| int32_t operations_research::GetSeed | ( | bool | deterministic | ) |
Definition at line 40 of file cvrptw_lib.cc.
| std::pair< double, double > operations_research::GetSimulatedAnnealingTemperatures | ( | const RoutingModel & | model, |
| const SimulatedAnnealingAcceptanceStrategy & | sa_params, | ||
| std::mt19937 * | rnd ) |
Definition at line 1279 of file routing_ils.cc.
| std::string operations_research::getSolverVersion | ( | XPRSprob const & | prob | ) |
Definition at line 46 of file xpress_interface.cc.
| std::vector< RecreateParameters::ParametersCase > operations_research::GetSupportedRecreateParametersCases | ( | ) |
Definition at line 45 of file routing_ils_parameters_utils.cc.
| MPSolutionResponse operations_research::GlopSolveProto | ( | LazyMutableCopy< MPModelRequest > | request, |
| std::atomic< bool > * | interrupt_solve, | ||
| std::function< void(const std::string &)> | logging_callback ) |
Definition at line 107 of file glop_proto_solver.cc.
| std::string operations_research::GlopSolverVersion | ( | ) |
Definition at line 234 of file glop_proto_solver.cc.
| MPSolver::BasisStatus operations_research::GlopToMPSolverConstraintStatus | ( | glop::ConstraintStatus | s | ) |
Definition at line 95 of file glop_utils.cc.
| MPSolver::ResultStatus operations_research::GlopToMPSolverResultStatus | ( | glop::ProblemStatus | s | ) |
Definition at line 22 of file glop_utils.cc.
| MPSolver::BasisStatus operations_research::GlopToMPSolverVariableStatus | ( | glop::VariableStatus | s | ) |
Definition at line 61 of file glop_utils.cc.
| void operations_research::GLPKGatherInformationCallback | ( | glp_tree * | tree, |
| void * | info ) |
Definition at line 57 of file glpk_interface.cc.
| bool util::GraphIsSymmetric | ( | const Graph & | graph | ) |
| absl::Status operations_research::GScipAddQuadraticObjectiveTerm | ( | GScip * | gscip, |
| std::vector< SCIP_Var * > | quadratic_variables1, | ||
| std::vector< SCIP_Var * > | quadratic_variables2, | ||
| std::vector< double > | quadratic_coefficients, | ||
| absl::string_view | name ) |
Definition at line 150 of file gscip_ext.cc.
| bool operations_research::GScipCatchCtrlC | ( | const GScipParameters & | parameters | ) |
Definition at line 136 of file gscip_parameters.cc.
| bool operations_research::GScipCatchCtrlCSet | ( | const GScipParameters & | parameters | ) |
Definition at line 143 of file gscip_parameters.cc.
| absl::Status operations_research::GScipCreateAbs | ( | GScip * | gscip, |
| SCIP_Var * | x, | ||
| SCIP_Var * | abs_x, | ||
| absl::string_view | name ) |
Definition at line 76 of file gscip_ext.cc.
| absl::Status operations_research::GScipCreateIndicatorRange | ( | GScip * | gscip, |
| const GScipIndicatorRangeConstraint & | indicator_range, | ||
| absl::string_view | name, | ||
| const GScipConstraintOptions & | options ) |
Definition at line 180 of file gscip_ext.cc.
| absl::Status operations_research::GScipCreateMaximum | ( | GScip * | gscip, |
| const GScipLinearExpr & | resultant, | ||
| absl::Span< const GScipLinearExpr > | terms, | ||
| absl::string_view | name ) |
Definition at line 83 of file gscip_ext.cc.
| absl::Status operations_research::GScipCreateMinimum | ( | GScip * | gscip, |
| const GScipLinearExpr & | resultant, | ||
| absl::Span< const GScipLinearExpr > | terms, | ||
| absl::string_view | name ) |
Definition at line 139 of file gscip_ext.cc.
| GScipLinearExpr operations_research::GScipDifference | ( | GScipLinearExpr | left, |
| const GScipLinearExpr & | right ) |
Definition at line 44 of file gscip_ext.cc.
| GScipLinearRange operations_research::GScipLe | ( | const GScipLinearExpr | left, |
| const GScipLinearExpr & | right ) |
Definition at line 63 of file gscip_ext.cc.
| int operations_research::GScipLogLevel | ( | const GScipParameters & | parameters | ) |
Definition at line 88 of file gscip_parameters.cc.
| bool operations_research::GScipLogLevelSet | ( | const GScipParameters & | parameters | ) |
Definition at line 93 of file gscip_parameters.cc.
| int operations_research::GScipMaxNumThreads | ( | const GScipParameters & | parameters | ) |
Definition at line 70 of file gscip_parameters.cc.
| bool operations_research::GScipMaxNumThreadsSet | ( | const GScipParameters & | parameters | ) |
Definition at line 77 of file gscip_parameters.cc.
| GScipLinearExpr operations_research::GScipNegate | ( | GScipLinearExpr | expr | ) |
Definition at line 53 of file gscip_ext.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::GScipOutput_Status_descriptor | ( | ) |
Definition at line 489 of file gscip.pb.cc.
|
inline |
Definition at line 230 of file gscip.pb.h.
|
inline |
Definition at line 243 of file gscip.pb.h.
| const ::std::string & operations_research::GScipOutput_Status_Name | ( | T | value | ) |
Definition at line 236 of file gscip.pb.h.
|
inline |
Definition at line 247 of file gscip.pb.h.
| bool operations_research::GScipOutputEnabled | ( | const GScipParameters & | parameters | ) |
Definition at line 104 of file gscip_parameters.cc.
| bool operations_research::GScipOutputEnabledSet | ( | const GScipParameters & | parameters | ) |
Definition at line 109 of file gscip_parameters.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::GScipParameters_Emphasis_descriptor | ( | ) |
Definition at line 477 of file gscip.pb.cc.
|
inline |
Definition at line 141 of file gscip.pb.h.
|
inline |
Definition at line 154 of file gscip.pb.h.
| const ::std::string & operations_research::GScipParameters_Emphasis_Name | ( | T | value | ) |
Definition at line 147 of file gscip.pb.h.
|
inline |
Definition at line 158 of file gscip.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::GScipParameters_MetaParamValue_descriptor | ( | ) |
Definition at line 483 of file gscip.pb.cc.
|
inline |
Definition at line 179 of file gscip.pb.h.
|
inline |
Definition at line 192 of file gscip.pb.h.
| const ::std::string & operations_research::GScipParameters_MetaParamValue_Name | ( | T | value | ) |
Definition at line 185 of file gscip.pb.h.
|
inline |
Definition at line 196 of file gscip.pb.h.
| int operations_research::GScipRandomSeed | ( | const GScipParameters & | parameters | ) |
Definition at line 119 of file gscip_parameters.cc.
| bool operations_research::GScipRandomSeedSet | ( | const GScipParameters & | parameters | ) |
Definition at line 126 of file gscip_parameters.cc.
| void operations_research::GScipSetCatchCtrlC | ( | const bool | catch_ctrl_c, |
| GScipParameters *const | parameters ) |
Definition at line 130 of file gscip_parameters.cc.
| void operations_research::GScipSetLogLevel | ( | GScipParameters * | parameters, |
| int | log_level ) |
Definition at line 81 of file gscip_parameters.cc.
| void operations_research::GScipSetMaxNumThreads | ( | int | num_threads, |
| GScipParameters * | parameters ) |
Definition at line 64 of file gscip_parameters.cc.
| void operations_research::GScipSetOutputEnabled | ( | GScipParameters * | parameters, |
| bool | output_enabled ) |
Definition at line 97 of file gscip_parameters.cc.
| void operations_research::GScipSetRandomSeed | ( | GScipParameters * | parameters, |
| int | random_seed ) |
Definition at line 113 of file gscip_parameters.cc.
| void operations_research::GScipSetTimeLimit | ( | absl::Duration | time_limit, |
| GScipParameters * | parameters ) |
Definition at line 36 of file gscip_parameters.cc.
| testing::Matcher< GScipSolution > operations_research::GScipSolutionAlmostEquals | ( | const GScipSolution & | rhs, |
| double | tolerance ) |
Definition at line 113 of file gscip_testing.cc.
| testing::Matcher< GScipSolution > operations_research::GScipSolutionEquals | ( | const GScipSolution & | rhs | ) |
Definition at line 110 of file gscip_testing.cc.
| absl::Duration operations_research::GScipTimeLimit | ( | const GScipParameters & | parameters | ) |
Definition at line 45 of file gscip_parameters.cc.
| bool operations_research::GScipTimeLimitSet | ( | const GScipParameters & | parameters | ) |
Definition at line 60 of file gscip_parameters.cc.
| std::vector< std::string > operations_research::GurobiDynamicLibraryPotentialPaths | ( | ) |
Definition at line 337 of file gurobi_environment.cc.
| bool operations_research::GurobiIsCorrectlyInstalled | ( | ) |
Definition at line 31 of file gurobi_util.cc.
| std::string operations_research::GurobiParamInfoForLogging | ( | GRBenv * | grb, |
| bool | one_liner_output ) |
Definition at line 58 of file gurobi_util.cc.
| absl::StatusOr< MPSolutionResponse > operations_research::GurobiSolveProto | ( | LazyMutableCopy< MPModelRequest > | request, |
| GRBenv * | gurobi_env ) |
Definition at line 275 of file gurobi_proto_solver.cc.
|
inline |
Definition at line 277 of file constraint_solveri.h.
| uint64_t operations_research::Hash1 | ( | const std::vector< T * > & | ptrs | ) |
Definition at line 267 of file constraint_solveri.h.
|
inline |
Definition at line 255 of file constraint_solveri.h.
|
inline |
Definition at line 251 of file constraint_solveri.h.
|
inline |
Definition at line 240 of file constraint_solveri.h.
|
inline |
Hash functions.
value = (value << 21) - value - 1;
value * 265
value * 21
Definition at line 229 of file constraint_solveri.h.
|
inline |
Definition at line 257 of file constraint_solveri.h.
| absl::StatusOr< MPSolutionResponse > operations_research::HighsSolveProto | ( | LazyMutableCopy< MPModelRequest > | request, |
| HighsSolveInfo * | solve_info ) |
Definition at line 48 of file highs_proto_solver.cc.
| void operations_research::IncrementalSort | ( | int | max_comparisons, |
| Iterator | begin, | ||
| Iterator | end, | ||
| Compare | comp = Compare{}, | ||
| bool | is_stable = false ) |
| void operations_research::IncrementalSort | ( | Iterator | begin, |
| Iterator | end, | ||
| Compare | comp = Compare{}, | ||
| bool | is_stable = false ) |
| operations_research::IndexRange | ( | Index | a, |
| Index | b )->IndexRange< Index > |
| bool operations_research::initXpressEnv | ( | bool | verbose, |
| int | xpress_oem_license_key ) |
init XPRESS environment.
Definition at line 336 of file xpress_environment.cc.
| bool operations_research::InputContainsNan | ( | absl::Span< const std::vector< double > > | input | ) |
Definition at line 643 of file hungarian.cc.
| void operations_research::InsertionSort | ( | Iterator | begin, |
| Iterator | end, | ||
| Compare | comp = Compare{} ) |
|
extern |
Definition at line 443 of file demon_profiler.cc.
|
extern |
Definition at line 3746 of file local_search.cc.
| std::string operations_research::Int64ToStr | ( | int64_t | number | ) |
Definition at line 3392 of file routing_lp_scheduling.cc.
Definition at line 963 of file constraint_solver.cc.
|
inline |
Definition at line 252 of file fp_utils.h.
| void operations_research::interruptXPRESS | ( | XPRSprob & | xprsProb, |
| CUSTOM_INTERRUPT_REASON | reason ) |
Definition at line 203 of file xpress_interface.cc.
|
inline |
|
inline |
| bool operations_research::IntervalsAreSortedAndNonAdjacent | ( | absl::Span< const ClosedInterval > | intervals | ) |
Returns true iff we have:
Definition at line 41 of file sorted_interval_list.cc.
|
inline |
|
inline |
|
inline |
Definition at line 64 of file aligned_memory.h.
| bool operations_research::IsArrayBoolean | ( | const std::vector< T > & | values | ) |
Definition at line 4209 of file constraint_solveri.h.
| bool operations_research::IsArrayConstant | ( | const std::vector< T > & | values, |
| const T & | value ) |
Definition at line 4199 of file constraint_solveri.h.
| bool operations_research::IsArrayInRange | ( | const std::vector< IntVar * > & | vars, |
| T | range_min, | ||
| T | range_max ) |
Definition at line 4289 of file constraint_solveri.h.
|
inline |
|
inline |
| bool operations_research::IsEmptyRange32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
| bool operations_research::IsEmptyRange64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
| bool operations_research::IsEulerianGraph | ( | const Graph & | graph, |
| bool | assume_connectivity = true ) |
Definition at line 46 of file eulerian_path.h.
| bool operations_research::IsIncreasing | ( | const std::vector< T > & | values | ) |
Definition at line 4279 of file constraint_solveri.h.
| bool operations_research::IsIncreasingContiguous | ( | const std::vector< T > & | values | ) |
Definition at line 4269 of file constraint_solveri.h.
|
inline |
Definition at line 173 of file fp_utils.h.
|
inline |
Definition at line 118 of file fp_utils.h.
| bool operations_research::IsSemiEulerianGraph | ( | const Graph & | graph, |
| std::vector< NodeIndex > * | odd_nodes, | ||
| bool | assume_connectivity = true ) |
Definition at line 60 of file eulerian_path.h.
| bool operations_research::IsSmallerWithinTolerance | ( | FloatType | x, |
| FloatType | y, | ||
| FloatType | tolerance ) |
Definition at line 164 of file fp_utils.h.
| operations_research::IterableContainer | ( | const T & | data_source | ) | ->IterableContainer< T > |
| std::string operations_research::JoinDebugString | ( | const std::vector< T > & | v, |
| absl::string_view | separator ) |
Definition at line 40 of file string_array.h.
| std::string operations_research::JoinDebugStringPtr | ( | const std::vector< T > & | v, |
| absl::string_view | separator ) |
Definition at line 47 of file string_array.h.
| std::string operations_research::JoinNameFieldPtr | ( | const std::vector< T > & | v, |
| absl::string_view | separator ) |
Definition at line 60 of file string_array.h.
| std::string operations_research::JoinNamePtr | ( | const std::vector< T > & | v, |
| absl::string_view | separator ) |
Definition at line 54 of file string_array.h.
|
constexpr |
| std::vector< PathWithLength > operations_research::KShortestPathsOnDag | ( | const int | num_nodes, |
| absl::Span< const ArcWithLength > | arcs_with_length, | ||
| const int | source, | ||
| const int | destination, | ||
| const int | path_count ) |
Definition at line 105 of file dag_shortest_path.cc.
| int operations_research::LeastSignificantBitPosition32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
|
inline |
|
inline |
|
inline |
| int64_t operations_research::LeastSignificantBitPosition64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
|
inline |
|
inline |
|
inline |
|
inline |
|
inline |
| absl::Status operations_research::LegacyScipSetSolverSpecificParameters | ( | absl::string_view | parameters, |
| SCIP * | scip ) |
Definition at line 35 of file scip_params.cc.
| bool operations_research::LinearConstraintIsViolated | ( | const ScipConstraintHandlerContext & | context, |
| const LinearRange & | constraint ) |
Definition at line 99 of file scip_callback.cc.
Definition at line 7452 of file expressions.cc.
| absl::Status operations_research::LoadGurobiDynamicLibrary | ( | std::vector< absl::string_view > | potential_paths | ) |
Definition at line 416 of file gurobi_environment.cc.
| void operations_research::LoadGurobiFunctions | ( | DynamicLibrary * | gurobi_dynamic_library | ) |
Definition at line 222 of file gurobi_environment.cc.
| absl::Status operations_research::LoadXpressDynamicLibrary | ( | std::string & | xpresspath | ) |
Definition at line 280 of file xpress_environment.cc.
| void operations_research::LoadXpressFunctions | ( | DynamicLibrary * | xpress_dynamic_library | ) |
Definition at line 134 of file xpress_environment.cc.
| void operations_research::LocalBfs | ( | const ::util::StaticGraph< int, int > & | graph, |
| int | source, | ||
| int | stop_after_num_nodes, | ||
| std::vector< int > * | visited, | ||
| std::vector< int > * | num_within_radius, | ||
| std::vector< bool > * | tmp_mask ) |
Definition at line 78 of file find_graph_symmetries.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_descriptor | ( | ) |
Definition at line 226 of file routing_heuristic_parameters.pb.cc.
|
inline |
Definition at line 145 of file routing_heuristic_parameters.pb.h.
|
inline |
Definition at line 158 of file routing_heuristic_parameters.pb.h.
| const ::std::string & operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_Name | ( | T | value | ) |
Definition at line 151 of file routing_heuristic_parameters.pb.h.
|
inline |
Definition at line 162 of file routing_heuristic_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_descriptor | ( | ) |
Definition at line 220 of file routing_heuristic_parameters.pb.cc.
|
inline |
Definition at line 102 of file routing_heuristic_parameters.pb.h.
|
inline |
Definition at line 115 of file routing_heuristic_parameters.pb.h.
| const ::std::string & operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_Name | ( | T | value | ) |
Definition at line 108 of file routing_heuristic_parameters.pb.h.
|
inline |
Definition at line 119 of file routing_heuristic_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::LocalSearchMetaheuristic_Value_descriptor | ( | ) |
Definition at line 159 of file routing_enums.pb.cc.
|
inline |
Definition at line 163 of file routing_enums.pb.h.
|
inline |
Definition at line 176 of file routing_enums.pb.h.
| const ::std::string & operations_research::LocalSearchMetaheuristic_Value_Name | ( | T | value | ) |
Definition at line 169 of file routing_enums.pb.h.
|
inline |
Definition at line 180 of file routing_enums.pb.h.
| void operations_research::log_full_license_error | ( | int | code, |
| const std::string & | xpress_lib_dir ) |
Definition at line 416 of file xpress_environment.cc.
| void operations_research::log_message_about_XPRSinit_argument | ( | ) |
Definition at line 427 of file xpress_environment.cc.
| void operations_research::LogCostAndTiming | ( | const absl::string_view | problem_name, |
| absl::string_view | alg_name, | ||
| const SetCoverInvariant & | inv, | ||
| int64_t | run_time ) |
Definition at line 141 of file set_cover_solve.cc.
| void operations_research::LogCostAndTiming | ( | const SetCoverSolutionGenerator & | generator | ) |
Definition at line 149 of file set_cover_solve.cc.
| void operations_research::LogStats | ( | const SetCoverModel & | model | ) |
Definition at line 117 of file set_cover_solve.cc.
| void operations_research::Main | ( | ) |
Definition at line 38 of file course_scheduling_run.cc.
| LocalSearchOperator * operations_research::MakeActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors = nullptr, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors = nullptr ) |
--— MakeActive --—
MakeActive inserts an inactive node into a path. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> 5 -> 2 -> 3 -> 4 1 -> 2 -> 5 -> 3 -> 4 1 -> 2 -> 3 -> 5 -> 4
Definition at line 818 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeActiveAndRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— MakeActiveAndRelocate --—
MakeActiveAndRelocate makes a node active next to a node being relocated. Possible neighbor for paths 0 -> 4, 1 -> 2 -> 5 and 3 inactive is: 0 -> 3 -> 2 -> 4, 1 -> 5.
Definition at line 990 of file local_search.cc.
| IntVarLocalSearchFilter * operations_research::MakeActiveNodeGroupFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter ensuring that all nodes in a same activity group have the same activity.
Definition at line 542 of file routing_filters.cc.
| DecisionBuilder * operations_research::MakeAllUnperformed | ( | RoutingModel * | model | ) |
Definition at line 5512 of file routing_search.cc.
| RangeIntToIntFunction * operations_research::MakeBareIntToIntFunction | ( | std::function< int64_t(int64_t)> | f | ) |
Definition at line 225 of file range_query_function.cc.
| std::unique_ptr< BinCapacities > operations_research::MakeBinCapacities | ( | const std::vector< RoutingDimension * > & | dimensions, |
| const PathsMetadata & | paths_metadata ) |
Definition at line 5564 of file routing.cc.
| RangeIntToIntFunction * operations_research::MakeCachedIntToIntFunction | ( | const std::function< int64_t(int64_t)> & | f, |
| int64_t | domain_start, | ||
| int64_t | domain_end ) |
Definition at line 230 of file range_query_function.cc.
| RangeMinMaxIndexFunction * operations_research::MakeCachedRangeMinMaxIndexFunction | ( | const std::function< int64_t(int64_t)> & | f, |
| int64_t | domain_start, | ||
| int64_t | domain_end ) |
Definition at line 236 of file range_query_function.cc.
| LocalSearchOperator * operations_research::MakeChainInactive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— MakeChainInactive --—
Operator which makes a "chain" of path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 with 2 inactive 1 -> 2 -> 4 with 3 inactive 1 -> 4 with 2 and 3 inactive
Definition at line 1122 of file local_search.cc.
| Demon * operations_research::MakeConstraintDemon0 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(), | ||
| const std::string & | name ) |
Definition at line 533 of file constraint_solveri.h.
| Demon * operations_research::MakeConstraintDemon1 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(P), | ||
| const std::string & | name, | ||
| P | param1 ) |
Definition at line 574 of file constraint_solveri.h.
| Demon * operations_research::MakeConstraintDemon2 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(P, Q), | ||
| const std::string & | name, | ||
| P | param1, | ||
| Q | param2 ) |
Definition at line 612 of file constraint_solveri.h.
| Demon * operations_research::MakeConstraintDemon3 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(P, Q, R), | ||
| const std::string & | name, | ||
| P | param1, | ||
| Q | param2, | ||
| R | param3 ) |
Definition at line 655 of file constraint_solveri.h.
| IntVarLocalSearchFilter * operations_research::MakeCPFeasibilityFilter | ( | RoutingModel * | routing_model | ) |
Returns a filter checking the current solution using CP propagation.
Definition at line 3917 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakeCross | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors = nullptr, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors = nullptr ) |
--— Cross --—
Cross echanges the starting chains of 2 paths, including exchanging the whole paths. First and last nodes are not moved. Possible neighbors for the paths 1 -> 2 -> 3 -> 4 -> 5 and 6 -> 7 -> 8 (where (1, 5) and (6, 8) are first and last nodes of the paths and can therefore not be moved): 1 -> 7 -> 3 -> 4 -> 5 6 -> 2 -> 8 1 -> 7 -> 4 -> 5 6 -> 2 -> 3 -> 8 1 -> 7 -> 5 6 -> 2 -> 3 -> 4 -> 8
Definition at line 717 of file local_search.cc.
| IntVarLocalSearchFilter * operations_research::MakeCumulBoundsPropagatorFilter | ( | const RoutingDimension & | dimension | ) |
Returns a filter handling dimension cumul bounds.
Definition at line 3226 of file routing_filters.cc.
| Demon * operations_research::MakeDelayedConstraintDemon0 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(), | ||
| const std::string & | name ) |
Definition at line 695 of file constraint_solveri.h.
| Demon * operations_research::MakeDelayedConstraintDemon1 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(P), | ||
| const std::string & | name, | ||
| P | param1 ) |
Definition at line 731 of file constraint_solveri.h.
| Demon * operations_research::MakeDelayedConstraintDemon2 | ( | Solver *const | s, |
| T *const | ct, | ||
| void(T::* | method )(P, Q), | ||
| const std::string & | name, | ||
| P | param1, | ||
| Q | param2 ) |
Definition at line 775 of file constraint_solveri.h.
| Constraint * operations_research::MakeDifferentFromValues | ( | Solver * | solver, |
| IntVar * | var, | ||
| std::vector< int64_t > | values ) |
Definition at line 66 of file routing_constraints.cc.
| LocalSearchFilter * operations_research::MakeDimensionFilter | ( | Solver * | solver, |
| std::unique_ptr< DimensionChecker > | checker, | ||
| absl::string_view | dimension_name ) |
Definition at line 4655 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakeExchange | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors = nullptr, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors = nullptr ) |
--— Exchange --—
Exchanges the positions of two nodes. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> 2 -> 4 -> 5 1 -> 4 -> 3 -> 2 -> 5 1 -> 2 -> 4 -> 3 -> 5
Definition at line 601 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeExchangeSubtrip | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| absl::Span< const PickupDeliveryPair > | pairs ) |
Definition at line 1841 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeExchangeSubtrip | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| absl::Span< const PickupDeliveryPair > | pairs ) |
Definition at line 1822 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeExtendedSwapActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— ExtendedSwapActive --—
ExtendedSwapActive makes an inactive node active and an active one inactive. It is similar to SwapActiveOperator excepts that it tries to insert the inactive node in all possible positions instead of just the position of the node made inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> 5 -> 3 -> 4 & 2 inactive 1 -> 3 -> 5 -> 4 & 2 inactive 1 -> 5 -> 2 -> 4 & 3 inactive 1 -> 2 -> 5 -> 4 & 3 inactive
Definition at line 1296 of file local_search.cc.
| IntVarLocalSearchFilter * operations_research::MakeGlobalLPCumulFilter | ( | GlobalDimensionCumulOptimizer * | lp_optimizer, |
| GlobalDimensionCumulOptimizer * | mp_optimizer, | ||
| bool | filter_objective_cost ) |
Returns a filter checking global linear constraints and costs.
Definition at line 3383 of file routing_filters.cc.
| Constraint * operations_research::MakeGlobalVehicleBreaksConstraint | ( | Solver * | solver, |
| const RoutingDimension * | dimension ) |
Definition at line 1031 of file routing_constraints.cc.
| LocalSearchOperator * operations_research::MakeGroupPairAndRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 679 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeGroupPairAndRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 659 of file routing_neighborhoods.cc.
| HamiltonianPathSolver< CostType, CostFunction > operations_research::MakeHamiltonianPathSolver | ( | int | num_nodes, |
| CostFunction | cost ) |
Definition at line 604 of file hamiltonian_path.h.
| LocalSearchOperator * operations_research::MakeInactive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— MakeInactive --—
MakeInactive makes path nodes inactive. Possible neighbors for the path 1 -> 2 -> 3 -> 4 (where 1 and 4 are first and last nodes of the path) are: 1 -> 3 -> 4 & 2 inactive 1 -> 2 -> 4 & 3 inactive
Definition at line 1022 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeIndexPairSwapActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 1285 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeLightPairRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs, | ||
| std::function< bool(int64_t)> | force_lifo ) |
Definition at line 807 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeLightPairRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| const std::vector< PickupDeliveryPair > & | pairs, | ||
| std::function< bool(int64_t)> | force_lifo ) |
Definition at line 787 of file routing_neighborhoods.cc.
| LocalSearchFilter * operations_research::MakeLightVehicleBreaksFilter | ( | Solver * | solver, |
| std::unique_ptr< LightVehicleBreaksChecker > | checker, | ||
| absl::string_view | dimension_name ) |
Definition at line 4784 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakeLinKernighan | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| const Solver::IndexEvaluator3 & | evaluator, | ||
| bool | topt ) |
--— Lin-Kernighan --—
Definition at line 1791 of file local_search.cc.
| IntVarLocalSearchFilter * operations_research::MakeMaxActiveVehiclesFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter ensuring that max active vehicles constraints are enforced.
Definition at line 224 of file routing_filters.cc.
| std::unique_ptr< NeighborAcceptanceCriterion > operations_research::MakeNeighborAcceptanceCriterion | ( | const RoutingModel & | model, |
| const AcceptanceStrategy & | acceptance_strategy, | ||
| const NeighborAcceptanceCriterion::SearchState & | final_search_state, | ||
| std::mt19937 * | rnd ) |
Definition at line 1253 of file routing_ils.cc.
| IntVarLocalSearchFilter * operations_research::MakeNodeDisjunctionFilter | ( | const RoutingModel & | routing_model, |
| bool | filter_cost ) |
Returns a filter ensuring that node disjunction constraints are enforced.
Definition at line 705 of file routing_filters.cc.
| Constraint * operations_research::MakeNumActiveVehiclesCapacityConstraint | ( | Solver * | solver, |
| std::vector< IntVar * > | transit_vars, | ||
| std::vector< IntVar * > | active_vars, | ||
| std::vector< IntVar * > | vehicle_active_vars, | ||
| std::vector< int64_t > | vehicle_capacities, | ||
| int | max_active_vehicles, | ||
| bool | enforce_active_vehicles = false ) |
Makes inactive the vehicles which cannot cover the demand resulting from the transit variables of the active nodes given the maximum number of vehicles which can be active.
Definition at line 1138 of file routing_constraints.cc.
| IntVarLocalSearchFilter * operations_research::MakeOrderedActivityGroupFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter ensuring that for each ordered activity group, if nodes[i] is active then nodes[i-1] is active.
Definition at line 548 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakePairActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 474 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakePairExchange | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 939 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakePairExchange | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 920 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakePairExchangeRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 1099 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakePairInactive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 511 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakePairNodeSwapActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 791 of file routing_neighborhoods.h.
| LocalSearchOperator * operations_research::MakePairRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| const std::vector< PickupDeliveryPair > & | pairs ) |
Definition at line 607 of file routing_neighborhoods.cc.
| IntVarLocalSearchFilter * operations_research::MakePathCumulFilter | ( | const RoutingDimension & | dimension, |
| bool | propagate_own_objective_value, | ||
| bool | filter_objective_cost, | ||
| bool | may_use_optimizers ) |
Returns a filter handling dimension costs and constraints.
Definition at line 2646 of file routing_filters.cc.
| LocalSearchFilter * operations_research::MakePathEnergyCostFilter | ( | Solver * | solver, |
| std::unique_ptr< PathEnergyCostChecker > | checker, | ||
| absl::string_view | dimension_name ) |
Definition at line 5237 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakePathLns | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| int | number_of_chunks, | ||
| int | chunk_size, | ||
| bool | unactive_fragments ) |
--— Path-based Large Neighborhood Search --—
Breaks "number_of_chunks" chains of "chunk_size" arcs, and deactivate all inactive nodes if "unactive_fragments" is true. As a special case, if chunk_size=0, then we break full paths.
Definition at line 1877 of file local_search.cc.
| Constraint * operations_research::MakePathSpansAndTotalSlacks | ( | const RoutingDimension * | dimension, |
| std::vector< IntVar * > | spans, | ||
| std::vector< IntVar * > | total_slacks ) |
For every vehicle of the routing model:
Definition at line 638 of file routing_constraints.cc.
| LocalSearchFilter * operations_research::MakePathStateFilter | ( | Solver * | solver, |
| std::unique_ptr< PathState > | path_state, | ||
| const std::vector< IntVar * > & | nexts ) |
Definition at line 4342 of file routing_filters.cc.
| DecisionBuilder * operations_research::MakePerturbationDecisionBuilder | ( | const RoutingSearchParameters & | parameters, |
| RoutingModel * | model, | ||
| std::mt19937 * | rnd, | ||
| const Assignment * | assignment, | ||
| std::function< bool()> | stop_search, | ||
| LocalSearchFilterManager * | filter_manager ) |
Definition at line 1236 of file routing_ils.cc.
| LocalSearchFilter * operations_research::MakePickupDeliveryFilter | ( | const RoutingModel & | routing_model, |
| const PathState * | path_state, | ||
| absl::Span< const PickupDeliveryPair > | pairs, | ||
| const std::vector< RoutingModel::PickupAndDeliveryPolicy > & | vehicle_policies ) |
Returns a filter enforcing pickup and delivery constraints for the given pair of nodes and given policies.
Definition at line 3095 of file routing_filters.cc.
| LocalSearchOperator * operations_research::MakeRelocate | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors = nullptr, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors = nullptr, | ||
| int64_t | chain_length = 1LL, | ||
| bool | single_path = false, | ||
| const std::string & | name = "Relocate" ) |
--— Relocate --—
Moves a sub-chain of a path to another position; the specified chain length is the fixed length of the chains being moved. When this length is 1 the operator simply moves a node to another position. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5, for a chain length of 2 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 4 -> 2 -> 3 -> 5 1 -> 3 -> 4 -> 2 -> 5 Using Relocate with chain lengths of 1, 2 and 3 together is equivalent to the OrOpt operator on a path. The OrOpt operator is a limited version of 3Opt (breaks 3 arcs on a path).
Definition at line 538 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeRelocateExpensiveChain | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| int | num_arcs_to_consider, | ||
| std::function< int64_t(int64_t, int64_t, int64_t)> | arc_cost_for_path_start ) |
Definition at line 1417 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeRelocateNeighbors | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| RoutingTransitCallback2 | arc_evaluator ) |
Definition at line 158 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeRelocateNeighbors | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| RoutingTransitCallback2 | arc_evaluator ) |
Definition at line 139 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeRelocateSubtrip | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| absl::Span< const PickupDeliveryPair > | pairs ) |
Definition at line 1611 of file routing_neighborhoods.cc.
| LocalSearchOperator * operations_research::MakeRelocateSubtrip | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors, | ||
| absl::Span< const PickupDeliveryPair > | pairs ) |
Definition at line 1592 of file routing_neighborhoods.cc.
| LocalSearchFilter * operations_research::MakeResourceAssignmentFilter | ( | LocalDimensionCumulOptimizer * | optimizer, |
| LocalDimensionCumulOptimizer * | mp_optimizer, | ||
| bool | propagate_own_objective_value, | ||
| bool | filter_objective_cost ) |
Returns a filter checking the feasibility and cost of the resource assignment.
Definition at line 3810 of file routing_filters.cc.
| Constraint * operations_research::MakeResourceConstraint | ( | const RoutingModel::ResourceGroup * | resource_group, |
| const std::vector< IntVar * > * | vehicle_resource_vars, | ||
| RoutingModel * | model ) |
Definition at line 275 of file routing_constraints.cc.
| DecisionBuilder * operations_research::MakeRestoreDimensionValuesForUnchangedRoutes | ( | RoutingModel * | model | ) |
A decision builder that monitors solutions, and tries to fix dimension variables whose route did not change in the candidate solution. Dimension variables are Cumul, Slack and break variables of all dimensions. The user must make sure that those variables will be always be fixed at solution, typically by composing another DecisionBuilder after this one. If this DecisionBuilder returns a non-nullptr value at some node of the search tree, it will always return nullptr in the subtree of that node. Moreover, the decision will be a simultaneous assignment of the dimension variables of unchanged routes on the left branch, and an empty decision on the right branch.
Definition at line 889 of file routing_decision_builders.cc.
| Constraint * operations_research::MakeRouteConstraint | ( | RoutingModel * | model, |
| std::vector< IntVar * > | route_cost_vars, | ||
| std::function< std::optional< int64_t >(const std::vector< int64_t > &)> | route_evaluator ) |
Definition at line 796 of file routing_constraints.cc.
| IntVarLocalSearchFilter * operations_research::MakeRouteConstraintFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter tracking route constraints.
Definition at line 158 of file routing_filters.cc.
| DecisionBuilder * operations_research::MakeRuinAndRecreateDecisionBuilder | ( | const RoutingSearchParameters & | parameters, |
| RoutingModel * | model, | ||
| std::mt19937 * | rnd, | ||
| const Assignment * | assignment, | ||
| std::function< bool()> | stop_search, | ||
| LocalSearchFilterManager * | filter_manager ) |
Definition at line 1220 of file routing_ils.cc.
| IntVarLocalSearchFilter * operations_research::MakeSameVehicleCostFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter computing same vehicle costs.
Definition at line 1198 of file routing_filters.cc.
| DecisionBuilder * operations_research::MakeSetCumulsFromGlobalDimensionCosts | ( | Solver * | solver, |
| GlobalDimensionCumulOptimizer * | global_optimizer, | ||
| GlobalDimensionCumulOptimizer * | global_mp_optimizer, | ||
| bool | optimize_and_pack, | ||
| std::vector< RoutingModel::RouteDimensionTravelInfo > | dimension_travel_info_per_route ) |
Variant based on global optimizers, handling all routes together.
Definition at line 719 of file routing_decision_builders.cc.
| DecisionBuilder * operations_research::MakeSetCumulsFromLocalDimensionCosts | ( | Solver * | solver, |
| LocalDimensionCumulOptimizer * | lp_optimizer, | ||
| LocalDimensionCumulOptimizer * | mp_optimizer, | ||
| bool | optimize_and_pack = false, | ||
| std::vector< RoutingModel::RouteDimensionTravelInfo > | dimension_travel_info_per_route = {} ) |
Functions returning decision builders which try to instantiate dimension cumul variables using scheduling optimizers. Variant based on local optimizers, for which each route is handled separately.
Definition at line 544 of file routing_decision_builders.cc.
| DecisionBuilder * operations_research::MakeSetValuesFromTargets | ( | Solver * | solver, |
| std::vector< IntVar * > | variables, | ||
| std::vector< int64_t > | targets ) |
A decision builder which tries to assign values to variables as close as possible to target values first.
Definition at line 103 of file routing_decision_builders.cc.
| LocalSearchOperator * operations_research::MakeSwapActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— SwapActive --—
SwapActive replaces an active node by an inactive one. Possible neighbors for the path 1 -> 2 -> 3 -> 4 with 5 inactive (where 1 and 4 are first and last nodes of the path) are: 1 -> 5 -> 3 -> 4 & 2 inactive 1 -> 2 -> 5 -> 4 & 3 inactive
Definition at line 1155 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeSwapActiveChain | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| int | max_chain_size ) |
--— SwapActiveChain --—
Definition at line 1256 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeSwapActiveToShortestPath | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::vector< std::vector< int64_t > > | alternative_sets, | ||
| RoutingTransitCallback2 | arc_evaluator ) |
Definition at line 367 of file routing_neighborhoods.cc.
| DecisionBuilder * operations_research::MakeSweepDecisionBuilder | ( | RoutingModel * | model, |
| bool | check_assignment ) |
Definition at line 5478 of file routing_search.cc.
| LocalSearchOperator * operations_research::MakeTSPLns | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| Solver::IndexEvaluator3 | evaluator, | ||
| int | tsp_size ) |
TSP-base lns. Randomly merge consecutive nodes until n "meta"-nodes remain and solve the corresponding TSP. This can be seen as a large neighborhood search operator although decisions are taken with the operator. This is an "unlimited" neighborhood which must be stopped by search limits. To force diversification, the operator iteratively forces each node to serve as base of a meta-node.
Definition at line 1529 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeTSPOpt | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| Solver::IndexEvaluator3 | evaluator, | ||
| int | chain_length ) |
--— TSP-based operators --—
Sliding TSP operator Uses an exact dynamic programming algorithm to solve the TSP corresponding to path sub-chains. For a subchain 1 -> 2 -> 3 -> 4 -> 5 -> 6, solves the TSP on nodes A, 2, 3, 4, 5, where A is a merger of nodes 1 and 6 such that cost(A,i) = cost(1,i) and cost(i,A) = cost(i,6).
Definition at line 1375 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeTwoOpt | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::function< const std::vector< int > &(int, int)> | get_incoming_neighbors = nullptr, | ||
| std::function< const std::vector< int > &(int, int)> | get_outgoing_neighbors = nullptr ) |
--— 2Opt --—
Reverses a sub-chain of a path. It is called 2Opt because it breaks 2 arcs on the path; resulting paths are called 2-optimal. Possible neighbors for the path 1 -> 2 -> 3 -> 4 -> 5 (where (1, 5) are first and last nodes of the path and can therefore not be moved): 1 -> 3 -> 2 -> 4 -> 5 1 -> 4 -> 3 -> 2 -> 5 1 -> 2 -> 4 -> 3 -> 5
Definition at line 445 of file local_search.cc.
| LocalSearchOperator * operations_research::MakeTwoOptWithShortestPath | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class, | ||
| std::vector< std::vector< int64_t > > | alternative_sets, | ||
| RoutingTransitCallback2 | arc_evaluator ) |
Definition at line 316 of file routing_neighborhoods.cc.
| IntVarLocalSearchFilter * operations_research::MakeTypeRegulationsFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter ensuring type regulation constraints are enforced.
Definition at line 1350 of file routing_filters.cc.
| IntVarLocalSearchFilter * operations_research::MakeVehicleAmortizedCostFilter | ( | const RoutingModel & | routing_model | ) |
Returns a filter computing vehicle amortized costs.
Definition at line 1068 of file routing_filters.cc.
| LocalSearchFilter * operations_research::MakeVehicleVarFilter | ( | const RoutingModel & | routing_model, |
| const PathState * | path_state ) |
Returns a filter checking that vehicle variable domains are respected.
Definition at line 3165 of file routing_filters.cc.
| void operations_research::MaximizeLinearAssignment | ( | absl::Span< const std::vector< double > > | cost, |
| absl::flat_hash_map< int, int > * | direct_assignment, | ||
| absl::flat_hash_map< int, int > * | reverse_assignment ) |
Definition at line 673 of file hungarian.cc.
|
inline |
The std::max<int64_t> is needed for compilation on MSVC.
Definition at line 4335 of file constraint_solveri.h.
| GScipCallbackResult operations_research::MergeConstraintHandlerResults | ( | const GScipCallbackResult | result1, |
| const GScipCallbackResult | result2, | ||
| const ConstraintHandlerCallbackType | callback_type ) |
Definition at line 296 of file gscip_constraint_handler.cc.
| void operations_research::MergeMPConstraintProtoExceptTerms | ( | const MPConstraintProto & | from, |
| MPConstraintProto * | to ) |
Definition at line 938 of file model_validator.cc.
| void operations_research::MinimizeLinearAssignment | ( | absl::Span< const std::vector< double > > | cost, |
| absl::flat_hash_map< int, int > * | direct_assignment, | ||
| absl::flat_hash_map< int, int > * | reverse_assignment ) |
Definition at line 655 of file hungarian.cc.
|
inline |
The std::min<int64_t> is needed for compilation on MSVC.
Definition at line 4345 of file constraint_solveri.h.
|
inlinestatic |
| absl::StatusOr< MPModelProto > operations_research::ModelProtoFromLpFormat | ( | absl::string_view | model | ) |
Definition at line 472 of file lp_parser.cc.
| int operations_research::MostSignificantBitPosition32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
|
inline |
|
inline |
| int64_t operations_research::MostSignificantBitPosition64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
|
inline |
|
inline |
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::MPModelProto_Annotation_TargetType_descriptor | ( | ) |
Definition at line 1151 of file linear_solver.pb.cc.
|
inline |
Definition at line 225 of file linear_solver.pb.h.
|
inline |
Definition at line 238 of file linear_solver.pb.h.
| const ::std::string & operations_research::MPModelProto_Annotation_TargetType_Name | ( | T | value | ) |
Definition at line 231 of file linear_solver.pb.h.
|
inline |
Definition at line 242 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::MPModelRequest_SolverType_descriptor | ( | ) |
Definition at line 1163 of file linear_solver.pb.cc.
|
inline |
Definition at line 307 of file linear_solver.pb.h.
| const ::std::string & operations_research::MPModelRequest_SolverType_Name | ( | T | value | ) |
Definition at line 313 of file linear_solver.pb.h.
|
inline |
Definition at line 319 of file linear_solver.pb.h.
| std::string operations_research::MPModelRequestLoggingInfo | ( | const MPModelRequest & | request | ) |
Definition at line 50 of file solve_mp_model.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::MPSolverCommonParameters_LPAlgorithmValues_descriptor | ( | ) |
Definition at line 1157 of file linear_solver.pb.cc.
|
inline |
Definition at line 259 of file linear_solver.pb.h.
|
inline |
Definition at line 272 of file linear_solver.pb.h.
| const ::std::string & operations_research::MPSolverCommonParameters_LPAlgorithmValues_Name | ( | T | value | ) |
Definition at line 265 of file linear_solver.pb.h.
|
inline |
Definition at line 276 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::MPSolverResponseStatus_descriptor | ( | ) |
Definition at line 1169 of file linear_solver.pb.cc.
|
inline |
Definition at line 346 of file linear_solver.pb.h.
| const ::std::string & operations_research::MPSolverResponseStatus_Name | ( | T | value | ) |
Definition at line 352 of file linear_solver.pb.h.
|
inline |
Definition at line 358 of file linear_solver.pb.h.
| bool operations_research::MPSolverResponseStatusIsRpcError | ( | MPSolverResponseStatus | status | ) |
Definition at line 1787 of file linear_solver.cc.
| glop::ConstraintStatus operations_research::MPSolverToGlopConstraintStatus | ( | MPSolver::BasisStatus | s | ) |
Definition at line 112 of file glop_utils.cc.
| glop::VariableStatus operations_research::MPSolverToGlopVariableStatus | ( | MPSolver::BasisStatus | s | ) |
Definition at line 78 of file glop_utils.cc.
|
static |
Definition at line 1264 of file xpress_interface.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::MPSosConstraint_Type_descriptor | ( | ) |
Definition at line 1145 of file linear_solver.pb.cc.
|
inline |
Definition at line 192 of file linear_solver.pb.h.
|
inline |
Definition at line 205 of file linear_solver.pb.h.
| const ::std::string & operations_research::MPSosConstraint_Type_Name | ( | T | value | ) |
Definition at line 198 of file linear_solver.pb.h.
|
inline |
Definition at line 209 of file linear_solver.pb.h.
| std::vector< absl::flat_hash_map< int, DistanceAndParentArc< DistanceType > > > operations_research::MultiDijkstra | ( | const Graph & | graph, |
| ArcLengthFunctor | arc_length_functor, | ||
| const std::vector< std::vector< int > > & | source_sets, | ||
| SettledNodeCallbackType | settled_node_callback ) |
Definition at line 126 of file multi_dijkstra.h.
| absl::StatusOr< int64_t > operations_research::NChooseK | ( | int64_t | n, |
| int64_t | k ) |
Definition at line 142 of file n_choose_k.cc.
| std::vector< typename GraphType::NodeIndex > operations_research::NodePathImpliedBy | ( | absl::Span< const typename GraphType::ArcIndex > | arc_path, |
| const GraphType & | graph ) |
Definition at line 268 of file dag_shortest_path.h.
| int operations_research::NumBitsForZeroTo | ( | T | max_value | ) |
Definition at line 253 of file radix_sort.h.
|
inline |
This method returns 1.
Definition at line 3439 of file constraint_solver.h.
|
inline |
|
inline |
| LinearExpr operations_research::operator* | ( | double | lhs, |
| LinearExpr | rhs ) |
Definition at line 168 of file linear_expr.cc.
| LinearExpr operations_research::operator* | ( | LinearExpr | lhs, |
| double | rhs ) |
Definition at line 160 of file linear_expr.cc.
| LinearExpr operations_research::operator+ | ( | LinearExpr | lhs, |
| const LinearExpr & | rhs ) |
Definition at line 152 of file linear_expr.cc.
| LinearExpr operations_research::operator- | ( | LinearExpr | lhs, |
| const LinearExpr & | rhs ) |
Definition at line 156 of file linear_expr.cc.
| LinearExpr operations_research::operator/ | ( | LinearExpr | lhs, |
| double | rhs ) |
Definition at line 164 of file linear_expr.cc.
|
inline |
Definition at line 1001 of file linear_solver.h.
|
inline |
Definition at line 1007 of file linear_solver.h.
| std::ostream & operations_research::operator<< | ( | std::ostream & | os, |
| StrongIndex< StrongIndexName > | arg ) |
Definition at line 251 of file strong_integers.h.
| std::ostream & operations_research::operator<< | ( | std::ostream & | os, |
| StrongInt64< StrongIntegerName > | arg ) |
Definition at line 262 of file strong_integers.h.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const Assignment & | assignment ) |
Definition at line 1021 of file assignment.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const BaseObject *const | o ) |
Definition at line 2488 of file constraint_solver.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const ClosedInterval & | interval ) |
Definition at line 120 of file sorted_interval_list.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const Domain & | domain ) |
Definition at line 129 of file sorted_interval_list.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const RoundTripDoubleFormat & | format ) |
Definition at line 110 of file fp_roundtrip_conv.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const Solver *const | s ) |
Definition at line 2483 of file constraint_solver.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| const std::vector< ClosedInterval > & | intervals ) |
Definition at line 124 of file sorted_interval_list.cc.
| std::ostream & operations_research::operator<< | ( | std::ostream & | out, |
| DistanceAndParentArc< DistanceType > | distance_and_parent_arc ) |
Definition at line 116 of file multi_dijkstra.h.
| std::ostream & operations_research::operator<< | ( | std::ostream & | stream, |
| const LinearExpr & | linear_expr ) |
Definition at line 147 of file linear_expr.cc.
| LinearRange operations_research::operator<= | ( | const LinearExpr & | lhs, |
| const LinearExpr & | rhs ) |
Definition at line 183 of file linear_expr.cc.
| LinearRange operations_research::operator== | ( | const LinearExpr & | lhs, |
| const LinearExpr & | rhs ) |
Definition at line 186 of file linear_expr.cc.
| LinearRange operations_research::operator>= | ( | const LinearExpr & | lhs, |
| const LinearExpr & | rhs ) |
Definition at line 189 of file linear_expr.cc.
| void XPRS_CC operations_research::optimizermsg | ( | XPRSprob | prob, |
| void * | data, | ||
| const char * | sMsg, | ||
| int | nLen, | ||
| int | nMsgLvl ) |
Definition at line 2174 of file xpress_interface.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::OptionalBoolean_descriptor | ( | ) |
Definition at line 63 of file optional_boolean.pb.cc.
|
inline |
Definition at line 81 of file optional_boolean.pb.h.
|
inline |
Definition at line 94 of file optional_boolean.pb.h.
| const ::std::string & operations_research::OptionalBoolean_Name | ( | T | value | ) |
Definition at line 87 of file optional_boolean.pb.h.
|
inline |
Definition at line 98 of file optional_boolean.pb.h.
| int operations_research::OrToolsMajorVersion | ( | ) |
Definition at line 22 of file version.cc.
| int operations_research::OrToolsMinorVersion | ( | ) |
Definition at line 24 of file version.cc.
| int operations_research::OrToolsPatchVersion | ( | ) |
Definition at line 26 of file version.cc.
| std::string operations_research::OrToolsVersionString | ( | ) |
Definition at line 28 of file version.cc.
| std::string operations_research::ParameterDebugString | ( | P * | param | ) |
Support limited to pointers to classes which define DebugString().
Definition at line 545 of file constraint_solveri.h.
| std::string operations_research::ParameterDebugString | ( | P | param | ) |
Definition at line 539 of file constraint_solveri.h.
| void operations_research::ParseAndSolve | ( | const std::string & | filename, |
| absl::string_view | solver, | ||
| const std::string & | params ) |
Definition at line 43 of file vector_bin_packing_main.cc.
| FileFormat operations_research::ParseFileFormat | ( | const std::string & | format_name | ) |
Definition at line 168 of file set_cover_solve.cc.
| absl::StatusOr< glop::DenseRow > operations_research::ParseSolFile | ( | absl::string_view | file_name, |
| const glop::LinearProgram & | model ) |
Definition at line 35 of file sol_reader.cc.
| absl::StatusOr< MPSolutionResponse > operations_research::ParseSolFile | ( | absl::string_view | file_name, |
| const MPModelProto & | model ) |
Definition at line 41 of file sol_reader.cc.
| absl::StatusOr< glop::DenseRow > operations_research::ParseSolString | ( | const std::string & | solution, |
| const glop::LinearProgram & | model ) |
Definition at line 47 of file sol_reader.cc.
| absl::StatusOr< MPSolutionResponse > operations_research::ParseSolString | ( | const std::string & | solution, |
| const MPModelProto & | model ) |
Definition at line 104 of file sol_reader.cc.
| bool operations_research::ParseTextProtoForFlag | ( | const absl::string_view | text, |
| google::protobuf::Message *const | message_out, | ||
| std::string *const | error_out ) |
Definition at line 82 of file parse_proto.cc.
| absl::StatusOr< MPSolutionResponse > operations_research::PdlpSolveProto | ( | LazyMutableCopy< MPModelRequest > | request, |
| const bool | relax_integer_variables, | ||
| const std::atomic< bool > * | interrupt_solve ) |
Definition at line 36 of file pdlp_proto_solver.cc.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::PerturbationStrategy_Value_descriptor | ( | ) |
Definition at line 695 of file routing_ils.pb.cc.
|
inline |
Definition at line 202 of file routing_ils.pb.h.
|
inline |
Definition at line 215 of file routing_ils.pb.h.
| const ::std::string & operations_research::PerturbationStrategy_Value_Name | ( | T | value | ) |
Definition at line 208 of file routing_ils.pb.h.
|
inline |
Definition at line 219 of file routing_ils.pb.h.
| std::vector< SlopeAndYIntercept > operations_research::PiecewiseLinearFunctionToSlopeAndYIntercept | ( | const FloatSlopePiecewiseLinearFunction & | pwl_function, |
| int | index_start, | ||
| int | index_end ) |
Definition at line 1496 of file routing_lp_scheduling.cc.
| absl::Status operations_research::PortableDeleteFile | ( | absl::string_view | file_name | ) |
| absl::Status operations_research::PortableFileGetContents | ( | absl::string_view | file_name, |
| std::string * | output ) |
| absl::Status operations_research::PortableFileSetContents | ( | absl::string_view | file_name, |
| absl::string_view | content ) |
|
inline |
Definition at line 4369 of file constraint_solveri.h.
|
inline |
Definition at line 4364 of file constraint_solveri.h.
| void operations_research::printError | ( | const XPRSprob & | mLp, |
| int | line ) |
Definition at line 139 of file xpress_interface.cc.
| void operations_research::printXpressBanner | ( | bool | error | ) |
Definition at line 228 of file xpress_environment.cc.
|
inline |
Definition at line 22 of file testing_utils.h.
| bool operations_research::PropagateLightweightVehicleBreaks | ( | int | path, |
| DimensionValues & | dimension_values, | ||
| absl::Span< const std::pair< int64_t, int64_t > > | interbreaks ) |
Definition at line 1584 of file routing_filters.cc.
| bool operations_research::PropagateTransitAndSpan | ( | int | path, |
| DimensionValues & | dimension_values ) |
Definition at line 21 of file routing_filter_committables.cc.
| std::string operations_research::ProtobufDebugString | ( | const P & | message | ) |
Definition at line 31 of file proto_utils.h.
| bool operations_research::ProtobufParseTextProtoForFlag | ( | absl::string_view | text, |
| ProtoType * | message_out, | ||
| std::string * | error_out ) |
Definition at line 103 of file proto_utils.h.
| std::string operations_research::ProtobufShortDebugString | ( | const P & | message | ) |
Definition at line 46 of file proto_utils.h.
| bool operations_research::ProtobufTextFormatMergeFromString | ( | absl::string_view | proto_text_string, |
| ProtoType * | proto ) |
Definition at line 79 of file proto_utils.h.
| std::string operations_research::ProtobufTextFormatPrintToStringForFlag | ( | const google::protobuf::Message & | proto | ) |
Definition at line 26 of file proto_utils.cc.
| std::string operations_research::ProtobufTextFormatPrintToStringForFlag | ( | const google::protobuf::MessageLite & | proto | ) |
Definition at line 39 of file proto_utils.cc.
| std::string operations_research::ProtoEnumToString | ( | ProtoEnumType | enum_value | ) |
Definition at line 63 of file proto_utils.h.
| void operations_research::RadixSort | ( | absl::Span< T > | values, |
| int | num_bits = sizeof(T) * 8 ) |
Definition at line 270 of file radix_sort.h.
| void operations_research::RadixSortTpl | ( | absl::Span< T > | values | ) |
Definition at line 101 of file radix_sort.h.
| std::pair< Point, Value > operations_research::RangeConvexMinimum | ( | Point | begin, |
| Point | end, | ||
| absl::FunctionRef< Value(Point)> | f ) |
Definition at line 247 of file binary_search.h.
| std::pair< Point, Value > operations_research::RangeConvexMinimum | ( | std::pair< Point, Value > | current_min, |
| Point | begin, | ||
| Point | end, | ||
| absl::FunctionRef< Value(Point)> | f ) |
Definition at line 280 of file binary_search.h.
| Fraction operations_research::RationalApproximation | ( | const double | x, |
| const double | precision ) |
Definition at line 27 of file rational_approximation.cc.
| std::vector< Proto > operations_research::ReadAllRecordsOrDie | ( | absl::string_view | filename | ) |
Definition at line 117 of file file_util.h.
| std::vector< Proto > operations_research::ReadAllRecordsOrDie | ( | File * | file | ) |
Definition at line 121 of file file_util.h.
| absl::StatusOr< Proto > operations_research::ReadFileToProto | ( | absl::string_view | filename, |
| bool | allow_partial = false ) |
Definition at line 51 of file file_util.h.
| absl::Status operations_research::ReadFileToProto | ( | absl::string_view | filename, |
| google::protobuf::Message * | proto, | ||
| bool | allow_partial ) |
Definition at line 54 of file file_util.cc.
| absl::StatusOr< std::string > operations_research::ReadFileToString | ( | absl::string_view | filename | ) |
Definition at line 43 of file file_util.cc.
| SetCoverModel operations_research::ReadFimiDat | ( | absl::string_view | filename | ) |
Definition at line 182 of file set_cover_reader.cc.
| SetCoverModel operations_research::ReadModel | ( | absl::string_view | filename, |
| FileFormat | format ) |
Definition at line 189 of file set_cover_solve.cc.
| Proto operations_research::ReadOneRecordOrDie | ( | absl::string_view | filename | ) |
Definition at line 129 of file file_util.h.
| SetCoverModel operations_research::ReadOrlibRail | ( | absl::string_view | filename | ) |
Definition at line 153 of file set_cover_reader.cc.
| SetCoverModel operations_research::ReadOrlibScp | ( | absl::string_view | filename | ) |
Definition at line 122 of file set_cover_reader.cc.
| bool operations_research::readParameter | ( | XPRSprob const & | prob, |
| std::string const & | name, | ||
| std::string const & | value ) |
Definition at line 61 of file xpress_interface.cc.
| QapProblem operations_research::ReadQapProblemOrDie | ( | absl::string_view | filepath | ) |
Definition at line 30 of file qap_reader.cc.
| SetCoverModel operations_research::ReadSetCoverProto | ( | absl::string_view | filename, |
| bool | binary ) |
Definition at line 242 of file set_cover_reader.cc.
| SubsetBoolVector operations_research::ReadSetCoverSolutionProto | ( | absl::string_view | filename, |
| bool | binary ) |
Definition at line 370 of file set_cover_reader.cc.
| SubsetBoolVector operations_research::ReadSetCoverSolutionText | ( | absl::string_view | filename | ) |
Definition at line 353 of file set_cover_reader.cc.
| SubsetBoolVector operations_research::ReadSolution | ( | absl::string_view | filename, |
| FileFormat | format ) |
Definition at line 207 of file set_cover_solve.cc.
| void operations_research::RealDebugString | ( | const Container & | container, |
| std::string *const | out ) |
Definition at line 613 of file assignment.cc.
| void operations_research::RealLoad | ( | const AssignmentProto & | assignment_proto, |
| Container *const | container, | ||
| int(AssignmentProto::* | GetSize )() const, | ||
| const Proto &(AssignmentProto::* | GetElem )(int) const ) |
Definition at line 504 of file assignment.cc.
| void operations_research::RealSave | ( | AssignmentProto *const | assignment_proto, |
| const Container & | container, | ||
| Proto *(AssignmentProto::* | Add )() ) |
Definition at line 577 of file assignment.cc.
| void operations_research::RegisterConstraintHandler | ( | ScipConstraintHandler< Constraint > * | handler, |
| SCIP * | scip ) |
| void operations_research::RegisterConstraintHandler | ( | ScipConstraintHandler< ConstraintData > * | handler, |
| SCIP * | scip ) |
Definition at line 251 of file scip_callback.h.
| void operations_research::RegisterDemon | ( | Solver *const | solver, |
| Demon *const | demon, | ||
| DemonProfiler *const | monitor ) |
Definition at line 465 of file demon_profiler.cc.
| LocalSearchOperator * operations_research::RelocateAndMakeActive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
-— RelocateAndMakeActive --—
RelocateAndMakeActive relocates a node and replaces it by an inactive node. The idea is to make room for inactive nodes. Possible neighbor for paths 0 -> 4, 1 -> 2 -> 5 and 3 inactive is: 0 -> 2 -> 4, 1 -> 3 -> 5.
Definition at line 860 of file local_search.cc.
| LocalSearchOperator * operations_research::RelocateAndMakeInactive | ( | Solver * | solver, |
| const std::vector< IntVar * > & | vars, | ||
| const std::vector< IntVar * > & | secondary_vars, | ||
| std::function< int(int64_t)> | start_empty_path_class ) |
--— RelocateAndMakeInactive --—
RelocateAndMakeInactive relocates a node to a new position and makes the node which was at that position inactive. Possible neighbors for paths 0 -> 2 -> 4, 1 -> 3 -> 5 are: 0 -> 3 -> 4, 1 -> 5 & 2 inactive 0 -> 4, 1 -> 2 -> 5 & 3 inactive
Definition at line 1066 of file local_search.cc.
|
extern |
Definition at line 6406 of file expressions.cc.
| std::string operations_research::ReturnCodeString | ( | const int | rc | ) |
Definition at line 67 of file glpk_formatters.cc.
| absl::StatusOr< RootedTree< typename Graph::NodeIndex > > operations_research::RootedTreeFromGraph | ( | const typename Graph::NodeIndex | root, |
| const Graph & | graph, | ||
| std::vector< typename Graph::NodeIndex > *const | topological_order, | ||
| std::vector< typename Graph::NodeIndex > *const | depths ) |
Definition at line 746 of file rooted_tree.h.
| absl::StatusOr< RootedTree< typename Graph::NodeType > > operations_research::RootedTreeFromGraph | ( | typename Graph::NodeType | root, |
| const Graph & | graph, | ||
| std::vector< typename Graph::NodeType > * | topological_order = nullptr, | ||
| std::vector< typename Graph::NodeType > * | depths = nullptr ) |
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::RoutingSearchParameters_SchedulingSolver_descriptor | ( | ) |
Definition at line 653 of file routing_parameters.pb.cc.
|
inline |
Definition at line 107 of file routing_parameters.pb.h.
|
inline |
Definition at line 120 of file routing_parameters.pb.h.
| const ::std::string & operations_research::RoutingSearchParameters_SchedulingSolver_Name | ( | T | value | ) |
Definition at line 113 of file routing_parameters.pb.h.
|
inline |
Definition at line 124 of file routing_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::RoutingSearchStatus_Value_descriptor | ( | ) |
Definition at line 165 of file routing_enums.pb.cc.
|
inline |
Definition at line 205 of file routing_enums.pb.h.
|
inline |
Definition at line 218 of file routing_enums.pb.h.
| const ::std::string & operations_research::RoutingSearchStatus_Value_Name | ( | T | value | ) |
Definition at line 211 of file routing_enums.pb.h.
|
inline |
Definition at line 222 of file routing_enums.pb.h.
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::RuinCompositionStrategy_Value_descriptor | ( | ) |
Definition at line 689 of file routing_ils.pb.cc.
|
inline |
Definition at line 166 of file routing_ils.pb.h.
|
inline |
Definition at line 179 of file routing_ils.pb.h.
| const ::std::string & operations_research::RuinCompositionStrategy_Value_Name | ( | T | value | ) |
Definition at line 172 of file routing_ils.pb.h.
|
inline |
Definition at line 183 of file routing_ils.pb.h.
| void operations_research::Run | ( | ) |
Definition at line 680 of file set_cover_solve.cc.
| SetCoverInvariant operations_research::RunGreedy | ( | SetCoverModel * | model | ) |
Definition at line 271 of file set_cover_solve.cc.
| SetCoverInvariant operations_research::RunLazyElementDegree | ( | SetCoverModel * | model | ) |
Definition at line 262 of file set_cover_solve.cc.
| ScipSeparationResult operations_research::RunSeparation | ( | internal::ScipCallbackRunner * | runner, |
| const ScipConstraintHandlerContext & | context, | ||
| absl::Span< SCIP_CONS * > | constraints, | ||
| bool | is_integral ) |
Definition at line 116 of file scip_callback.cc.
| int64_t operations_research::RunTimeInMicroseconds | ( | const SetCoverSolutionGenerator & | gen | ) |
Definition at line 109 of file set_cover_solve.cc.
| int64_t operations_research::RunTimeInNanoseconds | ( | const SetCoverSolutionGenerator & | gen | ) |
Definition at line 113 of file set_cover_solve.cc.
| bool operations_research::SafeAddInto | ( | IntegerType | a, |
| IntegerType * | b ) |
Definition at line 133 of file saturated_arithmetic.h.
| absl::StatusOr< const Proto * > operations_research::SafeProtoConstDownCast | ( | const google::protobuf::Message * | proto | ) |
Definition at line 83 of file proto_tools.h.
| absl::StatusOr< Proto * > operations_research::SafeProtoDownCast | ( | google::protobuf::Message * | proto | ) |
Definition at line 70 of file proto_tools.h.
| MPSolutionResponse operations_research::SatSolveProto | ( | LazyMutableCopy< MPModelRequest > | request, |
| std::atomic< bool > * | interrupt_solve, | ||
| std::function< void(const std::string &)> | logging_callback, | ||
| std::function< void(const MPSolution &)> | solution_callback, | ||
| std::function< void(const double)> | best_bound_callback ) |
Definition at line 423 of file sat_proto_solver.cc.
| MPSolutionResponse operations_research::SatSolveProtoInternal | ( | LazyMutableCopy< MPModelRequest > | request, |
| sat::Model * | sat_model, | ||
| sat::CpSolverResponse * | cp_response, | ||
| std::function< void(const MPSolution &)> | solution_callback ) |
Definition at line 160 of file sat_proto_solver.cc.
| std::string operations_research::SatSolverVersion | ( | ) |
Definition at line 501 of file sat_proto_solver.cc.
| absl::StatusOr< MPSolutionResponse > operations_research::ScipSolveProto | ( | LazyMutableCopy< MPModelRequest > | request | ) |
Definition at line 719 of file scip_proto_solver.cc.
| void operations_research::SetAssignmentFromAssignment | ( | Assignment * | target_assignment, |
| const std::vector< IntVar * > & | target_vars, | ||
| const Assignment * | source_assignment, | ||
| const std::vector< IntVar * > & | source_vars ) |
NOLINT.
Given a "source_assignment", clears the "target_assignment" and adds all IntVars in "target_vars", with the values of the variables set according to the corresponding values of "source_vars" in "source_assignment". source_vars and target_vars must have the same number of elements. The source and target assignments can belong to different Solvers.
Definition at line 947 of file assignment.cc.
|
inline |
|
inline |
| OR_PROTO_DLLconst::google::protobuf::EnumDescriptor *PROTOBUF_NONNULL operations_research::SetCoverSolutionResponse_Status_descriptor | ( | ) |
Definition at line 217 of file set_cover.pb.cc.
|
inline |
Definition at line 99 of file set_cover.pb.h.
|
inline |
Definition at line 112 of file set_cover.pb.h.
| const ::std::string & operations_research::SetCoverSolutionResponse_Status_Name | ( | T | value | ) |
Definition at line 105 of file set_cover.pb.h.
|
inline |
Definition at line 116 of file set_cover.pb.h.
| Constraint * operations_research::SetIsEqual | ( | IntVar *const | var, |
| absl::Span< const int64_t > | values, | ||
| const std::vector< IntVar * > & | vars ) |
Definition at line 6391 of file expressions.cc.
| Constraint * operations_research::SetIsGreaterOrEqual | ( | IntVar *const | var, |
| absl::Span< const int64_t > | values, | ||
| const std::vector< IntVar * > & | vars ) |
Definition at line 6398 of file expressions.cc.
| int operations_research::setobjoffset | ( | const XPRSprob & | mLp, |
| double | value ) |
Definition at line 184 of file xpress_interface.cc.
| absl::Status operations_research::SetSolverSpecificParameters | ( | absl::string_view | parameters, |
| GRBenv * | gurobi ) |
Definition at line 233 of file gurobi_proto_solver.cc.
| absl::Status operations_research::SetSolverSpecificParameters | ( | const std::string & | parameters, |
| Highs & | highs ) |
Definition at line 307 of file highs_proto_solver.cc.
| void operations_research::SetupGlpkEnvAutomaticDeletion | ( | ) |
Definition at line 35 of file glpk_env_deleter.cc.
| PathWithLength operations_research::ShortestPathsOnDag | ( | const int | num_nodes, |
| absl::Span< const ArcWithLength > | arcs_with_length, | ||
| const int | source, | ||
| const int | destination ) |
Definition at line 83 of file dag_shortest_path.cc.
| std::pair< DistanceType, std::vector< NodeIndex > > operations_research::SimpleOneToOneShortestPath | ( | NodeIndex | source, |
| NodeIndex | destination, | ||
| absl::Span< const NodeIndex > | tails, | ||
| absl::Span< const NodeIndex > | heads, | ||
| absl::Span< const DistanceType > | lengths, | ||
| DistanceType | limit = std::numeric_limits<DistanceType>::max() ) |
Definition at line 672 of file bounded_dijkstra.h.
| std::vector< bool > operations_research::SlopeAndYInterceptToConvexityRegions | ( | absl::Span< const SlopeAndYIntercept > | slope_and_y_intercept | ) |
Definition at line 1514 of file routing_lp_scheduling.cc.
| Select next search node to expand Select next item_i to add this new search node to the search Generate a new search node where item_i is not in the knapsack Check validity of this new partial operations_research::solution | ( | using | propagators | ) |
| bool operations_research::SolutionsAlmostEqual | ( | const GScipSolution & | left, |
| const GScipSolution & | right, | ||
| const double | tolerance ) |
Definition at line 49 of file gscip_testing.cc.
| std::string operations_research::SolutionStatusString | ( | const int | status | ) |
Definition at line 31 of file glpk_formatters.cc.
| std::string operations_research::SolutionToString | ( | const GScipSolution & | solution | ) |
Definition at line 39 of file gscip_testing.cc.
| const Assignment * operations_research::SolveFromAssignmentWithAlternativeSolvers | ( | const Assignment * | assignment, |
| RoutingModel * | primary_model, | ||
| const std::vector< RoutingModel * > & | alternative_models, | ||
| const RoutingSearchParameters & | parameters, | ||
| int | max_non_improving_iterations ) |
Definition at line 148 of file routing_search.cc.
| const Assignment * operations_research::SolveFromAssignmentWithAlternativeSolversAndParameters | ( | const Assignment * | assignment, |
| RoutingModel * | primary_model, | ||
| const RoutingSearchParameters & | primary_parameters, | ||
| const std::vector< RoutingModel * > & | alternative_models, | ||
| const std::vector< RoutingSearchParameters > & | alternative_parameters, | ||
| int | max_non_improving_iterations ) |
Definition at line 158 of file routing_search.cc.
| void operations_research::SolveMaxFlow | ( | const FlowModelProto & | flow_model, |
| double * | loading_time, | ||
| double * | solving_time, | ||
| std::function< void(GraphType *graph)> | configure_graph_options = nullptr ) |
Definition at line 234 of file solve_flow_model.cc.
| void operations_research::SolveMinCostFlow | ( | const FlowModelProto & | flow_model, |
| double * | loading_time, | ||
| double * | solving_time ) |
Definition at line 186 of file solve_flow_model.cc.
| bool operations_research::SolveModelWithSat | ( | RoutingModel * | model, |
| RoutingSearchStats * | search_stats, | ||
| const RoutingSearchParameters & | search_parameters, | ||
| const operations_research::Assignment * | initial_solution, | ||
| operations_research::Assignment * | solution ) |
Attempts to solve the model using the cp-sat solver. As of 5/2019, will solve the TSP corresponding to the model if it has a single vehicle. Therefore the resulting solution might not actually be feasible. Will return false if a solution could not be found.
Definition at line 1173 of file routing_sat.cc.
| MPSolutionResponse operations_research::SolveMPModel | ( | LazyMutableCopy< MPModelRequest > | request, |
| const SolveInterrupter *absl_nullable | interrupter = nullptr ) |
Solves the model encoded by a MPModelRequest protocol buffer and returns the solution encoded as a MPSolutionResponse.
LazyMutableCopy<> accept both 'const MPModelRequest&' and 'MPModelRequest&&' prefer to call this with the std::move() version if you no longer need the request. It will allows to reclaim the request memory as soon as it is converted to one of the solver internal data representation.
If interrupter is non-null, one can call interrupter->Interrupt() to stop the solver earlier. Interruption is only supported if SolverTypeSupportsInterruption() returns true for the requested solver. Passing a non-null pointer with any other solver type immediately returns an MPSOLVER_INCOMPATIBLE_OPTIONS error.
Definition at line 30 of file solve_mp_model.cc.
| bool operations_research::SolverTypeIsMip | ( | MPModelRequest::SolverType | solver_type | ) |
Definition at line 85 of file linear_solver.cc.
|
inline |
Definition at line 994 of file linear_solver.h.
| bool operations_research::SolverTypeSupportsInterruption | ( | const MPModelRequest::SolverType | solver | ) |
Definition at line 46 of file solve_mp_model.cc.
| const Assignment * operations_research::SolveWithAlternativeSolvers | ( | RoutingModel * | primary_model, |
| const std::vector< RoutingModel * > & | alternative_models, | ||
| const RoutingSearchParameters & | parameters, | ||
| int | max_non_improving_iterations ) |
Definition at line 138 of file routing_search.cc.
| void operations_research::splitMyString | ( | const std::string & | str, |
| Container & | cont, | ||
| char | delim = ' ' ) |
Definition at line 2103 of file xpress_interface.cc.
| bool operations_research::stringToCharPtr | ( | const std::string & | var, |
| const char ** | out ) |
Definition at line 2111 of file xpress_interface.cc.
| absl::Status operations_research::StringToProto | ( | absl::string_view | data, |
| google::protobuf::Message * | proto, | ||
| bool | allow_partial ) |
Definition at line 63 of file file_util.cc.
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongIndex | , |
| int | , | ||
| % | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongIndex | , |
| int | , | ||
| * | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongIndex | , |
| int | , | ||
| - | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongIndex | , |
| int | , | ||
| + | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| % | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| * | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| - | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| + | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| / | ) |
| operations_research::STRONG_TYPE_ARITHMETIC_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| << | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongIndex | , |
| int | , | ||
| ! | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongIndex | , |
| int | , | ||
| >= | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongIndex | , |
| int | , | ||
| <= | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongIndex | , |
| int | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| ! | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| >= | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongInt64 | , |
| int64_t | , | ||
| <= | ) |
| operations_research::STRONG_TYPE_COMPARISON_OP | ( | StrongInt64 | , |
| int64_t | ) |
| int32_t operations_research::strtoint32 | ( | absl::string_view | word | ) |
Definition at line 26 of file strtoint.cc.
| int64_t operations_research::strtoint64 | ( | absl::string_view | word | ) |
Definition at line 32 of file strtoint.cc.
|
inline |
Definition at line 107 of file saturated_arithmetic.h.
|
inline |
Definition at line 126 of file saturated_arithmetic.h.
| int64_t operations_research::SumOfKMaxValueInDomain | ( | const Domain & | domain, |
| int | k ) |
Definition at line 845 of file sorted_interval_list.cc.
| int64_t operations_research::SumOfKMinValueInDomain | ( | const Domain & | domain, |
| int | k ) |
Definition at line 831 of file sorted_interval_list.cc.
| GScipParameters operations_research::TestGScipParameters | ( | ) |
Definition at line 33 of file gscip_testing.cc.
| std::vector< int64_t > operations_research::ToInt64Vector | ( | const std::vector< int > & | input | ) |
Definition at line 824 of file utilities.cc.
| absl::Status operations_research::TopologicalOrderIsValid | ( | const GraphType & | graph, |
| absl::Span< const typename GraphType::NodeIndex > | topological_order ) |
Definition at line 292 of file dag_shortest_path.h.
| absl::Status operations_research::TopologicalOrderIsValid | ( | const GraphType & | graph, |
| absl::Span< const typename GraphType::NodeIndex > | topological_order ) |
| std::string operations_research::ToString | ( | MPCallbackEvent | event | ) |
Definition at line 23 of file linear_solver_callback.cc.
| absl::string_view operations_research::ToString | ( | MPSolver::OptimizationProblemType | optimization_problem_type | ) |
Definition at line 494 of file linear_solver.cc.
| std::string operations_research::TruncateAndQuoteGLPKName | ( | const std::string_view | original_name | ) |
Definition at line 112 of file glpk_formatters.cc.
|
inline |
|
inline |
Definition at line 82 of file saturated_arithmetic.h.
|
inline |
Definition at line 89 of file saturated_arithmetic.h.
| int32_t operations_research::UnsafeLeastSignificantBitPosition32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
| int64_t operations_research::UnsafeLeastSignificantBitPosition64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
| int32_t operations_research::UnsafeMostSignificantBitPosition32 | ( | const uint32_t * | bitset, |
| uint32_t | start, | ||
| uint32_t | end ) |
| int64_t operations_research::UnsafeMostSignificantBitPosition64 | ( | const uint64_t * | bitset, |
| uint64_t | start, | ||
| uint64_t | end ) |
| std::string operations_research::VariablesToString | ( | absl::flat_hash_map< std::string, std::pair< sat::IntegerVariableProto, int > > & | variables, |
| absl::flat_hash_map< std::string, std::vector< int > > & | variable_instances, | ||
| absl::flat_hash_map< std::string, absl::flat_hash_set< std::string > > & | variable_childs, | ||
| const sat::CpSolverResponse & | response_, | ||
| absl::string_view | variable, | ||
| std::string | prefix = "" ) |
Definition at line 3476 of file routing_lp_scheduling.cc.
| std::string operations_research::VariableToString | ( | std::pair< sat::IntegerVariableProto, int > & | variable_pair, |
| const sat::CpSolverResponse & | response_ ) |
Definition at line 3429 of file routing_lp_scheduling.cc.
|
inline |
Definition at line 37 of file vector_sum.h.
| void operations_research::WriteModel | ( | const SetCoverModel & | model, |
| const std::string & | filename, | ||
| FileFormat | format ) |
Definition at line 221 of file set_cover_solve.cc.
| absl::Status operations_research::WriteModelToMpsFile | ( | absl::string_view | filename, |
| const MPModelProto & | model, | ||
| const MPModelExportOptions & | options = MPModelExportOptions() ) |
Write the current model (variables, constraints, objective) to a file in MPS file format, using the "free" MPS format.
Definition at line 254 of file model_exporter.cc.
| void operations_research::WriteOrlibRail | ( | const SetCoverModel & | model, |
| absl::string_view | filename ) |
Definition at line 322 of file set_cover_reader.cc.
| void operations_research::WriteOrlibScp | ( | const SetCoverModel & | model, |
| absl::string_view | filename ) |
Definition at line 297 of file set_cover_reader.cc.
| absl::Status operations_research::WriteProtoToFile | ( | absl::string_view | filename, |
| const google::protobuf::Message & | proto, | ||
| ProtoWriteFormat | proto_write_format, | ||
| bool | gzipped, | ||
| bool | append_extension_to_file_name ) |
Definition at line 143 of file file_util.cc.
| void operations_research::WriteRecordsOrDie | ( | absl::string_view | filename, |
| const std::vector< Proto > & | protos ) |
Definition at line 138 of file file_util.h.
| void operations_research::WriteSetCoverProto | ( | const SetCoverModel & | model, |
| absl::string_view | filename, | ||
| bool | binary ) |
Definition at line 343 of file set_cover_reader.cc.
| void operations_research::WriteSetCoverSolutionProto | ( | const SetCoverModel & | model, |
| const SubsetBoolVector & | solution, | ||
| absl::string_view | filename, | ||
| bool | binary ) |
Definition at line 413 of file set_cover_reader.cc.
| void operations_research::WriteSetCoverSolutionText | ( | const SetCoverModel & | model, |
| const SubsetBoolVector & | solution, | ||
| absl::string_view | filename ) |
Definition at line 388 of file set_cover_reader.cc.
| void operations_research::WriteSolution | ( | const SetCoverModel & | model, |
| const SubsetBoolVector & | solution, | ||
| absl::string_view | filename, | ||
| FileFormat | format ) |
Definition at line 243 of file set_cover_solve.cc.
| std::vector< int > operations_research::XpressBasisStatusesFrom | ( | const std::vector< MPSolver::BasisStatus > & | statuses | ) |
Definition at line 1718 of file xpress_interface.cc.
| std::vector< std::string > operations_research::XpressDynamicLibraryPotentialPaths | ( | ) |
Definition at line 239 of file xpress_environment.cc.
Definition at line 2223 of file xpress_interface.cc.
| bool operations_research::XpressIsCorrectlyInstalled | ( | ) |
Definition at line 432 of file xpress_environment.cc.
|
static |
Definition at line 1247 of file xpress_interface.cc.
| KShortestPaths< GraphType > operations_research::YenKShortestPaths | ( | const GraphType & | graph, |
| const std::vector< PathDistance > & | arc_lengths, | ||
| typename GraphType::NodeIndex | source, | ||
| typename GraphType::NodeIndex | destination, | ||
| unsigned | k ) |
Definition at line 290 of file k_shortest_paths.h.
|
inline |
NOLINT.
This method returns 0. It is useful when 0 can be cast either as a pointer or as an integer value and thus lead to an ambiguous function call.
Definition at line 3436 of file constraint_solver.h.
| OR_PROTO_DLL AbsencesBasedAcceptanceStrategyDefaultTypeInternal operations_research::_AbsencesBasedAcceptanceStrategy_default_instance_ |
Definition at line 265 of file routing_ils.pb.cc.
| OR_PROTO_DLL AcceptanceStrategyDefaultTypeInternal operations_research::_AcceptanceStrategy_default_instance_ |
Definition at line 343 of file routing_ils.pb.cc.
| OR_PROTO_DLL AllNodesPerformedAcceptanceStrategyDefaultTypeInternal operations_research::_AllNodesPerformedAcceptanceStrategy_default_instance_ |
Definition at line 240 of file routing_ils.pb.cc.
| OR_PROTO_DLL AssignmentProtoDefaultTypeInternal operations_research::_AssignmentProto_default_instance_ |
Definition at line 185 of file assignment.pb.cc.
| OR_PROTO_DLL CapacityConstraintProto_CapacityTermDefaultTypeInternal operations_research::_CapacityConstraintProto_CapacityTerm_default_instance_ |
Definition at line 79 of file capacity.pb.cc.
| OR_PROTO_DLL CapacityConstraintProto_CapacityTerm_ElementWeightPairDefaultTypeInternal operations_research::_CapacityConstraintProto_CapacityTerm_ElementWeightPair_default_instance_ |
Definition at line 53 of file capacity.pb.cc.
| OR_PROTO_DLL CapacityConstraintProtoDefaultTypeInternal operations_research::_CapacityConstraintProto_default_instance_ |
Definition at line 106 of file capacity.pb.cc.
| OR_PROTO_DLL ClassAssignmentDefaultTypeInternal operations_research::_ClassAssignment_default_instance_ |
Definition at line 209 of file course_scheduling.pb.cc.
| OR_PROTO_DLL ConstraintRunsDefaultTypeInternal operations_research::_ConstraintRuns_default_instance_ |
Definition at line 92 of file demon_profiler.pb.cc.
| OR_PROTO_DLL ConstraintSolverParametersDefaultTypeInternal operations_research::_ConstraintSolverParameters_default_instance_ |
Definition at line 80 of file solver_parameters.pb.cc.
| OR_PROTO_DLL ConstraintSolverStatisticsDefaultTypeInternal operations_research::_ConstraintSolverStatistics_default_instance_ |
Definition at line 178 of file search_stats.pb.cc.
| OR_PROTO_DLL CoolingScheduleStrategyDefaultTypeInternal operations_research::_CoolingScheduleStrategy_default_instance_ |
Definition at line 222 of file routing_ils.pb.cc.
| OR_PROTO_DLL CourseDefaultTypeInternal operations_research::_Course_default_instance_ |
Definition at line 179 of file course_scheduling.pb.cc.
| OR_PROTO_DLL CourseSchedulingModelDefaultTypeInternal operations_research::_CourseSchedulingModel_default_instance_ |
Definition at line 272 of file course_scheduling.pb.cc.
| OR_PROTO_DLL CourseSchedulingResultDefaultTypeInternal operations_research::_CourseSchedulingResult_default_instance_ |
Definition at line 239 of file course_scheduling.pb.cc.
| OR_PROTO_DLL DemonRunsDefaultTypeInternal operations_research::_DemonRuns_default_instance_ |
Definition at line 59 of file demon_profiler.pb.cc.
| OR_PROTO_DLL FirstSolutionStrategyDefaultTypeInternal operations_research::_FirstSolutionStrategy_default_instance_ |
Definition at line 81 of file routing_enums.pb.cc.
| OR_PROTO_DLL FlowArcProtoDefaultTypeInternal operations_research::_FlowArcProto_default_instance_ |
Definition at line 81 of file flow_problem.pb.cc.
| OR_PROTO_DLL FlowModelProtoDefaultTypeInternal operations_research::_FlowModelProto_default_instance_ |
Definition at line 108 of file flow_problem.pb.cc.
| OR_PROTO_DLL FlowNodeProtoDefaultTypeInternal operations_research::_FlowNodeProto_default_instance_ |
Definition at line 53 of file flow_problem.pb.cc.
| OR_PROTO_DLL GlobalCheapestInsertionParametersDefaultTypeInternal operations_research::_GlobalCheapestInsertionParameters_default_instance_ |
Definition at line 111 of file routing_heuristic_parameters.pb.cc.
| OR_PROTO_DLL GreedyDescentAcceptanceStrategyDefaultTypeInternal operations_research::_GreedyDescentAcceptanceStrategy_default_instance_ |
Definition at line 204 of file routing_ils.pb.cc.
| OR_PROTO_DLL GScipOutputDefaultTypeInternal operations_research::_GScipOutput_default_instance_ |
Definition at line 246 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_BoolParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_BoolParamsEntry_DoNotUse_default_instance_ |
Definition at line 169 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_CharParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_CharParamsEntry_DoNotUse_default_instance_ |
Definition at line 151 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParametersDefaultTypeInternal operations_research::_GScipParameters_default_instance_ |
Definition at line 217 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_IntParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_IntParamsEntry_DoNotUse_default_instance_ |
Definition at line 133 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_LongParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_LongParamsEntry_DoNotUse_default_instance_ |
Definition at line 115 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_RealParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_RealParamsEntry_DoNotUse_default_instance_ |
Definition at line 97 of file gscip.pb.cc.
| OR_PROTO_DLL GScipParameters_StringParamsEntry_DoNotUseDefaultTypeInternal operations_research::_GScipParameters_StringParamsEntry_DoNotUse_default_instance_ |
Definition at line 79 of file gscip.pb.cc.
| OR_PROTO_DLL GScipSolvingStatsDefaultTypeInternal operations_research::_GScipSolvingStats_default_instance_ |
Definition at line 61 of file gscip.pb.cc.
| OR_PROTO_DLL Int128DefaultTypeInternal operations_research::_Int128_default_instance_ |
Definition at line 53 of file int128.pb.cc.
| OR_PROTO_DLL IntervalVarAssignmentDefaultTypeInternal operations_research::_IntervalVarAssignment_default_instance_ |
Definition at line 125 of file assignment.pb.cc.
| OR_PROTO_DLL IntVarAssignmentDefaultTypeInternal operations_research::_IntVarAssignment_default_instance_ |
Definition at line 155 of file assignment.pb.cc.
| OR_PROTO_DLL IteratedLocalSearchParametersDefaultTypeInternal operations_research::_IteratedLocalSearchParameters_default_instance_ |
Definition at line 428 of file routing_ils.pb.cc.
| OR_PROTO_DLL LocalCheapestInsertionParametersDefaultTypeInternal operations_research::_LocalCheapestInsertionParameters_default_instance_ |
Definition at line 82 of file routing_heuristic_parameters.pb.cc.
| OR_PROTO_DLL LocalSearchMetaheuristicDefaultTypeInternal operations_research::_LocalSearchMetaheuristic_default_instance_ |
Definition at line 63 of file routing_enums.pb.cc.
| OR_PROTO_DLL LocalSearchStatisticsDefaultTypeInternal operations_research::_LocalSearchStatistics_default_instance_ |
Definition at line 208 of file search_stats.pb.cc.
| OR_PROTO_DLL LocalSearchStatistics_FirstSolutionStatisticsDefaultTypeInternal operations_research::_LocalSearchStatistics_FirstSolutionStatistics_default_instance_ |
Definition at line 149 of file search_stats.pb.cc.
| OR_PROTO_DLL LocalSearchStatistics_LocalSearchFilterStatisticsDefaultTypeInternal operations_research::_LocalSearchStatistics_LocalSearchFilterStatistics_default_instance_ |
Definition at line 121 of file search_stats.pb.cc.
| OR_PROTO_DLL LocalSearchStatistics_LocalSearchOperatorStatisticsDefaultTypeInternal operations_research::_LocalSearchStatistics_LocalSearchOperatorStatistics_default_instance_ |
Definition at line 87 of file search_stats.pb.cc.
| OR_PROTO_DLL MoreNodesPerformedAcceptanceStrategyDefaultTypeInternal operations_research::_MoreNodesPerformedAcceptanceStrategy_default_instance_ |
Definition at line 186 of file routing_ils.pb.cc.
| OR_PROTO_DLL MPAbsConstraintDefaultTypeInternal operations_research::_MPAbsConstraint_default_instance_ |
Definition at line 395 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPArrayConstraintDefaultTypeInternal operations_research::_MPArrayConstraint_default_instance_ |
Definition at line 369 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPArrayWithConstantConstraintDefaultTypeInternal operations_research::_MPArrayWithConstantConstraint_default_instance_ |
Definition at line 343 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPConstraintProtoDefaultTypeInternal operations_research::_MPConstraintProto_default_instance_ |
Definition at line 316 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPGeneralConstraintProtoDefaultTypeInternal operations_research::_MPGeneralConstraintProto_default_instance_ |
Definition at line 584 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPIndicatorConstraintDefaultTypeInternal operations_research::_MPIndicatorConstraint_default_instance_ |
Definition at line 526 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelDeltaProto_ConstraintOverridesEntry_DoNotUseDefaultTypeInternal operations_research::_MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse_default_instance_ |
Definition at line 499 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelDeltaProtoDefaultTypeInternal operations_research::_MPModelDeltaProto_default_instance_ |
Definition at line 555 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelDeltaProto_VariableOverridesEntry_DoNotUseDefaultTypeInternal operations_research::_MPModelDeltaProto_VariableOverridesEntry_DoNotUse_default_instance_ |
Definition at line 481 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelProto_AnnotationDefaultTypeInternal operations_research::_MPModelProto_Annotation_default_instance_ |
Definition at line 283 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelProtoDefaultTypeInternal operations_research::_MPModelProto_default_instance_ |
Definition at line 619 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPModelRequestDefaultTypeInternal operations_research::_MPModelRequest_default_instance_ |
Definition at line 653 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPQuadraticConstraintDefaultTypeInternal operations_research::_MPQuadraticConstraint_default_instance_ |
Definition at line 248 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPQuadraticObjectiveDefaultTypeInternal operations_research::_MPQuadraticObjective_default_instance_ |
Definition at line 217 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPSolutionDefaultTypeInternal operations_research::_MPSolution_default_instance_ |
Definition at line 190 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPSolutionResponseDefaultTypeInternal operations_research::_MPSolutionResponse_default_instance_ |
Definition at line 463 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPSolveInfoDefaultTypeInternal operations_research::_MPSolveInfo_default_instance_ |
Definition at line 164 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPSolverCommonParametersDefaultTypeInternal operations_research::_MPSolverCommonParameters_default_instance_ |
Definition at line 425 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPSosConstraintDefaultTypeInternal operations_research::_MPSosConstraint_default_instance_ |
Definition at line 138 of file linear_solver.pb.cc.
| OR_PROTO_DLL MPVariableProtoDefaultTypeInternal operations_research::_MPVariableProto_default_instance_ |
Definition at line 111 of file linear_solver.pb.cc.
| OR_PROTO_DLL OptionalDoubleDefaultTypeInternal operations_research::_OptionalDouble_default_instance_ |
Definition at line 79 of file linear_solver.pb.cc.
| OR_PROTO_DLL PartialVariableAssignmentDefaultTypeInternal operations_research::_PartialVariableAssignment_default_instance_ |
Definition at line 54 of file linear_solver.pb.cc.
| OR_PROTO_DLL PerturbationStrategyDefaultTypeInternal operations_research::_PerturbationStrategy_default_instance_ |
Definition at line 168 of file routing_ils.pb.cc.
| OR_PROTO_DLL RandomWalkRuinStrategyDefaultTypeInternal operations_research::_RandomWalkRuinStrategy_default_instance_ |
Definition at line 150 of file routing_ils.pb.cc.
| OR_PROTO_DLL RecreateParametersDefaultTypeInternal operations_research::_RecreateParameters_default_instance_ |
Definition at line 317 of file routing_ils.pb.cc.
| OR_PROTO_DLL RecreateStrategyDefaultTypeInternal operations_research::_RecreateStrategy_default_instance_ |
Definition at line 369 of file routing_ils.pb.cc.
| OR_PROTO_DLL RegularLimitParametersDefaultTypeInternal operations_research::_RegularLimitParameters_default_instance_ |
Definition at line 57 of file search_limit.pb.cc.
| OR_PROTO_DLL RoomDefaultTypeInternal operations_research::_Room_default_instance_ |
Definition at line 142 of file course_scheduling.pb.cc.
| OR_PROTO_DLL RoutingModelParametersDefaultTypeInternal operations_research::_RoutingModelParameters_default_instance_ |
Definition at line 144 of file routing_parameters.pb.cc.
| OR_PROTO_DLL RoutingSearchParametersDefaultTypeInternal operations_research::_RoutingSearchParameters_default_instance_ |
Definition at line 221 of file routing_parameters.pb.cc.
| OR_PROTO_DLL RoutingSearchParameters_ImprovementSearchLimitParametersDefaultTypeInternal operations_research::_RoutingSearchParameters_ImprovementSearchLimitParameters_default_instance_ |
Definition at line 117 of file routing_parameters.pb.cc.
| OR_PROTO_DLL RoutingSearchParameters_LocalSearchNeighborhoodOperatorsDefaultTypeInternal operations_research::_RoutingSearchParameters_LocalSearchNeighborhoodOperators_default_instance_ |
Definition at line 91 of file routing_parameters.pb.cc.
| OR_PROTO_DLL RoutingSearchStatusDefaultTypeInternal operations_research::_RoutingSearchStatus_default_instance_ |
Definition at line 45 of file routing_enums.pb.cc.
| OR_PROTO_DLL RuinCompositionStrategyDefaultTypeInternal operations_research::_RuinCompositionStrategy_default_instance_ |
Definition at line 125 of file routing_ils.pb.cc.
| OR_PROTO_DLL RuinRecreateParametersDefaultTypeInternal operations_research::_RuinRecreateParameters_default_instance_ |
Definition at line 399 of file routing_ils.pb.cc.
| OR_PROTO_DLL RuinStrategyDefaultTypeInternal operations_research::_RuinStrategy_default_instance_ |
Definition at line 291 of file routing_ils.pb.cc.
| OR_PROTO_DLL SavingsParametersDefaultTypeInternal operations_research::_SavingsParameters_default_instance_ |
Definition at line 55 of file routing_heuristic_parameters.pb.cc.
| OR_PROTO_DLL SearchStatisticsDefaultTypeInternal operations_research::_SearchStatistics_default_instance_ |
Definition at line 235 of file search_stats.pb.cc.
| OR_PROTO_DLL SequenceVarAssignmentDefaultTypeInternal operations_research::_SequenceVarAssignment_default_instance_ |
Definition at line 89 of file assignment.pb.cc.
| OR_PROTO_DLL SetCoverProtoDefaultTypeInternal operations_research::_SetCoverProto_default_instance_ |
Definition at line 115 of file set_cover.pb.cc.
| OR_PROTO_DLL SetCoverProto_SubsetDefaultTypeInternal operations_research::_SetCoverProto_Subset_default_instance_ |
Definition at line 54 of file set_cover.pb.cc.
| OR_PROTO_DLL SetCoverSolutionResponseDefaultTypeInternal operations_research::_SetCoverSolutionResponse_default_instance_ |
Definition at line 86 of file set_cover.pb.cc.
| OR_PROTO_DLL SimulatedAnnealingAcceptanceStrategyDefaultTypeInternal operations_research::_SimulatedAnnealingAcceptanceStrategy_default_instance_ |
Definition at line 80 of file routing_ils.pb.cc.
| OR_PROTO_DLL SISRRuinStrategyDefaultTypeInternal operations_research::_SISRRuinStrategy_default_instance_ |
Definition at line 107 of file routing_ils.pb.cc.
| OR_PROTO_DLL SpatiallyCloseRoutesRuinStrategyDefaultTypeInternal operations_research::_SpatiallyCloseRoutesRuinStrategy_default_instance_ |
Definition at line 52 of file routing_ils.pb.cc.
| OR_PROTO_DLL StudentDefaultTypeInternal operations_research::_Student_default_instance_ |
Definition at line 114 of file course_scheduling.pb.cc.
| OR_PROTO_DLL StudentAssignmentDefaultTypeInternal operations_research::_StudentAssignment_default_instance_ |
Definition at line 85 of file course_scheduling.pb.cc.
| OR_PROTO_DLL SubSolverStatisticsDefaultTypeInternal operations_research::_SubSolverStatistics_default_instance_ |
Definition at line 54 of file search_stats.pb.cc.
| OR_PROTO_DLL TeacherDefaultTypeInternal operations_research::_Teacher_default_instance_ |
Definition at line 56 of file course_scheduling.pb.cc.
| OR_PROTO_DLL WorkerInfoDefaultTypeInternal operations_research::_WorkerInfo_default_instance_ |
Definition at line 55 of file assignment.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::AbsencesBasedAcceptanceStrategy_class_data_ |
Definition at line 4165 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::AcceptanceStrategy_class_data_ |
Definition at line 4553 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::AllNodesPerformedAcceptanceStrategy_class_data_ |
Definition at line 3922 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::AssignmentProto_class_data_ |
Definition at line 2158 of file assignment.pb.cc.
| const double operations_research::BronKerboschAlgorithm< NodeIndex >::kPushStateDeterministicTimeSecondsPerCandidate = 0.54663e-7 |
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CapacityConstraintProto_CapacityTerm_class_data_ |
Definition at line 591 of file capacity.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CapacityConstraintProto_CapacityTerm_ElementWeightPair_class_data_ |
Definition at line 275 of file capacity.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CapacityConstraintProto_class_data_ |
Definition at line 920 of file capacity.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::ClassAssignment_class_data_ |
Definition at line 1533 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::ConstraintRuns_class_data_ |
Definition at line 697 of file demon_profiler.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::ConstraintSolverParameters_class_data_ |
Definition at line 325 of file solver_parameters.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::ConstraintSolverParameters_TrailCompression_internal_data_ |
Definition at line 209 of file solver_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 90 of file solver_parameters.pb.h.
|
inlineconstexpr |
Definition at line 85 of file solver_parameters.pb.h.
|
inlineconstexpr |
Definition at line 83 of file solver_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::ConstraintSolverStatistics_class_data_ |
Definition at line 2210 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CoolingScheduleStrategy_class_data_ |
Definition at line 3385 of file routing_ils.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::CoolingScheduleStrategy_Value_internal_data_ |
Definition at line 705 of file routing_ils.pb.cc.
|
inlineconstexpr |
Definition at line 242 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 237 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 235 of file routing_ils.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::Course_class_data_ |
Definition at line 2300 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CourseSchedulingModel_class_data_ |
Definition at line 600 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::CourseSchedulingResult_class_data_ |
Definition at line 1115 of file course_scheduling.pb.cc.
|
inlineconstexpr |
Definition at line 123 of file course_scheduling.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::CourseSchedulingResultStatus_internal_data_ |
Definition at line 452 of file course_scheduling.pb.cc.
|
inlineconstexpr |
Definition at line 118 of file course_scheduling.pb.h.
|
inlineconstexpr |
Definition at line 116 of file course_scheduling.pb.h.
| const bool operations_research::DEBUG_MODE = true |
Definition at line 266 of file radix_sort.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::DemonRuns_class_data_ |
Definition at line 293 of file demon_profiler.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::FirstSolutionStrategy_class_data_ |
Definition at line 235 of file routing_enums.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::FirstSolutionStrategy_Value_internal_data_ |
Definition at line 157 of file routing_enums.pb.cc.
|
inlineconstexpr |
Definition at line 125 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 120 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 118 of file routing_enums.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::FlowArcProto_class_data_ |
Definition at line 290 of file flow_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::FlowModelProto_class_data_ |
Definition at line 925 of file flow_problem.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::FlowModelProto_ProblemType_internal_data_ |
Definition at line 195 of file flow_problem.pb.cc.
|
inlineconstexpr |
Definition at line 95 of file flow_problem.pb.h.
|
inlineconstexpr |
Definition at line 90 of file flow_problem.pb.h.
|
inlineconstexpr |
Definition at line 88 of file flow_problem.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::FlowNodeProto_class_data_ |
Definition at line 615 of file flow_problem.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GlobalCheapestInsertionParameters_class_data_ |
Definition at line 979 of file routing_heuristic_parameters.pb.cc.
| std::function< int(GRBmodel *model, int numnz, int *cind, double *cval, char sense, double rhs, const char *constrname)> operations_research::GRBaddconstr = nullptr |
Definition at line 129 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numconstrs, int numnz, int *cbeg, int *cind, double *cval, char *sense, double *rhs, char **constrnames)> operations_research::GRBaddconstrs = nullptr |
Definition at line 133 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int resvar, int argvar)> operations_research::GRBaddgenconstrAbs = nullptr |
Definition at line 147 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars)> operations_research::GRBaddgenconstrAnd = nullptr |
Definition at line 150 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int binvar, int binval, int nvars, const int *vars, const double *vals, char sense, double rhs)> operations_research::GRBaddgenconstrIndicator = nullptr |
Definition at line 157 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars, double constant)> operations_research::GRBaddgenconstrMax = nullptr |
Definition at line 142 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars, double constant)> operations_research::GRBaddgenconstrMin = nullptr |
Definition at line 145 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *name, int resvar, int nvars, const int *vars)> operations_research::GRBaddgenconstrOr = nullptr |
Definition at line 153 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numlnz, int *lind, double *lval, int numqnz, int *qrow, int *qcol, double *qval, char sense, double rhs, const char *QCname)> operations_research::GRBaddqconstr = nullptr |
Definition at line 161 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numqnz, int *qrow, int *qcol, double *qval)> operations_research::GRBaddqpterms = nullptr |
Definition at line 164 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numnz, int *cind, double *cval, double lower, double upper, const char *constrname)> operations_research::GRBaddrangeconstr = nullptr |
Definition at line 136 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numsos, int nummembers, int *types, int *beg, int *ind, double *weight)> operations_research::GRBaddsos = nullptr |
Definition at line 139 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numnz, int *vind, double *vval, double obj, double lb, double ub, char vtype, const char *varname)> operations_research::GRBaddvar = nullptr |
Definition at line 122 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int numvars, int numnz, int *vbeg, int *vind, double *vval, double *obj, double *lb, double *ub, char *vtype, char **varnames)> operations_research::GRBaddvars = nullptr |
Definition at line 126 of file gurobi_environment.cc.
| std::function< int(void *cbdata, int cutlen, const int *cutind, const double *cutval, char cutsense, double cutrhs)> operations_research::GRBcbcut = nullptr |
Definition at line 105 of file gurobi_environment.cc.
| std::function< int(void *cbdata, int where, int what, void *resultP)> operations_research::GRBcbget |
Definition at line 99 of file gurobi_environment.cc.
| std::function< int(void *cbdata, int lazylen, const int *lazyind, const double *lazyval, char lazysense, double lazyrhs)> operations_research::GRBcblazy = nullptr |
Definition at line 108 of file gurobi_environment.cc.
| std::function< int(void *cbdata, const double *solution, double *objvalP)> operations_research::GRBcbsolution = nullptr |
Definition at line 102 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int cnt, int *cind, int *vind, double *val)> operations_research::GRBchgcoeffs = nullptr |
Definition at line 173 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model)> operations_research::GRBcomputeIIS = nullptr |
Definition at line 113 of file gurobi_environment.cc.
Definition at line 208 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int len, int *ind)> operations_research::GRBdelconstrs = nullptr |
Definition at line 166 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int len, int *ind)> operations_research::GRBdelgenconstrs |
Definition at line 168 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model)> operations_research::GRBdelq = nullptr |
Definition at line 171 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int len, int *ind)> operations_research::GRBdelqconstrs = nullptr |
Definition at line 170 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int len, int *ind)> operations_research::GRBdelsos = nullptr |
Definition at line 167 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int len, int *ind)> operations_research::GRBdelvars = nullptr |
Definition at line 165 of file gurobi_environment.cc.
Definition at line 215 of file gurobi_environment.cc.
| std::function< int(GRBenv **envP)> operations_research::GRBemptyenv = nullptr |
Definition at line 210 of file gurobi_environment.cc.
| std::function< void(GRBenv *env)> operations_research::GRBfreeenv = nullptr |
Definition at line 216 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model)> operations_research::GRBfreemodel = nullptr |
Definition at line 175 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, char *values)> operations_research::GRBgetcharattrarray = nullptr |
Definition at line 66 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, char *valueP)> operations_research::GRBgetcharattrelement = nullptr |
Definition at line 60 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, double *valueP)> operations_research::GRBgetdblattr = nullptr |
Definition at line 74 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, double *values)> operations_research::GRBgetdblattrarray = nullptr |
Definition at line 85 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, double *valueP)> operations_research::GRBgetdblattrelement = nullptr |
Definition at line 79 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, double *valueP)> operations_research::GRBgetdblparam = nullptr |
Definition at line 184 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP, const char *paramname, double *valueP, double *minP, double *maxP, double *defP)> operations_research::GRBgetdblparaminfo = nullptr |
Definition at line 192 of file gurobi_environment.cc.
Definition at line 213 of file gurobi_environment.cc.
| std::function< const char *(GRBenv *env)> operations_research::GRBgeterrormsg = nullptr |
Definition at line 217 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int *valueP)> operations_research::GRBgetintattr = nullptr |
Definition at line 40 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, int *values)> operations_research::GRBgetintattrarray = nullptr |
Definition at line 51 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, int *valueP)> operations_research::GRBgetintattrelement = nullptr |
Definition at line 45 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, int *valueP)> operations_research::GRBgetintparam = nullptr |
Definition at line 182 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP, const char *paramname, int *valueP, int *minP, int *maxP, int *defP)> operations_research::GRBgetintparaminfo = nullptr |
Definition at line 189 of file gurobi_environment.cc.
Definition at line 214 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP)> operations_research::GRBgetnumparams = nullptr |
Definition at line 209 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP, int i, char **paramnameP)> operations_research::GRBgetparamname |
Definition at line 197 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP, const char *paramname)> operations_research::GRBgetparamtype |
Definition at line 195 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, char **valueP)> operations_research::GRBgetstrattr = nullptr |
Definition at line 93 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, char *valueP)> operations_research::GRBgetstrparam = nullptr |
Definition at line 186 of file gurobi_environment.cc.
| std::function< int(GRBenv *envP, const char *paramname, char *valueP, char *defP)> operations_research::GRBgetstrparaminfo = nullptr |
Definition at line 194 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int *numnzP, int *vbeg, int *vind, double *vval, int start, int len)> operations_research::GRBgetvars = nullptr |
Definition at line 111 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname)> operations_research::GRBisattravailable |
Definition at line 37 of file gurobi_environment.cc.
| std::function< int(GRBenv **envP, const char *logfilename)> operations_research::GRBloadenv = nullptr |
Definition at line 211 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, GRBmodel **modelP, const char *Pname, int numvars, double *obj, double *lb, double *ub, char *vtype, char **varnames)> operations_research::GRBnewmodel = nullptr |
Definition at line 118 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model)> operations_research::GRBoptimize = nullptr |
Definition at line 112 of file gurobi_environment.cc.
| std::function< char *(void)> operations_research::GRBplatform = nullptr |
Definition at line 220 of file gurobi_environment.cc.
| std::function< int(GRBenv *env)> operations_research::GRBresetparams = nullptr |
Definition at line 207 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int(GUROBI_STDCALL *cb)(CB_ARGS), void *usrdata)> operations_research::GRBsetcallbackfunc = nullptr |
Definition at line 98 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, char *newvalues)> operations_research::GRBsetcharattrarray = nullptr |
Definition at line 69 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, char newvalue)> operations_research::GRBsetcharattrelement = nullptr |
Definition at line 63 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, char *newvalues)> operations_research::GRBsetcharattrlist = nullptr |
Definition at line 72 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, double newvalue)> operations_research::GRBsetdblattr = nullptr |
Definition at line 76 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, double *newvalues)> operations_research::GRBsetdblattrarray = nullptr |
Definition at line 88 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, double newvalue)> operations_research::GRBsetdblattrelement = nullptr |
Definition at line 82 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, double *newvalues)> operations_research::GRBsetdblattrlist = nullptr |
Definition at line 91 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, double value)> operations_research::GRBsetdblparam = nullptr |
Definition at line 204 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int newvalue)> operations_research::GRBsetintattr = nullptr |
Definition at line 42 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int first, int len, int *newvalues)> operations_research::GRBsetintattrarray = nullptr |
Definition at line 54 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int element, int newvalue)> operations_research::GRBsetintattrelement = nullptr |
Definition at line 48 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, int len, int *ind, int *newvalues)> operations_research::GRBsetintattrlist = nullptr |
Definition at line 57 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, int value)> operations_research::GRBsetintparam = nullptr |
Definition at line 202 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, int index, int priority, double weight, double abstol, double reltol, const char *name, double constant, int lnz, int *lind, double *lval)> operations_research::GRBsetobjectiven = nullptr |
Definition at line 180 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, const char *value)> operations_research::GRBsetparam = nullptr |
Definition at line 200 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *attrname, const char *newvalue)> operations_research::GRBsetstrattr = nullptr |
Definition at line 95 of file gurobi_environment.cc.
| std::function< int(GRBenv *env, const char *paramname, const char *value)> operations_research::GRBsetstrparam = nullptr |
Definition at line 206 of file gurobi_environment.cc.
| std::function< int(GRBenv *env)> operations_research::GRBstartenv = nullptr |
Definition at line 212 of file gurobi_environment.cc.
| std::function< void(GRBmodel *model)> operations_research::GRBterminate = nullptr |
Definition at line 176 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model)> operations_research::GRBupdatemodel = nullptr |
Definition at line 174 of file gurobi_environment.cc.
| std::function< void(int *majorP, int *minorP, int *technicalP)> operations_research::GRBversion |
Definition at line 218 of file gurobi_environment.cc.
| std::function< int(GRBmodel *model, const char *filename)> operations_research::GRBwrite = nullptr |
Definition at line 114 of file gurobi_environment.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GreedyDescentAcceptanceStrategy_class_data_ |
Definition at line 3495 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipOutput_class_data_ |
Definition at line 2698 of file gscip.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::GScipOutput_Status_internal_data_ |
Definition at line 493 of file gscip.pb.cc.
|
inlineconstexpr |
Definition at line 233 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 228 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 226 of file gscip.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_BoolParamsEntry_DoNotUse_class_data_ |
Definition at line 541 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_CharParamsEntry_DoNotUse_class_data_ |
Definition at line 933 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_class_data_ |
Definition at line 1249 of file gscip.pb.cc.
|
inlineconstexpr |
Definition at line 144 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 139 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 137 of file gscip.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::GScipParameters_Emphasis_internal_data_ |
Definition at line 481 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_IntParamsEntry_DoNotUse_class_data_ |
Definition at line 639 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_LongParamsEntry_DoNotUse_class_data_ |
Definition at line 737 of file gscip.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::GScipParameters_MetaParamValue_internal_data_ |
Definition at line 487 of file gscip.pb.cc.
|
inlineconstexpr |
Definition at line 182 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 177 of file gscip.pb.h.
|
inlineconstexpr |
Definition at line 175 of file gscip.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_RealParamsEntry_DoNotUse_class_data_ |
Definition at line 835 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipParameters_StringParamsEntry_DoNotUse_class_data_ |
Definition at line 1032 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::GScipSolvingStats_class_data_ |
Definition at line 2157 of file gscip.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::Int128_class_data_ |
Definition at line 195 of file int128.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::IntervalVarAssignment_class_data_ |
Definition at line 821 of file assignment.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::IntVarAssignment_class_data_ |
Definition at line 438 of file assignment.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::IteratedLocalSearchParameters_class_data_ |
Definition at line 4948 of file routing_ils.pb.cc.
|
static |
|
static |
|
static |
|
inlineconstexpr |
Definition at line 24 of file testing_utils.h.
|
inlineconstexpr |
Definition at line 19 of file testing_utils.h.
|
static |
Definition at line 480 of file set_cover_solve.cc.
|
constexpr |
Definition at line 177 of file linear_solver.h.
| const PathDistance operations_research::kDisconnectedPathDistance |
Definition at line 92 of file shortest_paths.h.
|
static |
Definition at line 486 of file set_cover_solve.cc.
|
staticconstexpr |
Definition at line 41 of file set_cover_heuristics.cc.
|
inlineconstexpr |
Definition at line 36 of file glpk_formatters.h.
Definition at line 40 of file set_cover_heuristics.cc.
|
inlineconstexpr |
Definition at line 20 of file testing_utils.h.
|
constexpr |
Definition at line 436 of file linear_solver.cc.
|
static |
Definition at line 435 of file set_cover_solve.cc.
|
inlineconstexpr |
Definition at line 33 of file fp_roundtrip_conv_testing.h.
|
inlineconstexpr |
Definition at line 34 of file fp_roundtrip_conv_testing.h.
|
static |
Definition at line 440 of file set_cover_solve.cc.
|
static |
Definition at line 448 of file set_cover_solve.cc.
|
static |
Definition at line 463 of file set_cover_solve.cc.
|
static |
Definition at line 470 of file set_cover_solve.cc.
|
static |
Definition at line 456 of file set_cover_solve.cc.
| ABSL_CONST_INIT const bool operations_research::kStdToCharsDoubleIsSupported |
Definition at line 107 of file fp_roundtrip_conv.cc.
|
inlineconstexpr |
Definition at line 21 of file testing_utils.h.
|
static |
Definition at line 507 of file routing.cc.
|
static |
Definition at line 475 of file set_cover_solve.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalCheapestInsertionParameters_class_data_ |
Definition at line 348 of file routing_heuristic_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 148 of file routing_heuristic_parameters.pb.h.
|
inlineconstexpr |
Definition at line 143 of file routing_heuristic_parameters.pb.h.
|
inlineconstexpr |
Definition at line 141 of file routing_heuristic_parameters.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::LocalCheapestInsertionParameters_InsertionSortingProperty_internal_data_ |
Definition at line 230 of file routing_heuristic_parameters.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::LocalCheapestInsertionParameters_PairInsertionStrategy_internal_data_ |
Definition at line 224 of file routing_heuristic_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 105 of file routing_heuristic_parameters.pb.h.
|
inlineconstexpr |
Definition at line 100 of file routing_heuristic_parameters.pb.h.
|
inlineconstexpr |
Definition at line 98 of file routing_heuristic_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalSearchMetaheuristic_class_data_ |
Definition at line 345 of file routing_enums.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::LocalSearchMetaheuristic_Value_internal_data_ |
Definition at line 163 of file routing_enums.pb.cc.
|
inlineconstexpr |
Definition at line 166 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 161 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 159 of file routing_enums.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalSearchStatistics_class_data_ |
Definition at line 1775 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalSearchStatistics_FirstSolutionStatistics_class_data_ |
Definition at line 516 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalSearchStatistics_LocalSearchFilterStatistics_class_data_ |
Definition at line 1302 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::LocalSearchStatistics_LocalSearchOperatorStatistics_class_data_ |
Definition at line 836 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MoreNodesPerformedAcceptanceStrategy_class_data_ |
Definition at line 4032 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPAbsConstraint_class_data_ |
Definition at line 3923 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPArrayConstraint_class_data_ |
Definition at line 4227 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPArrayWithConstantConstraint_class_data_ |
Definition at line 4542 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPConstraintProto_class_data_ |
Definition at line 1689 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPGeneralConstraintProto_class_data_ |
Definition at line 2296 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPIndicatorConstraint_class_data_ |
Definition at line 2786 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelDeltaProto_class_data_ |
Definition at line 7390 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelDeltaProto_ConstraintOverridesEntry_DoNotUse_class_data_ |
Definition at line 7218 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelDeltaProto_VariableOverridesEntry_DoNotUse_class_data_ |
Definition at line 7121 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelProto_Annotation_class_data_ |
Definition at line 5553 of file linear_solver.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::MPModelProto_Annotation_TargetType_internal_data_ |
Definition at line 1155 of file linear_solver.pb.cc.
|
inlineconstexpr |
Definition at line 228 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 223 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 221 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelProto_class_data_ |
Definition at line 5979 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPModelRequest_class_data_ |
Definition at line 7770 of file linear_solver.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::MPModelRequest_SolverType_internal_data_ |
Definition at line 1167 of file linear_solver.pb.cc.
|
inlineconstexpr |
Definition at line 310 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 305 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 303 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPQuadraticConstraint_class_data_ |
Definition at line 3500 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPQuadraticObjective_class_data_ |
Definition at line 4883 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPSolution_class_data_ |
Definition at line 8226 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPSolutionResponse_class_data_ |
Definition at line 8838 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPSolveInfo_class_data_ |
Definition at line 8504 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPSolverCommonParameters_class_data_ |
Definition at line 6762 of file linear_solver.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::MPSolverCommonParameters_LPAlgorithmValues_internal_data_ |
Definition at line 1161 of file linear_solver.pb.cc.
|
inlineconstexpr |
Definition at line 262 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 257 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 255 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 349 of file linear_solver.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::MPSolverResponseStatus_internal_data_ |
Definition at line 1173 of file linear_solver.pb.cc.
|
inlineconstexpr |
Definition at line 344 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 342 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPSosConstraint_class_data_ |
Definition at line 3130 of file linear_solver.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::MPSosConstraint_Type_internal_data_ |
Definition at line 1149 of file linear_solver.pb.cc.
|
inlineconstexpr |
Definition at line 195 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 190 of file linear_solver.pb.h.
|
inlineconstexpr |
Definition at line 188 of file linear_solver.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::MPVariableProto_class_data_ |
Definition at line 1291 of file linear_solver.pb.cc.
| operations_research::num_free_elements_[subset] |
Definition at line 196 of file set_cover_invariant.cc.
| operations_research::num_uncovered_elements_ |
Definition at line 187 of file set_cover_invariant.cc.
|
inlineconstexpr |
Definition at line 84 of file optional_boolean.pb.h.
| OR_PROTO_DLL const uint32_t operations_research::OptionalBoolean_internal_data_ |
Definition at line 67 of file optional_boolean.pb.cc.
|
inlineconstexpr |
Definition at line 79 of file optional_boolean.pb.h.
|
inlineconstexpr |
Definition at line 77 of file optional_boolean.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::OptionalDouble_class_data_ |
Definition at line 6488 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::PartialVariableAssignment_class_data_ |
Definition at line 5233 of file linear_solver.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::PerturbationStrategy_class_data_ |
Definition at line 3275 of file routing_ils.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::PerturbationStrategy_Value_internal_data_ |
Definition at line 699 of file routing_ils.pb.cc.
|
inlineconstexpr |
Definition at line 205 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 200 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 198 of file routing_ils.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RandomWalkRuinStrategy_class_data_ |
Definition at line 1037 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RecreateParameters_class_data_ |
Definition at line 2131 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RecreateStrategy_class_data_ |
Definition at line 2466 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RegularLimitParameters_class_data_ |
Definition at line 211 of file search_limit.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::Room_class_data_ |
Definition at line 3451 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RoutingModelParameters_class_data_ |
Definition at line 4180 of file routing_parameters.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RoutingSearchParameters_class_data_ |
Definition at line 2526 of file routing_parameters.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RoutingSearchParameters_ImprovementSearchLimitParameters_class_data_ |
Definition at line 2080 of file routing_parameters.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RoutingSearchParameters_LocalSearchNeighborhoodOperators_class_data_ |
Definition at line 751 of file routing_parameters.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::RoutingSearchParameters_SchedulingSolver_internal_data_ |
Definition at line 657 of file routing_parameters.pb.cc.
|
inlineconstexpr |
Definition at line 110 of file routing_parameters.pb.h.
|
inlineconstexpr |
Definition at line 105 of file routing_parameters.pb.h.
|
inlineconstexpr |
Definition at line 103 of file routing_parameters.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RoutingSearchStatus_class_data_ |
Definition at line 455 of file routing_enums.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::RoutingSearchStatus_Value_internal_data_ |
Definition at line 169 of file routing_enums.pb.cc.
|
inlineconstexpr |
Definition at line 208 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 203 of file routing_enums.pb.h.
|
inlineconstexpr |
Definition at line 201 of file routing_enums.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RuinCompositionStrategy_class_data_ |
Definition at line 2728 of file routing_ils.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::RuinCompositionStrategy_Value_internal_data_ |
Definition at line 693 of file routing_ils.pb.cc.
|
inlineconstexpr |
Definition at line 169 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 164 of file routing_ils.pb.h.
|
inlineconstexpr |
Definition at line 162 of file routing_ils.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RuinRecreateParameters_class_data_ |
Definition at line 2904 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::RuinStrategy_class_data_ |
Definition at line 1683 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SavingsParameters_class_data_ |
Definition at line 635 of file routing_heuristic_parameters.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SearchStatistics_class_data_ |
Definition at line 2941 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SequenceVarAssignment_class_data_ |
Definition at line 1402 of file assignment.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SetCoverProto_class_data_ |
Definition at line 653 of file set_cover.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SetCoverProto_Subset_class_data_ |
Definition at line 339 of file set_cover.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SetCoverSolutionResponse_class_data_ |
Definition at line 1042 of file set_cover.pb.cc.
| OR_PROTO_DLL const uint32_t operations_research::SetCoverSolutionResponse_Status_internal_data_ |
Definition at line 221 of file set_cover.pb.cc.
|
inlineconstexpr |
Definition at line 102 of file set_cover.pb.h.
|
inlineconstexpr |
Definition at line 97 of file set_cover.pb.h.
|
inlineconstexpr |
Definition at line 95 of file set_cover.pb.h.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SimulatedAnnealingAcceptanceStrategy_class_data_ |
Definition at line 3633 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SISRRuinStrategy_class_data_ |
Definition at line 1285 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SpatiallyCloseRoutesRuinStrategy_class_data_ |
Definition at line 794 of file routing_ils.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::Student_class_data_ |
Definition at line 3137 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::StudentAssignment_class_data_ |
Definition at line 1923 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::SubSolverStatistics_class_data_ |
Definition at line 2587 of file search_stats.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::Teacher_class_data_ |
Definition at line 2809 of file course_scheduling.pb.cc.
| OR_PROTO_DLLconst::google::protobuf::internal::ClassDataFull operations_research::WorkerInfo_class_data_ |
Definition at line 1809 of file assignment.pb.cc.
| std::function< int(XPRSprob prob, int(XPRS_CC *f_checktime)(XPRSprob cbprob, void *cbdata), void *p, int priority)> operations_research::XPRSaddcbchecktime = nullptr |
Definition at line 125 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, void(XPRS_CC *f_intsol)(XPRSprob cbprob, void *cbdata), void *p, int priority)> operations_research::XPRSaddcbintsol = nullptr |
Definition at line 121 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, void(XPRS_CC *f_message)(XPRSprob cbprob, void *cbdata, const char *msg, int msglen, int msgtype), void *p, int priority)> operations_research::XPRSaddcbmessage = nullptr |
Definition at line 123 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncols, int ncoefs, const double objcoef[], const int start[], const int rowind[], const double rowcoef[], const double lb[], const double ub[])> operations_research::XPRSaddcols = nullptr |
Definition at line 88 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int length, const double solval[], const int colind[], const char *name)> operations_research::XPRSaddmipsol = nullptr |
Definition at line 106 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int type, const char names[], int first, int last)> operations_research::XPRSaddnames = nullptr |
Definition at line 91 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncols, const int colind[], const double objcoef[], int priority, double weight)> operations_research::XPRSaddobj = nullptr |
Definition at line 89 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int row, int ncoefs, const int rowqcol1[], int const rowqcol2[], const double rowqcoef[])> operations_research::XPRSaddqmatrix64 = nullptr |
Definition at line 90 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, int ncoefs, const char rowtype[], const double rhs[], const double rng[], const int start[], const int colind[], const double rowcoef[])> operations_research::XPRSaddrows = nullptr |
Definition at line 85 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, int ncoefs, const char rowtype[], const double rhs[], const double rng[], const XPRSint64 start[], const int colind[], const double rowcoef[])> operations_research::XPRSaddrows64 = nullptr |
Definition at line 86 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nsets, XPRSint64 nelems, const char settype[], const XPRSint64 start[], const int colind[], const double refval[])> operations_research::XPRSaddsets64 = nullptr |
Definition at line 93 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objidx, const double solution[], double *p_objval)> operations_research::XPRScalcobjn = nullptr |
Definition at line 74 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nbounds, const int colind[], const char bndtype[], const double bndval[])> operations_research::XPRSchgbounds = nullptr |
Definition at line 105 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int row, int col, double coef)> operations_research::XPRSchgcoef = nullptr |
Definition at line 113 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncols, const int colind[], const char coltype[])> operations_research::XPRSchgcoltype = nullptr |
Definition at line 95 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncoefs, const int rowind[], const int colind[], const double rowcoef[])> operations_research::XPRSchgmcoef = nullptr |
Definition at line 114 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, XPRSint64 ncoefs, const int rowind[], const int colind[], const double rowcoef[])> operations_research::XPRSchgmcoef64 = nullptr |
Definition at line 115 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncoefs, const int objqcol1[], const int objqcol2[], const double objqcoef[])> operations_research::XPRSchgmqobj = nullptr |
Definition at line 116 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncols, const int colind[], const double objcoef[])> operations_research::XPRSchgobj = nullptr |
Definition at line 112 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objsense)> operations_research::XPRSchgobjsense = nullptr |
Definition at line 98 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const double rhs[])> operations_research::XPRSchgrhs = nullptr |
Definition at line 117 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const double rng[])> operations_research::XPRSchgrhsrange = nullptr |
Definition at line 118 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const char rowtype[])> operations_research::XPRSchgrowtype = nullptr |
Definition at line 119 of file xpress_environment.cc.
| std::function< int(XPRSprob *p_prob)> operations_research::XPRScreateprob = nullptr |
Definition at line 48 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ncols, const int colind[])> operations_research::XPRSdelcols = nullptr |
Definition at line 94 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objidx)> operations_research::XPRSdelobj = nullptr |
Definition at line 120 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[])> operations_research::XPRSdelrows = nullptr |
Definition at line 87 of file xpress_environment.cc.
| std::function< int(XPRSprob prob)> operations_research::XPRSdestroyprob = nullptr |
Definition at line 49 of file xpress_environment.cc.
| std::function< int(void)> operations_research::XPRSfree = nullptr |
Definition at line 51 of file xpress_environment.cc.
| std::function< int(char *banner)> operations_research::XPRSgetbanner = nullptr |
Definition at line 54 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int rowstat[], int colstat[])> operations_research::XPRSgetbasis = nullptr |
Definition at line 100 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int row, int col, double *p_coef)> operations_research::XPRSgetcoef = nullptr |
Definition at line 81 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, char coltype[], int first, int last)> operations_research::XPRSgetcoltype = nullptr |
Definition at line 104 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *name, int *p_id, int *p_type)> operations_research::XPRSgetcontrolinfo = nullptr |
Definition at line 75 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int attrib, double *p_value)> operations_research::XPRSgetdblattrib = nullptr |
Definition at line 72 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int control, double *p_value)> operations_research::XPRSgetdblcontrol = nullptr |
Definition at line 68 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int *status, double duals[], int first, int last)> operations_research::XPRSgetduals = nullptr |
Definition at line 83 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int attrib, int *p_value)> operations_research::XPRSgetintattrib = nullptr |
Definition at line 70 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int control, int *p_value)> operations_research::XPRSgetintcontrol = nullptr |
Definition at line 66 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int control, XPRSint64 *p_value)> operations_research::XPRSgetintcontrol64 = nullptr |
Definition at line 67 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, char *errmsg)> operations_research::XPRSgetlasterror = nullptr |
Definition at line 99 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, double lb[], int first, int last)> operations_research::XPRSgetlb = nullptr |
Definition at line 79 of file xpress_environment.cc.
| std::function< int(char *buffer, int maxbytes)> operations_research::XPRSgetlicerrmsg = nullptr |
Definition at line 52 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, double x[], double slack[], double duals[], double djs[])> operations_research::XPRSgetlpsol = nullptr |
Definition at line 110 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, double x[], double slack[])> operations_research::XPRSgetmipsol = nullptr |
Definition at line 111 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int type, char names[], int first, int last)> operations_research::XPRSgetnames = nullptr |
Definition at line 92 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, double objcoef[], int first, int last)> operations_research::XPRSgetobj = nullptr |
Definition at line 76 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objidx, int attrib, double *p_value)> operations_research::XPRSgetobjdblattrib = nullptr |
Definition at line 73 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int *status, double djs[], int first, int last)> operations_research::XPRSgetredcosts = nullptr |
Definition at line 84 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, double rhs[], int first, int last)> operations_research::XPRSgetrhs = nullptr |
Definition at line 77 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, double rng[], int first, int last)> operations_research::XPRSgetrhsrange = nullptr |
Definition at line 78 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, char rowtype[], int first, int last)> operations_research::XPRSgetrowtype = nullptr |
Definition at line 103 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int *status, double x[], int first, int last)> operations_research::XPRSgetsolution = nullptr |
Definition at line 82 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int attrib, char *value, int maxbytes, int *p_nbytes)> operations_research::XPRSgetstringattrib = nullptr |
Definition at line 71 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, int control, char *value, int maxbytes, int *p_nbytes)> operations_research::XPRSgetstringcontrol = nullptr |
Definition at line 69 of file xpress_environment.cc.
| OR_DLL std::function< int(XPRSprob prob, double ub[], int first, int last)> operations_research::XPRSgetub = nullptr |
Definition at line 80 of file xpress_environment.cc.
| std::function< int(char *version)> operations_research::XPRSgetversion = nullptr |
Definition at line 55 of file xpress_environment.cc.
| std::function< int(int *p_major, int *p_minor, int *p_build)> operations_research::XPRSgetversionnumbers = nullptr |
Definition at line 56 of file xpress_environment.cc.
| std::function< int(const char *path)> operations_research::XPRSinit = nullptr |
Definition at line 50 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int reason)> operations_research::XPRSinterrupt = nullptr |
Definition at line 59 of file xpress_environment.cc.
| std::function< int(int *p_i, char *p_c)> operations_research::XPRSlicense = nullptr |
Definition at line 53 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const int rowstat[], const int colstat[])> operations_research::XPRSloadbasis = nullptr |
Definition at line 96 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[])> operations_research::XPRSloaddelayedrows = nullptr |
Definition at line 107 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int ndirs, const int colind[], const int priority[], const char dir[], const double uppseudo[], const double downpseudo[])> operations_research::XPRSloaddirs |
Definition at line 109 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *flags)> operations_research::XPRSlpoptimize = nullptr |
Definition at line 127 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *flags)> operations_research::XPRSmipoptimize = nullptr |
Definition at line 128 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *flags, int *solvestatus, int *solstatus)> operations_research::XPRSoptimize = nullptr |
Definition at line 129 of file xpress_environment.cc.
| std::function< int(XPRSprob prob)> operations_research::XPRSpostsolve = nullptr |
Definition at line 97 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int(XPRS_CC *f_checktime)(XPRSprob cbprob, void *cbdata), void *p)> operations_research::XPRSremovecbchecktime = nullptr |
Definition at line 126 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, void(XPRS_CC *f_intsol)(XPRSprob cbprob, void *cbdata), void *p)> operations_research::XPRSremovecbintsol = nullptr |
Definition at line 122 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, void(XPRS_CC *f_message)(XPRSprob cbprob, void *cbdata, const char *msg, int msglen, int msgtype), void *p)> operations_research::XPRSremovecbmessage = nullptr |
Definition at line 124 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *filename)> operations_research::XPRSsaveas = nullptr |
Definition at line 102 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int control, double value)> operations_research::XPRSsetdblcontrol = nullptr |
Definition at line 62 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int control)> operations_research::XPRSsetdefaultcontrol = nullptr |
Definition at line 58 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int nrows, const int rowind[], const int colind[], const int complement[])> operations_research::XPRSsetindicators = nullptr |
Definition at line 108 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int control, int value)> operations_research::XPRSsetintcontrol = nullptr |
Definition at line 60 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int control, XPRSint64 value)> operations_research::XPRSsetintcontrol64 = nullptr |
Definition at line 61 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objidx, int control, double value)> operations_research::XPRSsetobjdblcontrol = nullptr |
Definition at line 65 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int objidx, int control, int value)> operations_research::XPRSsetobjintcontrol = nullptr |
Definition at line 64 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *probname)> operations_research::XPRSsetprobname = nullptr |
Definition at line 57 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, int control, const char *value)> operations_research::XPRSsetstrcontrol = nullptr |
Definition at line 63 of file xpress_environment.cc.
| std::function< int(XPRSprob prob, const char *filename, const char *flags)> operations_research::XPRSwriteprob = nullptr |
Definition at line 101 of file xpress_environment.cc.