AddSeedNodeToQueue(int node, std::vector< StartEndValue > *start_end_distances, SeedQueue *sq) | operations_research::CheapestInsertionFilteredHeuristic | protected |
AppendInsertionPositionsAfter(int64_t node_to_insert, int64_t start, int64_t next_after_start, int vehicle, bool ignore_cost, std::vector< NodeInsertion > *node_insertions) | operations_research::CheapestInsertionFilteredHeuristic | protected |
assignment_ | operations_research::IntVarFilteredHeuristic | protected |
BuildSolution() | operations_research::IntVarFilteredHeuristic | |
BuildSolutionFromRoutes(const std::function< int64_t(int64_t)> &next_accessor) | operations_research::RoutingFilteredHeuristic | |
BuildSolutionInternal() override | operations_research::GlobalCheapestInsertionFilteredHeuristic | virtual |
CheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> penalty_evaluator, LocalSearchFilterManager *filter_manager) | operations_research::CheapestInsertionFilteredHeuristic | |
ComputeStartEndDistanceForVehicles(const std::vector< int > &vehicles) | operations_research::CheapestInsertionFilteredHeuristic | protected |
Contains(int64_t index) const | operations_research::IntVarFilteredHeuristic | inlineprotected |
DebugString() const override | operations_research::GlobalCheapestInsertionFilteredHeuristic | inlinevirtual |
delta_indices() const | operations_research::IntVarFilteredHeuristic | inlineprotected |
Evaluate(bool commit) | operations_research::IntVarFilteredHeuristic | protected |
evaluator_ | operations_research::CheapestInsertionFilteredHeuristic | protected |
GetEndChainStart(int vehicle) const | operations_research::RoutingFilteredHeuristic | inline |
GetInsertionCostForNodeAtPosition(int64_t node_to_insert, int64_t insert_after, int64_t insert_before, int vehicle) const | operations_research::CheapestInsertionFilteredHeuristic | protected |
GetStartChainEnd(int vehicle) const | operations_research::RoutingFilteredHeuristic | inline |
GetUnperformedValue(int64_t node_to_insert) const | operations_research::CheapestInsertionFilteredHeuristic | protected |
GlobalCheapestInsertionFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, std::function< int64_t(int64_t, int64_t, int64_t)> evaluator, std::function< int64_t(int64_t)> penalty_evaluator, LocalSearchFilterManager *filter_manager, GlobalCheapestInsertionParameters parameters) | operations_research::GlobalCheapestInsertionFilteredHeuristic | |
HasSecondaryVars() const | operations_research::IntVarFilteredHeuristic | inlineprotected |
Initialize() | operations_research::IntVarFilteredHeuristic | inlineprotectedvirtual |
InitializeSeedQueue(std::vector< std::vector< StartEndValue > > *start_end_distances_per_node, SeedQueue *sq) | operations_research::CheapestInsertionFilteredHeuristic | protected |
InsertBetween(int64_t node, int64_t predecessor, int64_t successor, int vehicle=-1) | operations_research::CheapestInsertionFilteredHeuristic | protected |
IntVarFilteredHeuristic(Solver *solver, const std::vector< IntVar * > &vars, const std::vector< IntVar * > &secondary_vars, LocalSearchFilterManager *filter_manager) | operations_research::IntVarFilteredHeuristic | |
IsSecondaryVar(int64_t index) const | operations_research::IntVarFilteredHeuristic | inlineprotected |
MakeDisjunctionNodesUnperformed(int64_t node) | operations_research::RoutingFilteredHeuristic | |
MakePartiallyPerformedPairsUnperformed() | operations_research::RoutingFilteredHeuristic | |
MakeUnassignedNodesUnperformed() | operations_research::RoutingFilteredHeuristic | |
model() const | operations_research::RoutingFilteredHeuristic | inline |
number_of_decisions() const | operations_research::IntVarFilteredHeuristic | inline |
number_of_rejects() const | operations_research::IntVarFilteredHeuristic | inline |
penalty_evaluator_ | operations_research::CheapestInsertionFilteredHeuristic | protected |
ResetSolution() | operations_research::IntVarFilteredHeuristic | protected |
RoutingFilteredHeuristic(RoutingModel *model, std::function< bool()> stop_search, LocalSearchFilterManager *filter_manager) | operations_research::RoutingFilteredHeuristic | |
SecondaryVarIndex(int64_t index) const | operations_research::IntVarFilteredHeuristic | inlineprotected |
SetNext(int64_t node, int64_t next, int vehicle) | operations_research::RoutingFilteredHeuristic | inlineprotected |
SetValue(int64_t index, int64_t value) | operations_research::IntVarFilteredHeuristic | inlineprotected |
StopSearch() override | operations_research::RoutingFilteredHeuristic | inlineprotectedvirtual |
SynchronizeFilters() | operations_research::IntVarFilteredHeuristic | protected |
Value(int64_t index) const | operations_research::IntVarFilteredHeuristic | inlineprotected |
Var(int64_t index) const | operations_research::IntVarFilteredHeuristic | inlineprotected |
VehicleIsEmpty(int vehicle) const | operations_research::RoutingFilteredHeuristic | inlineprotected |
~CheapestInsertionFilteredHeuristic() override | operations_research::CheapestInsertionFilteredHeuristic | inline |
~GlobalCheapestInsertionFilteredHeuristic() override | operations_research::GlobalCheapestInsertionFilteredHeuristic | inline |
~IntVarFilteredHeuristic() | operations_research::IntVarFilteredHeuristic | inlinevirtual |
~RoutingFilteredHeuristic() override | operations_research::RoutingFilteredHeuristic | inline |