[[["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."],[[["`DynamicPermutation` is a class in Or-Tools' optimization library providing functionalities for solving the Traveling Salesperson Problem (TSP) and Vehicle Routing Problem (VRP) using local search optimization methods."],["This class is especially suited for scenarios involving frequent changes to the problem parameters, such as new customers or time windows, allowing for incremental adaptation without restarting the solution process from scratch."]]],["The content defines the `DynamicPermutation` class within a C++ context, likely related to optimization algorithms. It is part of a larger reference document automatically generated. The key information is the existence of this class, found at the given URL, suggesting it's a core component of the library it is a part of. Further details are accessible via the provided link.\n"]]
