Abstract
Recently, Intelligent Backtracking can be defined as a method used in constrained programming to minimize search results in the resolution of combinatorial problems. The technology utilizes information from limited collections of infeasible restrictions in one search area to discourage searching in other related areas. It will substantially reduce the search space. However, the computing work needed to reduce the search area for many issues. In this research, an Artificial Intelligence-based Branch and Cut Algorithm has been proposed, which uses an intelligent tracking system based on Constraint programming. This proposed framework displays an extreme dual ray associated with an unfeasible linear program to automatically deduce minimum infeasible settings. Furthermore, it has reduced space for intelligent monitoring without paying high processing costs. The experimental results demonstrate that the realization of the proposed intellectual monitoring paradigm.
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.
