Fix-and-relax approaches for controlled tabular adjustment

Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instance...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Computers & operations research Ročník 58; s. 41 - 52
Hlavní autoři:	Baena, Daniel, Castro, Jordi, González, José A.
Médium:	Journal Article Publikace
Jazyk:	angličtina
Vydáno:	New York Elsevier Ltd 01.06.2015 Pergamon Press Inc
Témata:	90 Operations research, mathematical programming 90C Mathematical programming Adjustment Approximation Block coordinate descent Classificació AMS Clusters Controlled tabular adjustment CTA Data integrity DATA PROTECTION End users Feasibility pump Fix-and-relax Heuristic Integer programming Investigació operativa Linear programming Matemàtiques i estadística Mathematical models Mathematical problems Mixed integer Mixed-integer linear programming Operations research Partitioning Primal heuristics Programació (Matemàtica) Programming (Mathematics) SOFTWARE Statistical disclosure control Studies TABLES Àrees temàtiques de la UPC Controlled tabular adjustment Statistical disclosure control Block coordinate descent Feasibility pump Fix-and-relax Primal heuristics Mixed-integer linear programming
ISSN:	0305-0548, 1873-765X, 0305-0548
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Abstract	Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR+BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Comput Oper Res 2011;38:1826–35 [23]). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR+BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR+BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances.
AbstractList	Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR+BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Comput Oper Res 2011;38:1826–35 [23]). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR+BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR+BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances. Controlled tabular adjustment (CIA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR+BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Comput Oper Res 2011;38:1826-35 [23]). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR+BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR+BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances. (C) 2015 Elsevier Ltd. All rights reserved. Peer Reviewed Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming problem, which is challenging for tables of moderate size. Even finding a feasible initial solution may be a challenging task for large instances. On the other hand, end users of tabular data protection techniques give priority to fast executions and are thus satisfied in practice with suboptimal solutions. This work has two goals. First, the fix-and-relax (FR) strategy is applied to obtain good feasible initial solutions to large CTA instances. FR is based on partitioning the set of binary variables into clusters to selectively explore a smaller branch-and-cut tree. Secondly, the FR solution is used as a warm start for a block coordinate descent (BCD) heuristic (approach named FR ... BCD); BCD was confirmed to be a good option for large CTA instances in an earlier paper by the second and third co-authors (Comput Oper Res 2011;38:1826-35 [23]). We report extensive computational results on a set of real-world and synthetic CTA instances. FR is shown to be competitive compared to CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound. FR ... BCD improved the quality of FR solutions for approximately 25% and 50% of the synthetic and real-world instances, respectively. FR or FR .. BCD provided similar or better solutions in less CPU time than CPLEX for 73% of the difficult real-world instances. (ProQuest: ... denotes formulae/symbols omitted.)
Author	Castro, Jordi Baena, Daniel González, José A.
Author_xml	– sequence: 1 givenname: Daniel surname: Baena fullname: Baena, Daniel email: daniel.baena@upc.edu – sequence: 2 givenname: Jordi orcidid: 0000-0003-3573-4568 surname: Castro fullname: Castro, Jordi email: jordi.castro@upc.edu – sequence: 3 givenname: José A. orcidid: 0000-0002-3113-4779 surname: González fullname: González, José A. email: jose.a.gonzalez@upc.edu
BookMark	eNp9kUFrFTEQx4O04GvrB_C24MXLrplNNsnqSYpVoeDFgrcwJvMwy77NM8lK--2b5QlKDx0YhoH5DfOf_wU7W-JCjL0G3gEH9W7qXExdz0F2AB0H84LtwGjRajX8OGM7LvjQ8kGal-wi54nX0D3s2PubcN_i4ttEM943eDymiO4X5WYfU-PiUlKcZ_JNwZ_rjKlBP625HGgpV-x8j3OmV3_rJbu7-fT9-kt7--3z1-uPt62TWpYWvPekjB8UKaGlGvY0IDrtRinNOEIviAY1eoeAoyPj1aB6ZdAo5fUolbhkcNrr8upsIkfJYbERw79my74qsv0AfOSVeXtiqpzfK-ViDyE7mmdcKK7ZgjJKCqH5tv7Nk9EprmmpiuqU4tIAF-K_I1LMOdHeHlM4YHqwwO3mgJ1sdcBuDlgAWx2ojH7CuFCwhO2pGOZnyQ8nkupf_wRKNrtAiyMfquRifQzP0I8_vqET
CODEN	CMORAP
CitedBy_id	crossref_primary_10_1016_j_trpro_2018_10_107 crossref_primary_10_1080_00207543_2017_1355577 crossref_primary_10_1016_j_ejor_2018_05_041 crossref_primary_10_1016_j_ejor_2021_07_043 crossref_primary_10_1080_10556788_2017_1332620 crossref_primary_10_1016_j_trb_2019_05_007 crossref_primary_10_1016_j_cor_2022_105817 crossref_primary_10_3390_math9243177
Cites_doi	10.1007/978-3-319-11257-2_26 10.1007/978-3-319-11257-2_5 10.1016/j.ejor.2004.08.034 10.1007/s10479-009-0574-8 10.1007/s10107-003-0395-5 10.1007/s12532-011-0025-9 10.1016/j.cor.2011.02.008 10.1016/j.cor.2009.06.007 10.1287/mnsc.47.7.1008.9805 10.1287/ijoc.1060.0185 10.1016/j.ejor.2011.03.050 10.1142/S0218488512400314 10.1016/j.cor.2013.08.021 10.1007/s101070100263 10.1007/s10107-004-0518-7 10.1287/opre.2014.1293 10.1007/11930242_28 10.1007/978-3-319-11257-2_2 10.1007/978-3-540-87471-3_1 10.1007/978-3-642-15838-4_5 10.1016/j.orl.2011.07.005 10.1007/s10479-005-3970-8 10.1016/0377-2217(94)90074-4 10.1016/j.disopt.2006.10.004 10.1007/s10107-004-0570-3
ContentType	Journal Article Publication
Contributor	Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
Contributor_xml	– sequence: 1 fullname: Universitat Politècnica de Catalunya. Departament d'Estadística i Investigació Operativa – sequence: 2 fullname: Universitat Politècnica de Catalunya. GNOM - Grup d'Optimització Numèrica i Modelització
Copyright	2015 Elsevier Ltd Copyright Pergamon Press Inc. Jun 2015 Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess http://creativecommons.org/licenses/by-nc-nd/3.0/es
Copyright_xml	– notice: 2015 Elsevier Ltd – notice: Copyright Pergamon Press Inc. Jun 2015 – notice: Attribution-NonCommercial-NoDerivs 3.0 Spain info:eu-repo/semantics/openAccess <a href="http://creativecommons.org/licenses/by-nc-nd/3.0/es/">http://creativecommons.org/licenses/by-nc-nd/3.0/es/</a>
DBID	AAYXX CITATION 7SC 8FD JQ2 L7M L~C L~D XX2
DOI	10.1016/j.cor.2014.11.018
DatabaseName	CrossRef Computer and Information Systems Abstracts Technology Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional Recercat
DatabaseTitle	CrossRef Computer and Information Systems Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Advanced Technologies Database with Aerospace ProQuest Computer Science Collection Computer and Information Systems Abstracts Professional
DatabaseTitleList	Computer and Information Systems Abstracts Computer and Information Systems Abstracts
DeliveryMethod	fulltext_linktorsrc
Discipline	Engineering Computer Science Business
EISSN	1873-765X 0305-0548
EndPage	52
ExternalDocumentID	oai_recercat_cat_2072_251090 3613504401 10_1016_j_cor_2014_11_018 S0305054815000039
Genre	Feature
GroupedDBID	--K --M -~X .DC .~1 0R~ 186 1B1 1OL 1RT 1~. 1~5 29F 4.4 457 4G. 5GY 5VS 6J9 7-5 71M 8P~ 9JN 9JO AAAKF AAAKG AABNK AACTN AAEDT AAEDW AAFJI AAIAV AAIKJ AAKOC AALRI AAOAW AAQFI AAQXK AARIN AAXUO AAYFN AAYOK ABAOU ABBOA ABEFU ABFNM ABFRF ABJNI ABMAC ABMMH ABUCO ABXDB ABYKQ ACAZW ACDAQ ACGFO ACGFS ACNCT ACNNM ACRLP ACZNC ADBBV ADEZE ADGUI ADJOM ADMUD AEBSH AEFWE AEHXG AEKER AENEX AFFNX AFKWA AFTJW AGHFR AGUBO AGYEJ AHHHB AHZHX AI. AIALX AIEXJ AIGVJ AIKHN AITUG AJBFU AJOXV AKYCK ALMA_UNASSIGNED_HOLDINGS AMFUW AMRAJ AOMHK AOUOD APLSM ARUGR ASPBG AVARZ AVWKF AXJTR AZFZN BKOJK BKOMP BLXMC CS3 DU5 EBS EFJIC EFLBG EJD EO8 EO9 EP2 EP3 FDB FEDTE FGOYB FIRID FNPLU FYGXN G-Q G8K GBLVA GBOLZ HAMUX HVGLF HZ~ H~9 IHE J1W KOM LY1 M41 MHUIS MO0 MS~ O-L O9- OAUVE OZT P-8 P-9 P2P PC. PQQKQ PRBVW Q38 R2- RIG ROL RPZ RXW SDF SDG SDP SDS SES SEW SPC SPCBC SSB SSD SSO SSV SSW SSZ T5K TAE TN5 U5U UAO UPT VH1 WUQ XFK XPP ZMT ~02 ~G- 9DU AATTM AAXKI AAYWO AAYXX ABDPE ABWVN ACLOT ACRPL ACVFH ADCNI ADNMO AEIPS AEUPX AFJKZ AFPUW AGQPQ AIGII AIIUN AKBMS AKRWK AKYEP ANKPU APXCP CITATION EFKBS ~HD 7SC 8FD AFXIZ AGCQF AGRNS JQ2 L7M L~C L~D SSH XX2
ID	FETCH-LOGICAL-c474t-1ddde68d56e637465fe5aac7c944899123ee569dca1a9ce8d656268a866d79463
ISICitedReferencesCount	11
ISICitedReferencesURI	http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000351967100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN	0305-0548
IngestDate	Fri Nov 07 13:42:08 EST 2025 Wed Oct 01 13:16:37 EDT 2025 Sun Jul 13 05:34:00 EDT 2025 Tue Nov 18 22:35:41 EST 2025 Sat Nov 29 03:23:38 EST 2025 Fri Feb 23 02:33:29 EST 2024
IsDoiOpenAccess	true
IsOpenAccess	true
IsPeerReviewed	true
IsScholarly	true
Keywords	Controlled tabular adjustment Statistical disclosure control Block coordinate descent Feasibility pump Fix-and-relax Primal heuristics Mixed-integer linear programming
Language	English
LinkModel	OpenURL
MergedId	FETCHMERGED-LOGICAL-c474t-1ddde68d56e637465fe5aac7c944899123ee569dca1a9ce8d656268a866d79463
Notes	SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 14 ObjectType-Article-1 ObjectType-Feature-2 content type line 23
ORCID	0000-0002-3113-4779 0000-0003-3573-4568
OpenAccessLink	https://recercat.cat/handle/2072/251090
PQID	1660481033
PQPubID	45870
PageCount	12
ParticipantIDs	csuc_recercat_oai_recercat_cat_2072_251090 proquest_miscellaneous_1686433706 proquest_journals_1660481033 crossref_primary_10_1016_j_cor_2014_11_018 crossref_citationtrail_10_1016_j_cor_2014_11_018 elsevier_sciencedirect_doi_10_1016_j_cor_2014_11_018
PublicationCentury	2000
PublicationDate	2015-06-01
PublicationDateYYYYMMDD	2015-06-01
PublicationDate_xml	– month: 06 year: 2015 text: 2015-06-01 day: 01
PublicationDecade	2010
PublicationPlace	New York
PublicationPlace_xml	– name: New York
PublicationTitle	Computers & operations research
PublicationYear	2015
Publisher	Elsevier Ltd Pergamon Press Inc
Publisher_xml	– name: Elsevier Ltd – name: Pergamon Press Inc
References	Dandekar RA, Cox LH. Synthetic tabular data: an alternative to complementary cell suppression, manuscript. Energy Information Administration, U.S. Department of Energy; 2002. Glover, Cox, Patil, Kelly (bib22) 2011; 183 Castro J, González JA. Assessing the information loss of controlled adjustment methods in two-way tables. In: Lecture notes in computer science, vol. 8744; 2014. Achterberg, Berthold (bib1) 2007; 4 Baena, Castro (bib2) 2011; 39 Fischetti, Glover, Lodi (bib17) 2005; 104 Castro (bib3) 2006; 171 Ferreira, Morabito, Rangel (bib16) 2010; 37 Fischetti, Salazar (bib19) 2001; 47 Dolan, Moré (bib14) 2002; 91 Fischetti, Lodi (bib18) 2003; 98 Castro (bib5) 2012; 21 Castro, Frangioni, Gentile (bib8) 2014; 62 Castro (bib4) 2007; 19 Escudero, Salmerón (bib15) 2005; 140 Castro J, Baena D. Using a mathematical programming modeling language for optimal CTA. In: Lecture notes in computer science, vol. 5262; 2008. p. 1–12 Hernández, Salazar (bib24) 2014; 43 Dillenberger, Escudero, Wollensak, Zhang (bib13) 1994; 75 Giessing S. Pre-tabular perturbation with controlled tabular adjustment some considerations. In: Lecture notes in computer science, vol. 8744; 2014. p. 48–61 Soininvaara K, Oinonen T, Nissinen A. Balancing confidentiality and usability: protecting sensitive data in the case of inward Foreign AffiliaTes Statistics (FATS). In: Lecture notes in computer science, vol. 8744; 2014. p. 338–49 2010. Danna, Rothberg, Le Pape (bib12) 2005; 102 Mittelmann H. Decision tree for optimization software Castro (bib6) 2012; 20 Giessing S, Höhne J. Eliminating small cells from census counts tables: some considerations on transition probabilities. In: Lecture notes in computer science, vol. 6344; 2010. p. 52–65 Hundepool A, Domingo-Ferrer J, Franconi L, Giessing S, Lenz R, Naylor J, et al. Handook on statistical disclosure control V1.2. Network of excellence in the European statistical system in the field of statistical disclosure control. Available online at URL González, Castro (bib23) 2011; 38 Hundepool, Domingo-Ferrer, Franconi, Giessing, Schulte Nordholt, Spicer (bib27) 2012 Zayatz L, Census Bureau US. Communication at Joint UNECE/Eurostat Work Session on statistical data confidentiality, Bilbao (Basque Country, Spain); 2009. Castro J, Giessing S. Testing variants of minimum distance controlled tabular adjustment. In: Monographs of official statistics. Luxembourg: Eurostat-Office for Official Publications of the European Communities; 2006. p. 333–43. Hundepool A. The Argus software in CENEX. In: Lecture notes in computer science, vol. 4302; 2006. p. 334–46 2014. Koch, Achterberg, Andersen, Bastert, Berthold, Bixby (bib28) 2011; 3 González (10.1016/j.cor.2014.11.018_bib23) 2011; 38 Hundepool (10.1016/j.cor.2014.11.018_bib27) 2012 10.1016/j.cor.2014.11.018_bib21 10.1016/j.cor.2014.11.018_bib20 Koch (10.1016/j.cor.2014.11.018_bib28) 2011; 3 10.1016/j.cor.2014.11.018_bib25 Castro (10.1016/j.cor.2014.11.018_bib6) 2012; 20 10.1016/j.cor.2014.11.018_bib26 10.1016/j.cor.2014.11.018_bib29 Ferreira (10.1016/j.cor.2014.11.018_bib16) 2010; 37 Castro (10.1016/j.cor.2014.11.018_bib5) 2012; 21 Hernández (10.1016/j.cor.2014.11.018_bib24) 2014; 43 Achterberg (10.1016/j.cor.2014.11.018_bib1) 2007; 4 10.1016/j.cor.2014.11.018_bib9 Fischetti (10.1016/j.cor.2014.11.018_bib18) 2003; 98 10.1016/j.cor.2014.11.018_bib7 Castro (10.1016/j.cor.2014.11.018_bib3) 2006; 171 Castro (10.1016/j.cor.2014.11.018_bib4) 2007; 19 Baena (10.1016/j.cor.2014.11.018_bib2) 2011; 39 Castro (10.1016/j.cor.2014.11.018_bib8) 2014; 62 Fischetti (10.1016/j.cor.2014.11.018_bib17) 2005; 104 Escudero (10.1016/j.cor.2014.11.018_bib15) 2005; 140 10.1016/j.cor.2014.11.018_bib30 10.1016/j.cor.2014.11.018_bib10 10.1016/j.cor.2014.11.018_bib31 10.1016/j.cor.2014.11.018_bib11 Danna (10.1016/j.cor.2014.11.018_bib12) 2005; 102 Fischetti (10.1016/j.cor.2014.11.018_bib19) 2001; 47 Glover (10.1016/j.cor.2014.11.018_bib22) 2011; 183 Dillenberger (10.1016/j.cor.2014.11.018_bib13) 1994; 75 Dolan (10.1016/j.cor.2014.11.018_bib14) 2002; 91
References_xml	– volume: 37 start-page: 684 year: 2010 end-page: 691 ident: bib16 article-title: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants publication-title: Comput Oper Res – reference: Hundepool A. The Argus software in CENEX. In: Lecture notes in computer science, vol. 4302; 2006. p. 334–46 – volume: 39 start-page: 310 year: 2011 end-page: 317 ident: bib2 article-title: Using the analytic center in the feasibility pump publication-title: Oper Res Lett – reference: Soininvaara K, Oinonen T, Nissinen A. Balancing confidentiality and usability: protecting sensitive data in the case of inward Foreign AffiliaTes Statistics (FATS). In: Lecture notes in computer science, vol. 8744; 2014. p. 338–49 – reference: Mittelmann H. Decision tree for optimization software, 〈 – volume: 183 start-page: 47 year: 2011 end-page: 73 ident: bib22 article-title: Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection publication-title: Ann Oper Res – reference: Zayatz L, Census Bureau US. Communication at Joint UNECE/Eurostat Work Session on statistical data confidentiality, Bilbao (Basque Country, Spain); 2009. – reference: Castro J, Giessing S. Testing variants of minimum distance controlled tabular adjustment. In: Monographs of official statistics. Luxembourg: Eurostat-Office for Official Publications of the European Communities; 2006. p. 333–43. – volume: 43 start-page: 61 year: 2014 end-page: 67 ident: bib24 article-title: Enhanced controlled tabular adjustment publication-title: Comput Oper Res – volume: 104 start-page: 91 year: 2005 end-page: 104 ident: bib17 article-title: The feasibility pump publication-title: Math Program – volume: 102 start-page: 71 year: 2005 end-page: 90 ident: bib12 article-title: Exploring relaxation induced neighborhoods to improve MIP solutions publication-title: Math Program – reference: 〉; 2010. – volume: 38 start-page: 1826 year: 2011 end-page: 1835 ident: bib23 article-title: A heuristic block coordinate descent approach for controlled tabular adjustment publication-title: Comput Oper Res – reference: Giessing S. Pre-tabular perturbation with controlled tabular adjustment some considerations. In: Lecture notes in computer science, vol. 8744; 2014. p. 48–61 – volume: 91 start-page: 201 year: 2002 end-page: 213 ident: bib14 article-title: Benchmarking optimization software with performance profiles publication-title: Math Program A – reference: Castro J, González JA. Assessing the information loss of controlled adjustment methods in two-way tables. In: Lecture notes in computer science, vol. 8744; 2014. – volume: 20 start-page: 921 year: 2012 end-page: 941 ident: bib6 article-title: On assessing the disclosure risk of controlled adjustment methods for statistical tabular data publication-title: Int J Uncertain Fuzziness Knowl-Based Syst – volume: 47 start-page: 1008 year: 2001 end-page: 1026 ident: bib19 article-title: Solving the cell suppression problem on tabular data with linear constraints publication-title: Manag Sci – volume: 75 start-page: 275 year: 1994 end-page: 286 ident: bib13 article-title: On practical resource allocation for production planning and scheduling with period overlapping setups publication-title: Eur J Oper Res – volume: 21 start-page: 257 year: 2012 end-page: 269 ident: bib5 article-title: Recent advances in optimization techniques for statistical tabular data protection publication-title: Eur J Oper Res – reference: Castro J, Baena D. Using a mathematical programming modeling language for optimal CTA. In: Lecture notes in computer science, vol. 5262; 2008. p. 1–12 – volume: 98 start-page: 23 year: 2003 end-page: 47 ident: bib18 article-title: Local branching publication-title: Math Program – volume: 4 start-page: 77 year: 2007 end-page: 86 ident: bib1 article-title: Improving the feasibility pump publication-title: Discr Optim – reference: Giessing S, Höhne J. Eliminating small cells from census counts tables: some considerations on transition probabilities. In: Lecture notes in computer science, vol. 6344; 2010. p. 52–65 – year: 2012 ident: bib27 article-title: Statistical disclosure control – volume: 171 start-page: 39 year: 2006 end-page: 52 ident: bib3 article-title: Minimum-distance controlled perturbation methods for large-scale tabular data protection publication-title: Eur J Oper Res – volume: 140 start-page: 163 year: 2005 end-page: 188 ident: bib15 article-title: On a fix-and-relax framework for a class of project scheduling problems publication-title: Ann Oper Res – reference: Hundepool A, Domingo-Ferrer J, Franconi L, Giessing S, Lenz R, Naylor J, et al. Handook on statistical disclosure control V1.2. Network of excellence in the European statistical system in the field of statistical disclosure control. Available online at URL 〈 – volume: 19 start-page: 520 year: 2007 end-page: 533 ident: bib4 article-title: A shortest-paths heuristic for statistical data protection in positive tables publication-title: INFORMS J Comput – reference: Dandekar RA, Cox LH. Synthetic tabular data: an alternative to complementary cell suppression, manuscript. Energy Information Administration, U.S. Department of Energy; 2002. – volume: 3 start-page: 103 year: 2011 end-page: 163 ident: bib28 article-title: MIPLIB 2010. Mixed integer programming library version 5 publication-title: Math Program Comput – volume: 62 start-page: 891 year: 2014 end-page: 909 ident: bib8 article-title: Perspective reformulations of the CTA problem with L publication-title: Oper Res – reference: 〉; 2014. – ident: 10.1016/j.cor.2014.11.018_bib30 doi: 10.1007/978-3-319-11257-2_26 – ident: 10.1016/j.cor.2014.11.018_bib20 doi: 10.1007/978-3-319-11257-2_5 – ident: 10.1016/j.cor.2014.11.018_bib26 – volume: 171 start-page: 39 year: 2006 ident: 10.1016/j.cor.2014.11.018_bib3 article-title: Minimum-distance controlled perturbation methods for large-scale tabular data protection publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2004.08.034 – volume: 183 start-page: 47 year: 2011 ident: 10.1016/j.cor.2014.11.018_bib22 article-title: Integrated exact, hybrid and metaheuristic learning methods for confidentiality protection publication-title: Ann Oper Res doi: 10.1007/s10479-009-0574-8 – volume: 98 start-page: 23 year: 2003 ident: 10.1016/j.cor.2014.11.018_bib18 article-title: Local branching publication-title: Math Program doi: 10.1007/s10107-003-0395-5 – volume: 3 start-page: 103 year: 2011 ident: 10.1016/j.cor.2014.11.018_bib28 article-title: MIPLIB 2010. Mixed integer programming library version 5 publication-title: Math Program Comput doi: 10.1007/s12532-011-0025-9 – volume: 38 start-page: 1826 year: 2011 ident: 10.1016/j.cor.2014.11.018_bib23 article-title: A heuristic block coordinate descent approach for controlled tabular adjustment publication-title: Comput Oper Res doi: 10.1016/j.cor.2011.02.008 – volume: 37 start-page: 684 year: 2010 ident: 10.1016/j.cor.2014.11.018_bib16 article-title: Relax and fix heuristics to solve one-stage one-machine lot-scheduling models for small-scale soft drink plants publication-title: Comput Oper Res doi: 10.1016/j.cor.2009.06.007 – year: 2012 ident: 10.1016/j.cor.2014.11.018_bib27 – volume: 47 start-page: 1008 year: 2001 ident: 10.1016/j.cor.2014.11.018_bib19 article-title: Solving the cell suppression problem on tabular data with linear constraints publication-title: Manag Sci doi: 10.1287/mnsc.47.7.1008.9805 – volume: 19 start-page: 520 issue: 4 year: 2007 ident: 10.1016/j.cor.2014.11.018_bib4 article-title: A shortest-paths heuristic for statistical data protection in positive tables publication-title: INFORMS J Comput doi: 10.1287/ijoc.1060.0185 – volume: 21 start-page: 257 year: 2012 ident: 10.1016/j.cor.2014.11.018_bib5 article-title: Recent advances in optimization techniques for statistical tabular data protection publication-title: Eur J Oper Res doi: 10.1016/j.ejor.2011.03.050 – volume: 20 start-page: 921 year: 2012 ident: 10.1016/j.cor.2014.11.018_bib6 article-title: On assessing the disclosure risk of controlled adjustment methods for statistical tabular data publication-title: Int J Uncertain Fuzziness Knowl-Based Syst doi: 10.1142/S0218488512400314 – ident: 10.1016/j.cor.2014.11.018_bib11 – volume: 43 start-page: 61 year: 2014 ident: 10.1016/j.cor.2014.11.018_bib24 article-title: Enhanced controlled tabular adjustment publication-title: Comput Oper Res doi: 10.1016/j.cor.2013.08.021 – volume: 91 start-page: 201 year: 2002 ident: 10.1016/j.cor.2014.11.018_bib14 article-title: Benchmarking optimization software with performance profiles publication-title: Math Program A doi: 10.1007/s101070100263 – volume: 102 start-page: 71 year: 2005 ident: 10.1016/j.cor.2014.11.018_bib12 article-title: Exploring relaxation induced neighborhoods to improve MIP solutions publication-title: Math Program doi: 10.1007/s10107-004-0518-7 – volume: 62 start-page: 891 issue: 4 year: 2014 ident: 10.1016/j.cor.2014.11.018_bib8 article-title: Perspective reformulations of the CTA problem with L2 distances publication-title: Oper Res doi: 10.1287/opre.2014.1293 – ident: 10.1016/j.cor.2014.11.018_bib25 doi: 10.1007/11930242_28 – ident: 10.1016/j.cor.2014.11.018_bib29 – ident: 10.1016/j.cor.2014.11.018_bib10 doi: 10.1007/978-3-319-11257-2_2 – ident: 10.1016/j.cor.2014.11.018_bib31 – ident: 10.1016/j.cor.2014.11.018_bib7 doi: 10.1007/978-3-540-87471-3_1 – ident: 10.1016/j.cor.2014.11.018_bib21 doi: 10.1007/978-3-642-15838-4_5 – volume: 39 start-page: 310 year: 2011 ident: 10.1016/j.cor.2014.11.018_bib2 article-title: Using the analytic center in the feasibility pump publication-title: Oper Res Lett doi: 10.1016/j.orl.2011.07.005 – volume: 140 start-page: 163 year: 2005 ident: 10.1016/j.cor.2014.11.018_bib15 article-title: On a fix-and-relax framework for a class of project scheduling problems publication-title: Ann Oper Res doi: 10.1007/s10479-005-3970-8 – volume: 75 start-page: 275 year: 1994 ident: 10.1016/j.cor.2014.11.018_bib13 article-title: On practical resource allocation for production planning and scheduling with period overlapping setups publication-title: Eur J Oper Res doi: 10.1016/0377-2217(94)90074-4 – volume: 4 start-page: 77 year: 2007 ident: 10.1016/j.cor.2014.11.018_bib1 article-title: Improving the feasibility pump publication-title: Discr Optim doi: 10.1016/j.disopt.2006.10.004 – ident: 10.1016/j.cor.2014.11.018_bib9 – volume: 104 start-page: 91 year: 2005 ident: 10.1016/j.cor.2014.11.018_bib17 article-title: The feasibility pump publication-title: Math Program doi: 10.1007/s10107-004-0570-3
SSID	ssj0000721
Score	2.1966665
Snippet	Controlled tabular adjustment (CTA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming... Controlled tabular adjustment (CIA) is a relatively new protection technique for tabular data protection. CTA formulates a mixed integer linear programming...
SourceID	csuc proquest crossref elsevier
SourceType	Open Access Repository Aggregation Database Enrichment Source Index Database Publisher
StartPage	41
SubjectTerms	90 Operations research, mathematical programming 90C Mathematical programming Adjustment Approximation Block coordinate descent Classificació AMS Clusters Controlled tabular adjustment CTA Data integrity DATA PROTECTION End users Feasibility pump Fix-and-relax Heuristic Integer programming Investigació operativa Linear programming Matemàtiques i estadística Mathematical models Mathematical problems Mixed integer Mixed-integer linear programming Operations research Partitioning Primal heuristics Programació (Matemàtica) Programming (Mathematics) SOFTWARE Statistical disclosure control Studies TABLES Àrees temàtiques de la UPC
Title	Fix-and-relax approaches for controlled tabular adjustment
URI	https://dx.doi.org/10.1016/j.cor.2014.11.018 https://www.proquest.com/docview/1660481033 https://www.proquest.com/docview/1686433706 https://recercat.cat/handle/2072/251090
Volume	58
WOSCitedRecordID	wos000351967100005&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText	1
inHoldings	1
isFullTextHit
isPrint
journalDatabaseRights	– providerCode: PRVESC databaseName: Elsevier SD Freedom Collection Journals 2021 customDbUrl: eissn: 1873-765X dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000721 issn: 0305-0548 databaseCode: AIEXJ dateStart: 19950101 isFulltext: true titleUrlDefault: https://www.sciencedirect.com providerName: Elsevier
link	http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwtV3fq9MwFA5zV0Qf_DGvOL1KBZ-UjLZpk8a3KfeiQy6CV9hbyNIUNkY71u4y_Os9aZJ2u8JFBR9Wtq5bSr7Tc74k53xB6G2oqVTZQmKIziFOIh3jBWUJBvJKi4JCTFOtiOtXdnmZzef822BQ-FqY6zUry2y_55v_CjWcA7BN6exfwN39KZyA9wA6HAF2OP4R8BfLPZZljk2Vyr7TDNet7oLPTF8DzWzkok1BlflqVzddAoxXLXC7PdStbVQbvXU5c04dqJtF_ii1LSuzxer9mkbd2BKaGQxvl12aT1X-bNfmo7Wdup5VtV2rfz-dHM5ARGmfKWWnxXxpTJ-H1JZjmazA1MpoTrT1rhkjmNF0fuh-rXK7859WBMtFYitt-5uPt9MNK4DI6LlGycSosDonfiyd_d3chLmHyGz7EBJ-B53ELOXg_U6mX87nsz5ms7ZCr7tpv_7dZgLeaOiIwQxVvVNHROZGSG95ytVj9NANMIKpNYwnaKDLEbrn6xtG6JFHNnBufYQeHIhSPkUfjgwo6A0oAAMKegMKnAEFvQGdoh8X51efPmO3wwZWCUsaHOUQ3WiWp1RTwhKaFjqVUjHFYdQOI4eYaJ1SnisZSa50lgP7j2kmM0pzszMBeYaGZVXq5ygIuVrwIlOSszwJCyVpIhmJIl0QAt2rxij0vSaUk583u6Cshc8zXAnoaGE6GoalAjp6jN51P9lY7ZXbLwYoBPAEvVWyEUY3vftgXjGALIDOhzwco8QDJhzTtAxSgJHd1saZB1e4J74WEaVGcykkZIzedF-DkzYrb7LU1c5ckwHzJyykL_6t5Zfofv_knaFhs93pV-iuum6W9fa1s-Zf0c20Rg
linkProvider	Elsevier
openUrl	ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Fix-and-relax+approaches+for+controlled+tabular+adjustment&rft.jtitle=Computers+%26+operations+research&rft.au=Baena%2C+Daniel&rft.au=Castro%2C+Jordi&rft.au=Gonz%C3%A1lez%2C+Jos%C3%A9+A.&rft.date=2015-06-01&rft.pub=Elsevier+Ltd&rft.issn=0305-0548&rft.eissn=1873-765X&rft.volume=58&rft.spage=41&rft.epage=52&rft_id=info:doi/10.1016%2Fj.cor.2014.11.018&rft.externalDocID=S0305054815000039
thumbnail_l	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=0305-0548&client=summon
thumbnail_m	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=0305-0548&client=summon
thumbnail_s	http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=0305-0548&client=summon