[[["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 RelocateExpensiveChain operator shifts the most costly subchains within a path to a new location, optimizing route efficiency."],["It identifies these expensive subchains by virtually cutting the two most expensive arcs on the path."],["It uses a cost callback function to determine the cost of arcs and subchains."],["This operator is useful in route optimization scenarios for finding better solutions by relocating costly segments."]]],["The `RelocateExpensiveChain` class operator relocates the most expensive subchains within a path. It identifies the most expensive chain by cutting the two costliest arcs on the path. Key methods include `MakeNeighbor` and `MakeOneNeighbor`, which likely facilitate the relocation process. The `RelocateExpensiveChain` method takes arguments including the path variables, secondary variables, a function defining an empty path class, the number of arcs to consider, and a function defining arc costs for the path start. It also provides a `DebugString` method for debugging.\n"]]
