[[["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."],[[["The `CheapestInsertionFilteredHeuristic` class is part of the Google OR-Tools constraint solver and facilitates finding solutions for routing problems."],["It utilizes a user-defined evaluator function and a penalty evaluator function to guide the solution search process."],["The constructor takes ownership of the evaluator function and optionally incorporates a filter manager for local search optimization."],["This heuristic employs a 'cheapest insertion' approach, strategically inserting nodes into the solution based on cost considerations."]]],["The `CheapestInsertionFilteredHeuristic` class in C++ is documented, detailing its constructor and destructor. The constructor, `CheapestInsertionFilteredHeuristic`, accepts a `RoutingModel`, an `evaluator` function, a `penalty_evaluator` function, and a `LocalSearchFilterManager`. It takes ownership of the `evaluator`. The destructor, `~CheapestInsertionFilteredHeuristic`, is also documented, though no specific actions are noted. The class appears related to routing optimization and local search filtering.\n"]]
