Stay organized with collections
Save and categorize content based on your preferences.
C++ Reference: class LocalSearchFilterManager
Note: This documentation is automatically generated.
Filter manager: when a move is made, filters are executed to decide whether
the solution is feasible and compute parts of the new cost. This class
schedules filter execution and composes costs as a sum.
Returns true iff all filters return true, and the sum of their accepted
objectives is between objective_min and objective_max.
The monitor has its Begin/EndFiltering events triggered.
Builds a manager that calls filter methods using the following ordering:
first Relax() in vector order, then Accept() in vector order.
Note that some filters might appear only once, if their Relax() or Accept()
are trivial.
[[["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 `LocalSearchFilterManager` is a class in C++ that manages the execution of filters during local search."],["Filters are used to determine solution feasibility and calculate costs."],["This class orchestrates filter execution, composing the total cost as the sum of individual filter costs."],["It offers methods for accepting moves, reverting changes, synchronizing filters, and debugging."],["Filters are executed based on an order defined either explicitly or implicitly using Relax and Accept events."]]],[]]