Column generation approaches for the software clustering problem
From MaRDI portal
Publication:301694
DOI10.1007/s10589-015-9822-9zbMath1352.90066OpenAlexW2252531818MaRDI QIDQ301694
François Vanderbeck, Viviane Köhler, Eduardo Uchoa, Hugo Harry Kramer, Márcia H. C. Fampa
Publication date: 1 July 2016
Published in: Computational Optimization and Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10589-015-9822-9
Mixed integer programming (90C11) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57)
Related Items (1)
Uses Software
Cites Work
- Unnamed Item
- Mixed-integer linear programming formulations for the software clustering problem
- Graph clustering
- Branching in branch-and-price: A generic scheme
- Decomposition Principle for Linear Programs
- Solution of a fractional combinatorial optimization problem by mixed integer programming
- A Polynomial Time Algorithm for Rayleigh Ratio on Discrete Variables: Replacing Spectral Techniques for Expander Ratio, Normalized Cut, and Cheeger Constant
- Computational Science - ICCS 2004
This page was built for publication: Column generation approaches for the software clustering problem