{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:04:43Z","timestamp":1777597483122,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,10,4]],"date-time":"2012-10-04T00:00:00Z","timestamp":1349308800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2013,5]]},"DOI":"10.1007\/s10589-012-9512-9","type":"journal-article","created":{"date-parts":[[2012,10,3]],"date-time":"2012-10-03T15:55:01Z","timestamp":1349279701000},"page":"113-135","source":"Crossref","is-referenced-by-count":13,"title":["Mixed-Integer Linear Programming Formulations for the Software Clustering Problem"],"prefix":"10.1007","volume":"55","author":[{"given":"Viviane","family":"K\u00f6hler","sequence":"first","affiliation":[]},{"given":"Marcia","family":"Fampa","sequence":"additional","affiliation":[]},{"given":"Olinto","family":"Ara\u00fajo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,10,4]]},"reference":[{"key":"9512_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1051\/ro:2006013","volume":"40","author":"A. Billionnet","year":"2006","unstructured":"Billionnet, A., Djebali, K.: R\u00e9solution d\u2019un probl\u00e8me combinatoire fractionnaire par la programmation linaire mixte. RAIRO. Rech. Op\u00e9r. 40, 97\u2013111 (2006)","journal-title":"RAIRO. Rech. Op\u00e9r."},{"issue":"1","key":"9512_CR2","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1007\/s10878-005-5485-2","volume":"9","author":"D.Z. Chen","year":"2005","unstructured":"Chen, D.Z., Daescu, O., Dai, Y., Katoh, N., Wu, X., Xu, J.: Efficient algorithms and implementations for optimizing the sum of linear fractional functions, with applications. J. Comb. Optim. 9(1), 69\u201390 (2005)","journal-title":"J. Comb. Optim."},{"key":"9512_CR3","first-page":"73","volume-title":"Proceedings of 1999 IEEE International Conference on Software Tools and Engineering Practice (STEP\u201999)","author":"D. Doval","year":"1999","unstructured":"Doval, D., Mancoridis, S., Mitchell, B.S.: Automatic clustering of software systems using a genetic algorithm. In: Proceedings of 1999 IEEE International Conference on Software Tools and Engineering Practice (STEP\u201999), Pittsburgh, PA, pp. 73\u201381 (1999)"},{"key":"9512_CR4","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, New York (1979)"},{"key":"9512_CR5","volume-title":"IBM ILOG CPLEX, User\u2019s Manual for CPLEX v12.1","author":"D.M. Gay","year":"2009","unstructured":"Gay, D.M.: In: IBM ILOG CPLEX, User\u2019s Manual for CPLEX v12.1 (2009)"},{"key":"9512_CR6","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-77778-8","volume-title":"The Vehicle Routing Problem. Latest Advances and New Challenges","author":"B. Golden","year":"2008","unstructured":"Golden, B., Raghvan, S., Wasil, E.: The Vehicle Routing Problem. Latest Advances and New Challenges. Springer, Berlin (2008)"},{"key":"9512_CR7","doi-asserted-by":"crossref","first-page":"590","DOI":"10.1016\/0377-2217(94)90257-7","volume":"73","author":"H. Li","year":"1994","unstructured":"Li, H.: A global approach for general 0\u20131 fractional programming. Eur. J. Oper. Res. 73, 590\u2013596 (1994)","journal-title":"Eur. J. Oper. Res."},{"key":"9512_CR8","volume-title":"Proceedings of 2009 IEEE International Conference on Computer and Information Technology (CIT 2009)","author":"A.S. Mamaghani","year":"2009","unstructured":"Mamaghani, A.S., Meybodi, M.R.: Clustering of software systems using new hybrid algorithms. In: Proceedings of 2009 IEEE International Conference on Computer and Information Technology (CIT 2009), Xiamen, China October, 20\u201325 (2009)"},{"key":"9512_CR9","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/ICSM.1999.792498","volume-title":"Proceedings of 1999 IEEE of International Conference on Software Maintenance (ICSM\u201999)","author":"S. Mancoridis","year":"1999","unstructured":"Mancoridis, S., Mitchell, B.S., Chen, Y., Gansner, E.R.: Bunch: A clustering tool for the recovery and maintenance of software system structures. In: Proceedings of 1999 IEEE of International Conference on Software Maintenance (ICSM\u201999), Oxford, pp. 50\u201359 (1999)"},{"key":"9512_CR10","volume-title":"Symmetry in Integer Linear Programming, 50 Years of Integer Programming","author":"F. Margot","year":"2009","unstructured":"Margot, F.: Symmetry in Integer Linear Programming, 50 Years of Integer Programming. Springer, Berlin (2009)"},{"key":"9512_CR11","unstructured":"Mitchell, B.S.: A heuristic search approach to solving the software clustering problem. Ph.D Thesis, Drexel University, Philadelphia (2002)"},{"issue":"1","key":"9512_CR12","first-page":"127","volume":"37","author":"S. Parsa","year":"2005","unstructured":"Parsa, S., Bushehrian, O.: A new encoding scheme and a framework to investigate genetic clustering algorithms. J. Res. Pract. Inf. Technol. 37(1), 127\u2013143 (2005)","journal-title":"J. Res. Pract. Inf. Technol."},{"issue":"2","key":"9512_CR13","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1109\/TSE.2010.26","volume":"37","author":"K. Praditwong","year":"2011","unstructured":"Praditwong, K., Harman, M., Yao, X.: Software module clustering as a Multi-Objective search problem. IEEE Trans. Softw. Eng. 37(2), 264\u2013282 (2011)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"9512_CR14","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.cosrev.2007.05.001","volume":"1","author":"S.E. Schaeffer","year":"2007","unstructured":"Schaeffer, S.E.: Graph clustering. Comput. Sci. Rev. 1(1), 27\u201364 (2007). doi: 10.1016\/j.cosrev.2007.05.001","journal-title":"Comput. Sci. Rev."},{"key":"9512_CR15","series-title":"Lecture Notes in Computer Science","volume-title":"Proceedings of the Thirtysecond International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM","author":"J. S\u00edma","year":"2006","unstructured":"S\u00edma, J., Schaeffer, S.E.: On the NP-completeness of Some Graph Cluster Measures. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., Stuller, J. (eds.): Proceedings of the Thirtysecond International Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM. Lecture Notes in Computer Science, vol. 3831. Springer, Berlin (2006)"}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9512-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-012-9512-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-012-9512-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T11:36:43Z","timestamp":1559302603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-012-9512-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,10,4]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,5]]}},"alternative-id":["9512"],"URL":"https:\/\/doi.org\/10.1007\/s10589-012-9512-9","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,10,4]]}}}