[[["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."],[[["\u003cp\u003e\u003ccode\u003eLbTreeSearch\u003c/code\u003e is a class within the OR-Tools library used for solving optimization problems, specifically focusing on search strategies for finding optimal solutions using a Linear Bound tree.\u003c/p\u003e\n"],["\u003cp\u003eThis class provides methods and functionalities for guiding the search process, enabling efficient exploration of the solution space for improved performance in combinatorial optimization tasks.\u003c/p\u003e\n"]]],["The documentation describes a C++ class, `LbTreeSearch`, found within the optimization/sat library. This class, detailed in the `LbTreeSearch` reference page, is the sole focus of the provided information. It appears to be a core component for search operations within a tree-like data structure used in optimization problems.\n"],null,["# lb_tree_search\n\nC++ Reference: lb_tree_search\n=============================\n\n\nNote: This documentation is automatically generated.\n\n| Classes ------- ||\n|-------------------------------------------------------------------------|---|\n| [LbTreeSearch](/optimization/reference/sat/lb_tree_search/LbTreeSearch) |"]]
