[[["Easy to understand","easyToUnderstand","thumb-up"],["Solved my problem","solvedMyProblem","thumb-up"],["Other","otherUp","thumb-up"]],[["Missing the information I need","missingTheInformationINeed","thumb-down"],["Too complicated / too many steps","tooComplicatedTooManySteps","thumb-down"],["Out of date","outOfDate","thumb-down"],["Samples / code issue","samplesCodeIssue","thumb-down"],["Other","otherDown","thumb-down"]],["Last updated 2024-08-06 UTC."],[[["\u003cp\u003eThe \u003ccode\u003eCheapestAdditionFilteredHeuristic\u003c/code\u003e class in C++ is a decision builder for routing problems.\u003c/p\u003e\n"],["\u003cp\u003eIt extends paths by selecting the cheapest arc from the starting node, using a filtered approach.\u003c/p\u003e\n"],["\u003cp\u003eThis heuristic uses a \u003ccode\u003eLocalSearchFilterManager\u003c/code\u003e for filtering and is part of the OR-Tools constraint solver.\u003c/p\u003e\n"]]],["The `CheapestAdditionFilteredHeuristic` class in C++ is a filtered-base decision builder that uses an addition heuristic. It extends a path from its start by selecting the cheapest arc. Key methods include: `CheapestAdditionFilteredHeuristic`, which takes a `RoutingModel` and `LocalSearchFilterManager` as arguments. The `BuildSolutionInternal` method returns a boolean. The `~CheapestAdditionFilteredHeuristic` is the destructor.\n"],null,[]]
