Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class MakePairActiveOperator
Note: This documentation is automatically generated.
Operator which inserts pairs of inactive nodes into a path.
Possible neighbors for the path 1 -> 2 -> 3 with pair (A, B) inactive
(where 1 and 3 are first and last nodes of the path) are:
1 -> [A] -> [B] -> 2 -> 3
1 -> [B] -> 2 -> [A] -> 3
1 -> [A] -> 2 -> [B] -> 3
1 -> 2 -> [A] -> [B] -> 3
Note that this operator does not expicitely insert the nodes of a pair one
after the other which forbids the following solutions:
1 -> [B] -> [A] -> 2 -> 3
1 -> 2 -> [B] -> [A] -> 3
which can only be obtained by inserting A after B.
[[["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 `MakePairActiveOperator` inserts pairs of inactive nodes into a path, exploring different insertion positions for the pair."],["It avoids inserting nodes of a pair consecutively in reverse order, ensuring specific insertion patterns."],["This operator is used within the constraint solver of or-tools, particularly for routing problems."],["It provides methods for generating neighbor solutions (`MakeNeighbor`) and debugging (`DebugString`)."],["The operator is initialized with node variables, secondary variables, a path class function, and the pairs to be inserted."]]],[]]
