Output details
11 - Computer Science and Informatics
University of Stirling
Article title
Breakout Local Search for maximum clique problems
Type
D - Journal article
Title of journal
Computers & Operations Research
Article number
-
Volume number
40
Issue number
1
First page of article
192
ISSN of journal
03050548
Year of publication
2013
URL
-
Number of additional authors
1
Additional information
<22> This paper represents ground breaking work at the interface of Operational Research and Computer Science. It presents a new variant of Iterated Local Search named Breakout Local Search for maximum clique problems. The methodology focuses on the perturbation phase, using an adaptive and multi-type perturbation mechanism to introduce a suitable degree of diversification. The success of this methodology on maximum clique has led to its application to other NP-hard problems. Another major contribution of this paper is a detailed landscape analysis which justifies the impact of different diversification degrees on different landscapes.
Interdisciplinary
-
Cross-referral requested
-
Research group
None
Citation count
5
Proposed double-weighted
No
Double-weighted statement
-
Reserve for a double-weighted output
No
Non-English
No
English abstract
-
