Mixed-integer linear programming formulations for the software clustering problem
From MaRDI portal
Publication:354618
DOI10.1007/s10589-012-9512-9zbMath1273.90128MaRDI 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
software clustering problem; MILP formulation; automatic clustering; mathematical programming formulation; module dependency graph
90C90: Applications of mathematical programming
90C11: Mixed integer programming
90C05: Linear programming
Related Items
Column generation approaches for the software clustering problem, Branch-and-cut approaches for \(p\)-cluster editing, Large neighborhood search applied to the software module clustering problem
Uses Software
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