Sciweavers

CP
2006
Springer
14 years 2 months ago
Inferring Variable Conflicts for Local Search
Abstract. For efficiency reasons, neighbourhoods in local search are often shrunk by only considering moves modifying variables that actually contribute to the overall penalty. The...
Magnus Ågren, Pierre Flener, Justin Pearson
CSR
2010
Springer
14 years 3 months ago
Frameworks for Logically Classifying Polynomial-Time Optimisation Problems
We show that a logical framework, based around a fragment of existential second-order logic formerly proposed by others so as to capture the class of polynomially-bounded P-optimi...
James Gate, Iain A. Stewart
CP
2005
Springer
14 years 4 months ago
Incremental Algorithms for Local Search from Existential Second-Order Logic
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-consu...
Magnus Ågren, Pierre Flener, Justin Pearson