Paper Info
Title
Incremental Algorithms for Local Search from Existential Second-Order Logic
Abstract
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.
Year
DOI
Venue
2005
10.1007/11564751_7
LECTURE NOTES IN COMPUTER SCIENCE
Keywords
Field
DocType
local search,computer science,second order
Incremental heuristic search,Search algorithm,Existentialism,Second-order logic,Project portfolio management,Computer science,Algorithm,Constraint satisfaction problem,Portfolio,Artificial intelligence,Local search (optimization)
Conference
Volume
ISSN
Citations 
3709
0302-9743
5
PageRank 
References 
Authors
0.66
7
3
Name
Order
Citations
PageRank
Magnus Ågren1728.03
Pierre Flener253350.28
Justin Pearson323724.28