Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consuming and error-prone implementation tasks. We introduce a scheme that, from a high-level description of a constraint in existential second-order logic with counting, automatically synthesises incremental penalty calculation algorithms. The performance of the scheme is demonstrated by solving real-life instances of a financial portfolio design problem that seem unsolvable in reasonable time by complete search. © Springer-Verlag Berlin Heidelberg 2005.
CITATION STYLE
Ågren, M., Flener, P., & Pearson, J. (2005). Incremental algorithms for local search from existential second-order logic. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3709 LNCS, pp. 47–61). Springer Verlag. https://doi.org/10.1007/11564751_7
Mendeley helps you to discover research relevant for your work.