Mixed-integer linear programming formulations for the software clustering problem
From MaRDI portal
(Redirected from Publication:354618)
Recommendations
- Complete mixed integer linear programming formulations for modularity density based clustering
- Column generation approaches for the software clustering problem
- Large neighborhood search applied to the software module clustering problem
- scientific article; zbMATH DE number 4189544
- Mixed-integer programming techniques for the minimum sum-of-squares clustering problem
Cites work
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- A global approach for general 0-1 fractional programming
- Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications
- Graph clustering
- SOFSEM 2006: Theory and Practice of Computer Science
- Solution of a fractional combinatorial optimization problem by mixed integer programming
- The vehicle routing problem. Latest advances and new challenges.
Cited in
(5)- General variable neighborhood search for the optimization of software quality
- 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
This page was built for publication: Mixed-integer linear programming formulations for the software clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q354618)
