This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision Next revision Both sides next revision | ||
|
teaching:mfe:ia [2011/03/08 17:08] stuetzle [Evolution of Cooperation] |
teaching:mfe:ia [2011/03/08 17:27] stuetzle |
||
|---|---|---|---|
| Line 152: | Line 152: | ||
| * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | * [[http://iridia.ulb.ac.be/~manuel|Manuel López-Ibáñez (IRIDIA)]] | ||
| + | |||
| + | |||
| + | ===== Stochastic local search algorithms for weighted maximum clique problems. ====== | ||
| + | |||
| + | The Maximum Clique Problem is an NP-hard combinatorial optimisation problem that asks to find the biggest completely | ||
| + | connected component of a graph. It has relevant applications in information retrieval, computer vision, social network | ||
| + | analysis, computational biochemistry, bioinformatics and genomics. | ||
| + | |||
| + | Among the possible generalisations of the problem there is the Vertex Weighted and Edge Weighted Maximum Clique which asks to find the clique of maximum weight. Being generalisations they are also NP-hard. The goal of the project is to devise heuristic algorithms or adapt existing algorithms of the Maximum Clique for weighted version. | ||
| + | |||
| + | Required skills: good knowledge of C or C++ programming. | ||
| + | |||
| + | |||
| + | * Contacts : | ||
| + | * [[http://iridia.ulb.ac.be/~stuetzle|Thomas Stuetzle (IRIDIA)]] | ||
| + | * [[http://iridia.ulb.ac.be/~fmascia|Franco Mascia (IRIDIA)]] | ||
| + | |||
| /* | /* | ||