{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T15:00:09Z","timestamp":1725894009833},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540493303"},{"type":"electronic","value":"9783540493327"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11930242_2","type":"book-chapter","created":{"date-parts":[[2006,11,27]],"date-time":"2006-11-27T13:22:29Z","timestamp":1164633749000},"page":"12-24","source":"Crossref","is-referenced-by-count":0,"title":["Automatic Structure Detection in Constraints of Tabular Data"],"prefix":"10.1007","author":[{"given":"Jordi","family":"Castro","sequence":"first","affiliation":[]},{"given":"Daniel","family":"Baena","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/s10287-004-0020-y","volume":"2","author":"J.F. Benders","year":"2005","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Computational Management Science\u00a02, 3\u201319 (2005)","journal-title":"Computational Management Science"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1287\/opre.50.1.3.17780","volume":"50","author":"R.E. Bixby","year":"2002","unstructured":"Bixby, R.E.: Solving real-world linear programs: a decade and more of progress. Operations Research\u00a050, 3\u201315 (2002)","journal-title":"Operations Research"},{"key":"2_CR3","volume-title":"Applied Mathematical Programming","author":"S.P. Bradley","year":"1977","unstructured":"Bradley, S.P., Hax, A.C., Magnanti, T.L.: Applied Mathematical Programming. Addison-Wesley, Reading (1977)"},{"key":"2_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1007\/3-540-47804-3_5","volume-title":"Inference Control in Statistical Databases","author":"J. Castro","year":"2002","unstructured":"Castro, J.: Network flows heuristics for complementary cell suppression: an empirical evaluation and extensions. In: Domingo-Ferrer, J. (ed.) Inference Control in Statistical Databases. LNCS, vol.\u00a02316, pp. 59\u201373. Springer, Berlin (2002)"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s10287-004-0029-2","volume":"2","author":"J. Castro","year":"2005","unstructured":"Castro, J.: Quadratic interior-point methods in statistical disclosure control. Computational Management Science\u00a02, 107\u2013121 (2005)","journal-title":"Computational Management Science"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.ejor.2004.08.034","volume":"171","author":"J. Castro","year":"2006","unstructured":"Castro, J.: Minimum-distance controlled perturbation methods for large-scale tabular data protection. European Journal of Operational Research\u00a0171, 39\u201352 (2006)","journal-title":"European Journal of Operational Research"},{"key":"2_CR7","unstructured":"Castro, J.: A shortest paths heuristic for statistical disclosure control in positive tables. To appear in INFORMS Journal on Computing. Available as Research Report DR 2004\/10 Dept. of Statistics and Operations Research, Universitat Polit\u00e8cnica de Catalunya (2004)"},{"key":"2_CR8","unstructured":"Castro, J.: An interior-point approach for primal block-angular problems. To appear in Computational Optimization and Applications (2007). Available as Research Report DR 2005\/20 Dept. of Statistics and Operations Research, Universitat Polit\u00e8cnica de Catalunya (2005)"},{"key":"2_CR9","doi-asserted-by":"publisher","first-page":"1453","DOI":"10.2307\/2291538","volume":"90","author":"L.H. Cox","year":"1995","unstructured":"Cox, L.H.: Network models for complementary cell suppression. J. Am. Stat. Assoc.\u00a090, 1453\u20131462 (1995)","journal-title":"J. Am. Stat. Assoc."},{"key":"2_CR10","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/BF02216926","volume":"20","author":"L.H. Cox","year":"1989","unstructured":"Cox, L.H., George, J.A.: Controlled rounding for tables with subtotals. Annals of Operations Research\u00a020, 141\u2013157 (1989)","journal-title":"Annals of Operations Research"},{"key":"2_CR11","doi-asserted-by":"crossref","unstructured":"Dandekar, R.A.: Personal communication (2005)","DOI":"10.1240\/sav_gbm_2005_h_001141"},{"key":"2_CR12","unstructured":"Dandekar, R.A., Cox, L.H.: Synthetic tabular Data: an alternative to complementary cell suppression, Energy Information Administration, U.S, manuscript"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1287\/opre.8.1.101","volume":"8","author":"G.B. Dantzig","year":"1960","unstructured":"Dantzig, G.B., Wolfe, P.: Decomposition principle for linear programs. Operations Research\u00a08, 101\u2013111 (1960)","journal-title":"Operations Research"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1008","DOI":"10.1287\/mnsc.47.7.1008.9805","volume":"47","author":"M. Fischetti","year":"2001","unstructured":"Fischetti, M., Salazar, J.J.: Solving the cell suppression problem on tabular data with linear constraints. Management Science\u00a047, 1008\u20131026 (2001)","journal-title":"Management Science"},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"561","DOI":"10.1007\/s10107-003-0379-5","volume":"96","author":"J. Gondzio","year":"2003","unstructured":"Gondzio, J., Sarkissian, R.: Parallel interior point solver for structured linear programs. Mathematical Programming\u00a096, 561\u2013584 (2003)","journal-title":"Mathematical Programming"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"1631","DOI":"10.1016\/S0098-1354(99)00314-2","volume":"23","author":"Y.F. Hu","year":"2000","unstructured":"Hu, Y.F., Maguire, K.C.F., Blake, R.J.: A multilevel unsymmetric matrix ordering algorithm for parallel process simulation. Computers and Chemical Engineering\u00a023, 1631\u20131647 (2000)","journal-title":"Computers and Chemical Engineering"},{"key":"2_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/3-540-47804-3_14","volume-title":"Inference Control in Statistical Databases","author":"A. Hundepool","year":"2002","unstructured":"Hundepool, A.: The CASC project. In: Domingo-Ferrer, J. (ed.) Inference Control in Statistical Databases. LNCS, vol.\u00a02316, pp. 172\u2013180. Springer, Berlin (2002)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1137\/S1064827595287997","volume":"20","author":"G. Karypis","year":"1999","unstructured":"Karypis, G., Kumar, V.: A fast and high quality multilevel scheme for partitioning irregular graphs. SIAM Journal on scientific Computing\u00a020, 359\u2013392 (1999)","journal-title":"SIAM Journal on scientific Computing"},{"key":"2_CR19","doi-asserted-by":"crossref","first-page":"291","DOI":"10.1002\/j.1538-7305.1970.tb01770.x","volume":"49","author":"B.W. Kernighan","year":"1970","unstructured":"Kernighan, B.W., Lin, S.: An efficient heuristic procedure for partitioning graphs. Bell Systems Technical Journal\u00a049, 291\u2013308 (1970)","journal-title":"Bell Systems Technical Journal"},{"key":"2_CR20","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10107-005-0666-4","volume":"105","author":"J.J. Salazar","year":"2006","unstructured":"Salazar, J.J.: Controlled rounding and cell perturbation: statistical disclosure limitation methods for tabular data. Mathematical Programming\u00a0105, 583\u2013603 (2006)","journal-title":"Mathematical Programming"},{"key":"2_CR21","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611971453","volume-title":"Primal-Dual Interior-Point Methods","author":"S.J. Wright","year":"1997","unstructured":"Wright, S.J.: Primal-Dual Interior-Point Methods. SIAM, Philadelphia (1997)"}],"container-title":["Lecture Notes in Computer Science","Privacy in Statistical Databases"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11930242_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,19]],"date-time":"2019-05-19T17:18:50Z","timestamp":1558286330000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11930242_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540493303","9783540493327"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/11930242_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}