Home
last modified time | relevance | path

Searched refs:neighbors_ratio (Results 1 – 4 of 4) sorted by relevance

/dports/math/py-or-tools/or-tools-9.2/ortools/constraint_solver/
H A Drouting_search.h386 double neighbors_ratio; member
651 return gci_params_.neighbors_ratio == 1 in GetNeighborsOfNodeForCostClass()
663 MathUtil::FastInt64Round(gci_params_.neighbors_ratio * in NumNeighbors()
866 double neighbors_ratio = 1.0; member
H A Drouting_search.cc736 CHECK_GT(gci_params_.neighbors_ratio, 0); in GlobalCheapestInsertionFilteredHeuristic()
737 CHECK_LE(gci_params_.neighbors_ratio, 1); in GlobalCheapestInsertionFilteredHeuristic()
743 gci_params_.neighbors_ratio = 1; in GlobalCheapestInsertionFilteredHeuristic()
746 if (gci_params_.neighbors_ratio == 1) { in GlobalCheapestInsertionFilteredHeuristic()
754 if (gci_params_.neighbors_ratio == 1 || in ComputeNeighborhoods()
833 return gci_params_.neighbors_ratio == 1 || in IsNeighborForCostClass()
2945 DCHECK_GT(savings_params_.neighbors_ratio, 0); in SavingsFilteredHeuristic()
2946 DCHECK_LE(savings_params_.neighbors_ratio, 1); in SavingsFilteredHeuristic()
3143 std::max(1.0, size * savings_params_.neighbors_ratio); in MaxNumNeighborsPerNode()
H A Drouting_parameters.proto85 // max(min_neighbors, neighbors_ratio * NUM_NON_START_END_NODES)
H A Drouting.cc4570 ls_gci_parameters.neighbors_ratio = in CreateNeighborhoodOperators()
5275 gci_parameters.neighbors_ratio = in CreateFirstSolutionDecisionBuilders()
5343 savings_parameters.neighbors_ratio = in CreateFirstSolutionDecisionBuilders()