Ågren, Magnus and Flener, Pierre and Pearson, Justin (2005) Incremental algorithms for local search from existential second-order logic. In: Proceedings of CP'05, 1-5 Oct 2005, Sitges (Barcelona), Spain.
Full text not available from this repository.
Official URL: http://dx.doi.org/10.1007/11564751_7
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.
|Item Type:||Conference or Workshop Item (Paper)|
|Deposited By:||Magnus Å gren|
|Deposited On:||12 Oct 2009|
|Last Modified:||13 Jan 2015 09:42|
Repository Staff Only: item control page