Talk:Local search (optimization)
From Wikipedia, the free encyclopedia
Silvery has suggested to change the name of this article into something like Local search (algorithmic technique) or similar to avoid the possible ambiguity with the sense "optimization of local search on the web". While I do not like much the idea that articles on well-established research concepts must take a name or another depending on a newer but more polular concept, I understand that that the new name will be less ambigous. Therefore, I do not oppose to the name change. Paolo Liberatore (Talk) 23:47, 19 October 2005 (UTC)
I removed "approximately" from the line "Examples of problems that can be approximately solved by local search are:". I think it is ment to indicate that local search is sometimes used to find "nearly optimal" solutions but this is not always the case. For boolean satisfiability and TSP it can be used to solve the problem. I'm not sure about vertex covereing but I can find out. The difficulty arises from the fact that local search is used for both optimization and satisfiability. If someone can suggest a better fix, or would like to see a more detailed article, I would be happy to help. Sharp Tac 13:09, 22 November 2006 (UTC)
- I suggest: "Some examples problems where local search [has] [can be] been applied are". This should cover both the case of finding a maximal solution or that to find a solution that is defined as a maximal data satisfying a given property. Tizio 15:34, 22 November 2006 (UTC)
-
- Good idea. Done. Sharp Tac 15:48, 23 November 2006 (UTC)
