{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,25]],"date-time":"2026-03-25T06:16:04Z","timestamp":1774419364821,"version":"3.50.1"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T00:00:00Z","timestamp":1485734400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003593","name":"Conselho Nacional de Desenvolvimento Cient\u00edfico e Tecnol\u00f3gico","doi-asserted-by":"publisher","award":["305223\/2015-1"],"award-info":[{"award-number":["305223\/2015-1"]}],"id":[{"id":"10.13039\/501100003593","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2017,6]]},"DOI":"10.1007\/s10589-017-9893-x","type":"journal-article","created":{"date-parts":[[2017,1,30]],"date-time":"2017-01-30T15:51:26Z","timestamp":1485791486000},"page":"293-316","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Branch-and-price for p-cluster editing"],"prefix":"10.1007","volume":"67","author":[{"given":"Teobaldo","family":"Bulh\u00f5es","sequence":"first","affiliation":[]},{"given":"Anand","family":"Subramanian","sequence":"additional","affiliation":[]},{"given":"Gilberto F.","family":"Sousa Filho","sequence":"additional","affiliation":[]},{"given":"Luc\u00eddio dos Anjos F.","family":"Cabral","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,30]]},"reference":[{"issue":"5","key":"9893_CR1","doi-asserted-by":"publisher","first-page":"23:1","DOI":"10.1145\/1411509.1411513","volume":"55","author":"N Ailon","year":"2008","unstructured":"Ailon, N., Charikar, M., Newman, A.: Aggregating inconsistent information: ranking and clustering. J. ACM 55(5), 23:1\u201323:27 (2008)","journal-title":"J. ACM"},{"issue":"2","key":"9893_CR2","doi-asserted-by":"publisher","first-page":"592","DOI":"10.1016\/j.ejor.2006.06.035","volume":"181","author":"B Alidaee","year":"2007","unstructured":"Alidaee, B., Glover, F., Kochenberger, G., Wang, H.: Solving the maximum edge weight clique problem via unconstrained quadratic programming. Eur. J. Oper. Res. 181(2), 592\u2013597 (2007)","journal-title":"Eur. J. Oper. Res."},{"issue":"6769","key":"9893_CR3","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1038\/35000501","volume":"403","author":"AA Alizadeh","year":"2000","unstructured":"Alizadeh, A.A., Eisen, M.B., Davis, R.E., Ma, C., Lossos, I.S., Rosenwald, A., Boldrick, J.C., Sabet, H., Tran, T., Yu, X., Powell, J.I., Yang, L., Marti, G.E., Moore, T., Hudson, J., Lu, L., Lewis, D.B., Tibshirani, R., Sherlock, G., Chan, W.C., Greiner, T.C., Weisenburger, D.D., Armitage, J.O., Warnke, R., Levy, R., Wilson, W., Grever, M.R., Byrd, J.C., Botstein, D., Brown, P.O., Staudt, L.M.: Distinct types of diffuse large B-cell lymphoma identified by gene expression profiling. Nature 403(6769), 503\u2013511 (2000)","journal-title":"Nature"},{"issue":"1","key":"9893_CR4","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1023\/B:MACH.0000033116.57574.95","volume":"56","author":"N Bansal","year":"2004","unstructured":"Bansal, N., Blum, A., Chawla, S.: Correlation clustering. Mach. Learn. 56(1), 89\u2013113 (2004)","journal-title":"Mach. Learn."},{"key":"9893_CR5","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1996","unstructured":"Barnhart, C., Johnson, E.L., Nemhauser, G.L., Savelsbergh, M.W.P., Vance, P.H.: Branch-and-price: column generation for solving huge integer programs. Oper. Res. 46, 316\u2013329 (1996)","journal-title":"Oper. Res."},{"issue":"1","key":"9893_CR6","doi-asserted-by":"publisher","first-page":"347","DOI":"10.1007\/s10878-014-9756-7","volume":"31","author":"L Bastos","year":"2016","unstructured":"Bastos, L., Ochi, L.S., Protti, F., Subramanian, A., Martins, I.C., Pinheiro, R.: Efficient algorithms for cluster editing. J. Comb. Optim. 31(1), 347\u2013371 (2016)","journal-title":"J. Comb. Optim."},{"issue":"3\u20134","key":"9893_CR7","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1089\/106652799318274","volume":"6","author":"A Ben-Dor","year":"1999","unstructured":"Ben-Dor, A., Shamir, R., Yakhini, Z.: Clustering gene expression patterns. J. Comput. Biol. 6(3\u20134), 281\u2013297 (1999)","journal-title":"J. Comput. Biol."},{"issue":"2","key":"9893_CR8","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1287\/ijoc.1030.0029","volume":"16","author":"A Billionnet","year":"2004","unstructured":"Billionnet, A., Soutif, E.: Using a mixed integer programming tool for solving the 0\u20131 quadratic knapsack problem. INFORMS J. Comput. 16(2), 188\u2013197 (2004)","journal-title":"INFORMS J. Comput."},{"key":"9893_CR9","doi-asserted-by":"publisher","unstructured":"B\u00f6cker, S.: A golden ratio parameterized algorithm for cluster editing. In: Iliopoulos C., Smyth W. (eds.) Combinatorial Algorithms. Lecture Notes in Computer Science, vol. 7056, pp. 85\u201395. Springer,Berlin (2011)","DOI":"10.1007\/978-3-642-25011-8_7"},{"key":"9893_CR10","doi-asserted-by":"publisher","unstructured":"B\u00f6cker, S., Baumbach, J.: Cluster editing. In: Bonizzoni P., Brattka V., L\u00f6we B. (eds.) The Nature of Computation. Logic, Algorithms, Applications. Lecture Notes in Computer Science, vol. 7921, pp.33\u201344. Springer, Berlin (2013)","DOI":"10.1007\/978-3-642-39053-1_5"},{"key":"9893_CR11","doi-asserted-by":"crossref","unstructured":"B\u00f6cker, S., Briesemeister, S., Bui, Q., Truss, A.: Goingweighted: parameterized algorithms for cluster editing. In: Yang B., Du D.Z., Wang C. (eds.) CombinatorialOptimization and Applications.Lecture Notes in Computer Science, vol. 5165, pp. 1\u201312. Springer, Berlin (2008)","DOI":"10.1007\/978-3-540-85097-7_1"},{"issue":"2","key":"9893_CR12","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/s00453-009-9339-7","volume":"60","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Briesemeister, S., Klau, G.: Exact algorithms for cluster editing: evaluation and experiments. Algorithmica 60(2), 316\u2013334 (2011)","journal-title":"Algorithmica"},{"issue":"14","key":"9893_CR13","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1016\/j.ipl.2011.05.003","volume":"111","author":"S B\u00f6cker","year":"2011","unstructured":"B\u00f6cker, S., Damaschke, P.: Even faster parameterized cluster deletion and cluster editing. Inf. Process. Lett. 111(14), 717\u2013721 (2011)","journal-title":"Inf. Process. Lett."},{"key":"9893_CR14","doi-asserted-by":"publisher","unstructured":"Bulh\u00f5es, T., Subramanian, A., Sousa\u00a0Filho, G.F., Cabral, L.A.F.:Branch-and-cut approaches for p-cluster editing. Discrete Appl. Math. (2016). doi: 10.1016\/j.dam.2016.10.026 (to appear)","DOI":"10.1016\/j.dam.2016.10.026"},{"issue":"3","key":"9893_CR15","doi-asserted-by":"publisher","first-page":"360","DOI":"10.1016\/j.jcss.2004.10.012","volume":"71","author":"M Charikar","year":"2005","unstructured":"Charikar, M., Guruswami, V., Wirth, A.: Clustering with qualitative information. J. Comput. Syst. Sci. 71(3), 360\u2013383 (2005)","journal-title":"J. Comput. Syst. Sci."},{"key":"9893_CR16","doi-asserted-by":"publisher","DOI":"10.1002\/9781118166000","volume-title":"Applied Integer Programming","author":"DS Chen","year":"2009","unstructured":"Chen, D.S., Batson, R.G., Dang, Y.: Applied Integer Programming. Wiley, New York (2009)"},{"key":"9893_CR17","unstructured":"de\u00a0Henrique Paiva\u00a0Perch\u00e9, M.: Metaheur\u00edsticas h\u00edbridas aplicadas ao problema de edi\u00e7\u00e3o n\u00e3o autom\u00e1tica de clusters. Master\u2019s thesis, Universidade Federal Fluminense - UFF, Brasil (2012) (in Portuguese)"},{"key":"9893_CR18","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/11847250_2","volume":"4169","author":"F Dehne","year":"2006","unstructured":"Dehne, F., Langston, M.A., Luo, X., Pitre, S., Shaw, P., Zhang, Y.: The cluster editing problem: implementations and experiments. Lect. Notes Comput. Sci. 4169, 13\u201324 (2006)","journal-title":"Lect. Notes Comput. Sci."},{"issue":"7","key":"9893_CR19","doi-asserted-by":"publisher","first-page":"1430","DOI":"10.1016\/j.jcss.2014.04.015","volume":"80","author":"FV Fomin","year":"2014","unstructured":"Fomin, F.V., Kratsch, S., Pilipczuk, M., Pilipczuk, M., Villanger, Y.: Tight bounds for parameterized complexity of cluster editing with a small number of clusters. J. Comput. Syst. Sci. 80(7), 1430\u20131447 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"9893_CR20","doi-asserted-by":"publisher","unstructured":"Giotis, I., Guruswami, V.: Correlation clustering with a fixednumber of clusters. In: Proceedings of the Seventeenth AnnualACM-SIAM Symposium on Discrete Algorithm, SODA \u201906, pp. 1167\u20131176.ACM, New York, NY (2006)","DOI":"10.1145\/1109557.1109686"},{"issue":"5439","key":"9893_CR21","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1126\/science.286.5439.531","volume":"286","author":"TR Golub","year":"1999","unstructured":"Golub, T.R., Slonim, D.K., Tamayo, P., Huard, C., Gaasenbeek, M., Mesirov, J.P., Coller, H., Loh, M.L., Downing, J.R., Caligiuri, M.A., Bloomfield, C.D., Lander, E.S.: Molecular classification of cancer: class discovery and class prediction by gene expression monitoring. Science 286(5439), 531\u2013537 (1999)","journal-title":"Science"},{"key":"9893_CR22","doi-asserted-by":"publisher","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Graph-modeleddata clustering: fixed-parameter algorithms for clique generation. In: Petreschi R., Persiano G., Silvestri R. (eds.) Algorithms and Complexity. Lecture Notes in Computer Science, vol. 2653, pp. 108\u2013119. Springer, Berlin (2003)","DOI":"10.1007\/3-540-44849-7_17"},{"issue":"4","key":"9893_CR23","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/s00453-004-1090-5","volume":"39","author":"J Gramm","year":"2004","unstructured":"Gramm, J., Guo, J., H\u00fcffner, F., Niedermeier, R.: Automated generation of search tree algorithms for hard graph modification problems. Algorithmica 39(4), 321\u2013347 (2004)","journal-title":"Algorithmica"},{"issue":"1","key":"9893_CR24","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/BF01589097","volume":"45","author":"M Gr\u00f6tschel","year":"1989","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: A cutting plane algorithm for a clustering problem. Math. Program. 45(1), 59\u201396 (1989)","journal-title":"Math. Program."},{"key":"9893_CR25","doi-asserted-by":"publisher","unstructured":"Guo, J.: A more effective linear kernelization for cluster editing. In: Chen B., Paterson M., Zhang G. (eds.) Combinatorics, Algorithms, Probabilistic and Experimental Methodologies. Lecture Notes in Computer Science, vol. 4614, pp. 36\u201347. Springer, Berlin (2007)","DOI":"10.1007\/978-3-540-74450-4_4"},{"key":"9893_CR26","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations, The IBM Research Symposia Series","author":"R Karp","year":"1972","unstructured":"Karp, R.: Reducibility among combinatorial problems. In: Miller, R., Thatcher, J., Bohlinger, J. (eds.) Complexity of Computer Computations, The IBM Research Symposia Series, pp. 85\u2013103. Springer, New York (1972)"},{"issue":"15","key":"9893_CR27","doi-asserted-by":"publisher","first-page":"2259","DOI":"10.1016\/j.dam.2012.05.019","volume":"160","author":"C Komusiewicz","year":"2012","unstructured":"Komusiewicz, C., Uhlmann, J.: Cluster editing with locally bounded modifications. Discrete Appl. Math. 160(15), 2259\u20132270 (2012)","journal-title":"Discrete Appl. Math."},{"issue":"11","key":"9893_CR28","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24(11), 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"issue":"5","key":"9893_CR29","doi-asserted-by":"publisher","first-page":"623","DOI":"10.1016\/j.dam.2006.08.007","volume":"155","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D.: The quadratic knapsack problem\u2014a survey. Discrete Appl. Math. 155(5), 623\u2013648 (2007)","journal-title":"Discrete Appl. Math."},{"key":"9893_CR30","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/s00224-007-9032-7","volume":"44","author":"F Protti","year":"2009","unstructured":"Protti, F., Silva, M.D., Szwarcfiter, J.: Applying modular decomposition to parameterized cluster editing problems. Theor. Comput. Syst. 44, 91\u2013104 (2009)","journal-title":"Theor. Comput. Syst."},{"key":"9893_CR31","doi-asserted-by":"publisher","unstructured":"Rahmann, S., Wittkop, T., Baumbach, J., Martin, M., Truss, A., B\u00f6cker, S.: Exact and heuristic algorithms for weighted cluster editing. In: Markstein P., Xu Y. (eds.) Computational Systems Bioinformatics: CSB 2007 Conference Proceedings, vol.\u00a06, pp. 391\u2013400. Imp. Coll. Press, 57 Shelton Street, Covent Garden, London WC2H 9HE (2007)","DOI":"10.1142\/9781860948732_0040"},{"key":"9893_CR32","unstructured":"Ryan, D.M., Foster, B.A.: Computer scheduling of public transport: urban passenger vehicle and crew scheduling, chap. An integer programming approach to scheduling, pp. 269\u2013280. North-Holland, Amsterdam (1981)"},{"key":"9893_CR33","doi-asserted-by":"publisher","unstructured":"Shamir, R., Sharan, R., Tsur, D.: Cluster graph modification problems. In: Goos G., Hartmanis J., Leeuwen J., Ku\u010dcera L. (eds.) Graph-Theoretic Concepts in Computer Science. Lecture Notes in Computer Science, vol. 2573, pp. 379\u2013390. Springer, Berlin (2002)","DOI":"10.1007\/3-540-36379-3_33"},{"issue":"1","key":"9893_CR34","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/S0377-2217(02)00852-4","volume":"154","author":"MM S\u00f6rensen","year":"2004","unstructured":"S\u00f6rensen, M.M.: New facets and a branch-and-cut algorithm for the weighted clique problem. Eur. J. Oper. Res. 154(1), 57\u201370 (2004)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9893-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10589-017-9893-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-017-9893-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,17]],"date-time":"2019-09-17T23:26:26Z","timestamp":1568762786000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10589-017-9893-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,1,30]]},"references-count":34,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2017,6]]}},"alternative-id":["9893"],"URL":"https:\/\/doi.org\/10.1007\/s10589-017-9893-x","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,1,30]]}}}