Abstract
AbstractThe combination of exact and heuristic methods is as old as mathematical programming (MP) itself, because usually exact methods cannot work properly without a good bound on the optimal cost, which helps pruning the search space. However, it is only in very recent years that the combination has also gone the other way round, permitting the use of methods originally conceived for exact problem solution also in heuristic frameworks. In this article, we revise the newly identified field of metaheuristics, which refers in particular to algorithms combining metaheuristics with MP techniques and show how current research aims at exploiting MP and metaheuristics synergies.
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.
