Abstract
Combinatorial search problems are ubiquitous in numerous applications areas. This tutorial reviews some fundamental techniques from artificial intelligence, numerical analysis, and operations research to solve both discrete and continuous combinatorial problems. For discrete problems, we consider techniques such as branch and relax, branch and cut, and local search. For continuous problems, we consider techniques such as quasi-Newton methods, continuation methods, and interval methods. Our main goal is to give an informal understanding and intuition about these techniques and to review some constraint programming tools supporting them.KeywordsLocal SearchConstraint Satisfaction ProblemPolynomial SystemContinuation MethodSimplex AlgorithmThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
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.
