Talk:Combinatorial optimization

From Wikipedia, the free encyclopedia

"Combinatorial optimization algorithms are often implemented in an efficient imperative programming language, in an expressive declarative programming language such as Prolog, or some compromise, perhaps a functional programming language such as Haskell, or a multi-paradigm language such as LISP." - What it actually says: "Combinatorial optimization algorithms are usually implemented in some kind of programming language." -What's the point?

constantin

I found the listing of programs and their classifications helpful and useful.

mrxe

agree with constantin; that paragraph says nothing

tom

I also agree with constantin, and I think that information about implementation would be better located towards the end of the article, as seems to be the style for most algorithm articles in Wikipedia. Davidcoffin 09:44, 18 January 2007 (UTC)

[edit] Metropolis and Hill-Climbing Cross References Needed

Besides mention of simulating annealing, the Metropolis algorithm (to be found in Wikipedia, not by "Metropolis" but by "Metropolis-Hastings") should very definitely be referenced or cross-referenced here. More generally, Hill-Climbing should be referenced. And in Hill-Climbing entry, I don't see "probabilistic hill-climbing".
Probabilistic hill-climbing is a counter-intuitive notion. Well, after a while (like when everybody see a unicorn -- so what), the notion seems less counter-intuitive, but in each step you have some chance (probability) of going towards a "worse" configuration -- and in that way you (most likely) avoid getting stuck in local optimum as opposed to global optimum. This central notion should be part of combinatorial optimization entry.199.196.144.11 19:34, 21 March 2007 (UTC)