{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T01:09:04Z","timestamp":1777597744544,"version":"3.51.4"},"reference-count":37,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,2,18]],"date-time":"2014-02-18T00:00:00Z","timestamp":1392681600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Glob Optim"],"published-print":{"date-parts":[[2014,10]]},"DOI":"10.1007\/s10898-014-0149-3","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T16:40:39Z","timestamp":1392655239000},"page":"165-182","source":"Crossref","is-referenced-by-count":7,"title":["Column generation bounds for numerical microaggregation"],"prefix":"10.1007","volume":"60","author":[{"given":"Daniel","family":"Aloise","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pierre","family":"Hansen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Caroline","family":"Rocha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"\u00c9verton","family":"Santi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,2,18]]},"reference":[{"key":"149_CR1","unstructured":"Aggarwal, G., Feder, T., Kenthapadi, K., Motwani, R., Panigrahy, R., Thomas, D., Zhu., A.: Approximation algorithms for $$k$$ k -anonymity. J. Privacy Tech. (2005)."},{"key":"149_CR2","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1007\/s10898-010-9571-3","volume":"49","author":"D Aloise","year":"2011","unstructured":"Aloise, D., Hansen, P.: Evaluating a branch-and-bound RLT-based algorithm for minimum sum-of-squares clustering. J. Glob. Optim. 49, 449\u2013465 (2011)","journal-title":"J. Glob. Optim."},{"key":"149_CR3","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10107-010-0349-7","volume":"131","author":"D Aloise","year":"2012","unstructured":"Aloise, D., Hansen, P., Liberti, L.: An improved column generation algorithm for minimum sum-of-squares clustering. Math. Program. 131, 195\u2013220 (2012)","journal-title":"Math. Program."},{"key":"149_CR4","volume-title":"BONMIN user\u2019s manual","author":"P Bonami","year":"2007","unstructured":"Bonami, P., Lee, J.: BONMIN user\u2019s manual. IBM Corporation, Tech. rep., New York (2007)"},{"key":"149_CR5","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex optimization. Cambridge University Press, Cambridge (2004)"},{"key":"149_CR6","doi-asserted-by":"crossref","first-page":"1866","DOI":"10.1016\/j.jss.2007.02.014","volume":"80","author":"CC Chang","year":"2007","unstructured":"Chang, C.C., Li, Y.C., Huang, W.H.: TRFP: An efficient microaggregation algorithm for statistical disclosure control. J. Syst. Softw. 80, 1866\u20131878 (2007)","journal-title":"J. Syst. Softw."},{"key":"149_CR7","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1109\/69.979982","volume":"14","author":"J Domingo-Ferrer","year":"2002","unstructured":"Domingo-Ferrer, J., Mateo-Sanz, J.M.: Practical data-oriented microaggregation for statistical disclosure control. IEEE Trans. Knowl. Data Eng. 14, 189\u2013201 (2002)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"149_CR8","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/s10618-005-0007-5","volume":"11","author":"J Domingo-Ferrer","year":"2005","unstructured":"Domingo-Ferrer, J., Torra, V.: Ordinal continuous and heterogeneous $$k$$ k -anonymity through microaggregation. Data Min. Knowl. Discov. 11, 195\u2013212 (2005)","journal-title":"Data Min. Knowl. Discov."},{"key":"149_CR9","doi-asserted-by":"crossref","first-page":"355","DOI":"10.1007\/s00778-006-0007-0","volume":"15","author":"J Domingo-Ferrer","year":"2006","unstructured":"Domingo-Ferrer, J., Mart\u00ednez-Ballest\u00e9, A., Mateo-Sanz, J., Seb\u00e9, F.: Efficient multivariate data-oriented microaggregation. VLDB J. 15, 355\u2013369 (2006)","journal-title":"VLDB J."},{"key":"149_CR10","doi-asserted-by":"crossref","first-page":"714","DOI":"10.1016\/j.camwa.2007.04.034","volume":"55","author":"J Domingo-Ferrer","year":"2008","unstructured":"Domingo-Ferrer, J., Seb\u00e9, F., Solanas, A.: A polynomial-time approximation to optimal multivariate microaggregation. Comput. Math. Appl. 55, 714\u2013732 (2008)","journal-title":"Comput. Math. Appl."},{"key":"149_CR11","doi-asserted-by":"crossref","first-page":"1485","DOI":"10.1137\/S1064827597328327","volume":"21","author":"O Merle du","year":"2000","unstructured":"du Merle, O., Hansen, P., Jaumard, B., Mladenovi\u0107, N.: An interior point algorithm for minimum sum-of-squares clustering. SIAM J. Sci. Comput. 21, 1485\u20131505 (2000)","journal-title":"SIAM J. Sci. Comput."},{"key":"149_CR12","doi-asserted-by":"crossref","first-page":"632","DOI":"10.1287\/opre.1050.0222","volume":"53","author":"I Elhallaoui","year":"2005","unstructured":"Elhallaoui, I., Villeneuve, D., Soumis, F., Desaulniers, G.: Dynamic aggregation of set-partitioning constraints in column generation. Oper. Res. 53, 632\u2013645 (2005)","journal-title":"Oper. Res."},{"key":"149_CR13","unstructured":"Goffin, J.L., Haurie, A., Vial, J.-P.: Decomposition and nondifferentiable optimization with the projective algorithm. Manag. Sci. 38, 284\u2013302 (1992)"},{"key":"149_CR14","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01580870","volume":"47","author":"M Gr\u00f6tschel","year":"1990","unstructured":"Gr\u00f6tschel, M., Wakabayashi, Y.: Facets of the clique partitioning polytope. Math. Program. 47, 367\u2013387 (1990)","journal-title":"Math. Program."},{"key":"149_CR15","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/S0377-2217(00)00100-4","volume":"130","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search: principles and applications. Eur. J. Oper. Res. 130, 449\u2013467 (2001)","journal-title":"Eur. J. Oper. Res."},{"key":"149_CR16","first-page":"319","volume":"4OR6","author":"P Hansen","year":"2008","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.: Variable neighborhood search. Methods Appl. 4OR6, 319\u2013360 (2008)","journal-title":"Methods Appl."},{"key":"149_CR17","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1109\/TKDE.2003.1209020","volume":"15","author":"S Hansen","year":"2003","unstructured":"Hansen, S., Mukherjee, S.: A polynomial algorithm for optimal univariate microaggregation. IEEE Trans. Knowl. Data Eng. 15, 1043\u20131044 (2003)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"149_CR18","doi-asserted-by":"crossref","unstructured":"Heinz, G., Peterson, L., Johnson, R., Kerk, C.: Exploring relationships in body dimensions. J. Stat. Educ. 11. www.amstat.org\/publications\/jse\/v11n2\/datasets.heinz.html (2003)","DOI":"10.1080\/10691898.2003.11910711"},{"key":"149_CR19","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/j.disopt.2006.10.009","volume":"4","author":"X Ji","year":"2007","unstructured":"Ji, X., Mitchell, J.E.: Branch-and-price-and-cut on the clique partitioning problem with minimum clique size requirement. Discret. Optim. 4, 87\u2013102 (2007)","journal-title":"Discret. Optim."},{"key":"149_CR20","doi-asserted-by":"crossref","unstructured":"Kabir, E., Wang, H., Zhang, Y.: A pairwise-systematic microaggregation for statistical disclosure control. In: 2010 IEEE 10th International Conference on Data Mining (ICDM), pp. 266\u2013273 (2010)","DOI":"10.1109\/ICDM.2010.111"},{"key":"149_CR21","doi-asserted-by":"crossref","first-page":"908","DOI":"10.1109\/T-C.1975.224336","volume":"C\u201324","author":"W Koontz","year":"1975","unstructured":"Koontz, W., Narendra, P., Fukunaga, K.: A branch and bound clustering algorithm. IEEE Trans. Comput. C\u201324, 908\u2013915 (1975)","journal-title":"IEEE Trans. Comput."},{"key":"149_CR22","doi-asserted-by":"crossref","first-page":"902","DOI":"10.1109\/TKDE.2005.112","volume":"17","author":"M Laszlo","year":"2005","unstructured":"Laszlo, M., Mukherjee, S.: Minimum spanning tree partitioning algorithm for microaggregation. IEEE Trans. Knowl. Data Eng. 17, 902\u2013911 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"1","key":"149_CR23","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1051\/ro\/2009005","volume":"43","author":"L Liberti","year":"2009","unstructured":"Liberti, L.: Reformulations in mathematical programming: definitions and systematics. RAIRO-RO 43(1), 55\u201386 (2009)","journal-title":"RAIRO-RO"},{"key":"149_CR24","doi-asserted-by":"crossref","first-page":"3256","DOI":"10.1016\/j.eswa.2009.09.054","volume":"37","author":"JL Lin","year":"2010","unstructured":"Lin, J.L., Hsieh, T.H., Chang, J.C.: Density-based microaggregation for statistical disclosure control. Expert Syst. Appl. 37, 3256\u20133263 (2010)","journal-title":"Expert Syst. Appl."},{"key":"149_CR25","doi-asserted-by":"crossref","first-page":"389","DOI":"10.1287\/opre.23.3.389","volume":"23","author":"R Marsten","year":"1975","unstructured":"Marsten, R., Hogan, W., Blankenship, J.: The boxstep method for large-scale optimization. Oper. Res. 23, 389\u2013405 (1975)","journal-title":"Oper. Res."},{"key":"149_CR26","first-page":"345","volume":"18","author":"A Oganian","year":"2001","unstructured":"Oganian, A., Domingo-Ferrer, J.: On the complexity of optimal microaggregation for statistical disclosure control. Stat. J. United Nat. Econ. Com. Eur. 18, 345\u2013354 (2001)","journal-title":"Stat. J. United Nat. Econ. Com. Eur."},{"key":"149_CR27","doi-asserted-by":"crossref","unstructured":"Panagiotakis, C., Tziritas, G.: Sucessive group selection for microaggregation. IEEE Trans. Knowl. Data Eng. 25, 1191\u20131195 (2012)","DOI":"10.1109\/TKDE.2011.242"},{"key":"149_CR28","doi-asserted-by":"crossref","first-page":"892","DOI":"10.1016\/j.datak.2011.06.005","volume":"70","author":"D Rebollo-Monedero","year":"2011","unstructured":"Rebollo-Monedero, D., Forn\u00e9, J., Soriano, M.: An algorithm for $$k$$ k -anonymous microaggregation and clustering inspired by the design of distortion-optimized quantizers. Data Knowl. Eng. 70, 892\u2013921 (2011)","journal-title":"Data Knowl. Eng."},{"key":"149_CR29","doi-asserted-by":"crossref","unstructured":"Rocha Neto, A., Barreto, G.: On the application of ensembles of classifiers to the diagnosis of pathologies of the vertebral column: A comparative analysis. IEEE Lat. Am. Trans. 7, 487\u2013496 (2009)","DOI":"10.1109\/TLA.2009.5349049"},{"key":"149_CR30","unstructured":"Ryan, D., Foster, B.: An integer programming approach to scheduling. In: A. Wren (ed.) Computer Scheduling of Public Transport Urban Passenger Vehicle and Crew Scheduling, pp. 269\u2013280. North-Holland (1981)"},{"key":"149_CR31","first-page":"525","volume":"5768","author":"A Solanas","year":"2009","unstructured":"Solanas, A., Gavalda, A., Rallo, R.: Micro-som: a linear-time multivariate microaggregation algorithm based on self-organizing maps. LNCS 5768, 525\u2013535 (2009)","journal-title":"LNCS"},{"key":"149_CR32","unstructured":"Solanas, A., Martinez-Balleste, A., Domingo-Ferrer, J.: V-MDAV: A multivariate microaggregation with variable group size. In: 17th COMPSTAT Symposium of the IASC (2006)"},{"key":"149_CR33","doi-asserted-by":"crossref","unstructured":"Solanas, A., Mart\u00ednez-Ballest\u00e9, A., Domingo-Ferrer, J., Mateo-Sanz, J.: A $$2^d$$ 2 d -tree-based blocking method for microaggregating very large data sets. In: Proceedings of the First international conference on availability, reliability and security (2006)","DOI":"10.1109\/ARES.2006.1"},{"key":"149_CR34","doi-asserted-by":"crossref","first-page":"2211","DOI":"10.1016\/j.eswa.2011.04.223","volume":"39","author":"X Sun","year":"2012","unstructured":"Sun, X., Wang, H., Li, J., Zhang, Y.: An approximate microaggregation approach for microdata protection. Expert Syst. Appl. 39, 2211\u20132219 (2012)","journal-title":"Expert Syst. Appl."},{"key":"149_CR35","doi-asserted-by":"crossref","first-page":"557","DOI":"10.1142\/S0218488502001648","volume":"10","author":"L Sweeney","year":"2002","unstructured":"Sweeney, L.: $$k$$ k -anonymity: a model for protecting privacy. Int. J. Uncertain. Fuzziness Knowl. Syst 10, 557\u2013570 (2002)","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Syst"},{"key":"149_CR36","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0121-9","volume-title":"Elements of statistical disclosure control","author":"L Willenborg","year":"2001","unstructured":"Willenborg, L., DeWaal, T.: Elements of statistical disclosure control. Springer, New York (2001)"},{"key":"149_CR37","doi-asserted-by":"crossref","first-page":"1101","DOI":"10.1109\/34.244673","volume":"15","author":"Z Wu","year":"1993","unstructured":"Wu, Z., Leahy, R.: An optimal graph theoretic approach to data clustering: theory and its application to image segmentation. IEEE Trans. Pattern Anal. Mach. Intell. 15, 1101\u20131113 (1993)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."}],"container-title":["Journal of Global Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0149-3.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10898-014-0149-3\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10898-014-0149-3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,7]],"date-time":"2019-08-07T18:06:35Z","timestamp":1565201195000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10898-014-0149-3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,2,18]]},"references-count":37,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2014,10]]}},"alternative-id":["149"],"URL":"https:\/\/doi.org\/10.1007\/s10898-014-0149-3","relation":{},"ISSN":["0925-5001","1573-2916"],"issn-type":[{"value":"0925-5001","type":"print"},{"value":"1573-2916","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,2,18]]}}}