Mixed-integer linear programming formulations for the software clustering problem

DOI10.1007/s10589-012-9512-9zbMath1273.90128OpenAlexW2050873132MaRDI QIDQ354618

Olinto Araújo, Viviane Köhler, Márcia H. C. Fampa

Publication date: 19 July 2013

Published in: Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10589-012-9512-9

zbMATH Keywords

software clustering problemMILP formulationautomatic clusteringmathematical programming formulationmodule dependency graph

Mathematics Subject Classification ID

Applications of mathematical programming (90C90) Mixed integer programming (90C11) Linear programming (90C05)

Related Items (4)

Column generation approaches for the software clustering problem ⋮ Large neighborhood search applied to the software module clustering problem ⋮ A portfolio optimization approach to design of congested multi‐service networks with application in community healthcare: fractional 0‐1 programming ⋮ Branch-and-cut approaches for \(p\)-cluster editing

Uses Software

• CPLEX
• Bunch

Cites Work

• Unnamed Item
• Graph clustering
• The vehicle routing problem. Latest advances and new challenges.
• A global approach for general \(0-1\) fractional programming
• Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
• Solution of a fractional combinatorial optimization problem by mixed integer programming
• SOFSEM 2006: Theory and Practice of Computer Science

This page was built for publication: Mixed-integer linear programming formulations for the software clustering problem