An efficient iterated local search for the minimum quasi-clique partitioning problem
Year of publication: |
2025
|
---|---|
Authors: | Zhou, Qing ; Zhu, Tongtong ; Wu, Qinghua ; Jiang, Zhong-Zhong ; Wang, Wenjie |
Published in: |
Computers & operations research : an international journal. - Amsterdam [u.a.] : Elsevier, ISSN 0305-0548, ZDB-ID 1499736-8. - Vol. 179.2025, Art.-No. 107033, p. 1-22
|
Subject: | Clique partitioning | Iterated local search | Metaheuristic | Quasi-clique | Two-phase local search | Mathematische Optimierung | Mathematical programming | Theorie | Theory | Heuristik | Heuristics |
-
An iterated local search metaheuristic for the capacitated demand-driven timetabling problem
Schettini, Tommaso, (2023)
-
A iterated local search algorithm for the vehicle routing problem with backhauls
Cuervo, Daniel Palhazi, (2014)
-
A lean optimization algorithm for water distribution network design optimization
De Corte, Annelies, (2015)
- More ...
-
An effective hybrid search method for the quadratic knapsack problem with conflict graphs
Zhou, Qing, (2024)
-
Adaptive feasible and infeasible evolutionary search for the knapsack problem with forfeits
Zhou, Qing, (2025)
-
Heuristic search to the capacitated clustering problem
Zhou, Qing, (2019)
- More ...