Branch-and-price for p-cluster editing

Teobaldo Bulhões (), Anand Subramanian (), Gilberto F. Sousa Filho () and Lucídio dos Anjos F. Cabral ()
Additional contact information
Teobaldo Bulhões: Universidade Federal Fluminense
Anand Subramanian: Universidade Federal da Paraíba
Gilberto F. Sousa Filho: Universidade Federal da Paraíba
Lucídio dos Anjos F. Cabral: Universidade Federal da Paraíba

Computational Optimization and Applications, 2017, vol. 67, issue 2, No 3, 293-316

Abstract: Abstract Given an input graph, the p-cluster editing problem consists of minimizing the number of editions, i.e., additions and/or deletions of edges, so as to create p vertex-disjoint cliques (clusters). In order to solve this $${\mathscr {NP}}$$ NP -hard problem, we propose a branch-and-price algorithm over a set partitioning based formulation with exponential number of variables. We show that this formulation theoretically dominates the best known formulation for the problem. Moreover, we compare the performance of three mathematical formulations for the pricing subproblem, which is strongly $${\mathscr {NP}}$$ NP -hard. A heuristic algorithm is also proposed to speedup the column generation procedure. We report improved bounds for benchmark instances available in the literature.

Keywords: Cluster editing; Column generation; Branch-and-price (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (1)

Downloads: (external link)
http://link.springer.com/10.1007/s10589-017-9893-x Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:coopap:v:67:y:2017:i:2:d:10.1007_s10589-017-9893-x

Ordering information: This journal article can be ordered from
http://www.springer.com/math/journal/10589

DOI: 10.1007/s10589-017-9893-x

Access Statistics for this article

Computational Optimization and Applications is currently edited by William W. Hager

More articles in Computational Optimization and Applications from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().