Abstract
This paper presents Tree Local Search (TLS), a generic algorithm that hybridizes tree and local search methods. It has the following properties : it can filter all its instantiations and allows to freely select the variable whose value changes in case of failure. The primitive version of TLS can be regarded as a Hill-Climbing method that handles filtered instantiations. An extended version generalizes the Backtracking and Min-Conflicts algorithms.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
