Abstract
AbstractGiven an undirected graph, a clique is a subset of vertices in which the induced subgraph is complete; that is, all pairs of vertices of this subset are adjacent. Clique problems in graphs are very important due to their numerous applications. One of these problems is the clique partitioning problem (CPP), which consists of dividing the set of vertices of a graph into the smallest number of cliques possible. The CPP is an NP-hard problem with many application fields (timetabling, manufacturing, scheduling, telecommunications, etc.). Despite its great applicability, few recent studies have focused on proposing specific resolution methods for the CPP. This article presents a resolution method that combines multistart strategies with tabu search. The most novel characteristic of our method is that it allows unfeasible solutions to be visited, which facilitates exploration of the solution space. The computational tests show that our method performs better than previous methods proposed for this problem. In fact, our method strictly improves the results of these methods in most of the instances considered while requiring less computation time.
Funder
Agencia Estatal de Investigación
Consejería de Educación, Junta de Castilla y León
Publisher
Springer Science and Business Media LLC
Reference22 articles.
1. Allignol C, Barnier N, Gondran A (2012) Optimized flight level allocation at the continental scale. In: 5th international conference for research in air transportation, May 2012, Berkeley
2. Bhasker J, Samad T (1991) The clique-partitioning problem. Comput Math Appl 22(6):1–11
3. Blatt M, Wiseman S, Domany E (1996) Superparamagnetic clustering of data. Phys Rev Lett 76(18):3251–3254
4. Casado S, Laguna M, Pacheco J, Puche JC (2020) Grouping products for the optimization of production processes: a case in the steel manufacturing industry. Eur J Oper Res 286(1):190–202
5. Chen Z, Yuan L, Lin X, Qin L, Yang J (2020) Efficient maximal balanced clique enumeration in signed networks. In: Proceedings of The Web Conference 2020, pp 339–349
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献