Large neighborhood search applied to the software module clustering problem

DOI10.1016/j.cor.2017.10.004zbMath1391.90526OpenAlexW2761348513MaRDI QIDQ1652543

Marlon C. Monçores, Adriana C. F. Alvim, Márcio O. Barros

Publication date: 11 July 2018

Published in: Computers \& Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.cor.2017.10.004

zbMATH Keywords

large neighborhood searchSBSEsoftware module clustering

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Applications of graph theory (05C90) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27) Distributed systems (68M14)

Uses Software

• Ant
• Bunch

Cites Work

• Column generation approaches for the software clustering problem
• Mixed-integer linear programming formulations for the software clustering problem
• A survey of very large-scale neighborhood search techniques
• A global approach for general \(0-1\) fractional programming
• Cluster analysis and mathematical programming
• Nonparametric tests of differences in medians: Comparison of the Wilcoxon-Mann-Whitney and robust rank-order tests
• Unnamed Item
• Unnamed Item

This page was built for publication: Large neighborhood search applied to the software module clustering problem