2026-04-17T05:21:28Zhttps://recercat.cat/oai/request

oai:recercat.cat:2117/210302025-07-17T03:41:50Zcom_2072_1033col_2072_452950

A fix-and-relax heuristic for controlled tabular adjustment Baena, Daniel Castro Pérez, Jordi 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ó Àrees temàtiques de la UPC::Matemàtiques i estadística::Investigació operativa::Programació matemàtica Programming (Mathematics) Programació (Matemàtica) 90C Programació matemàtica Controlled tabular adjustment (CTA) is an emerging protect ion technique for tabular data pro- tection. CTA formulates a mixed integer linear programming problem, which is tough for tables of moderate size. Finding a feasible initial solution may ev en be a challenging task for large instances. On the other hand, end users of tabular data prote ction techniques give priority to fast executions and are thus satisfied in practice with suboptima l solutions. In this work the fix-and- relax strategy is applied to large CTA instances. Fix-and-r elax is based on partitioning the set of binary variables into clusters to selectively explore a sma ller branch-and-cut tree. We report ex- tensive computational results on a set of real and random CTA instances. Fix-and-relax is shown to be competitive compared to plain CPLEX branch-and-cut in terms of quickly finding either a feasible solution or a good upper bound in di ffi cult instances. Preprint 2013-07 External research report Baena, D; Castro, J. "A fix-and-relax heuristic for controlled tabular adjustment". 2013. https://hdl.handle.net/2117/21030 eng UPC-DEIO DR 2013/02, http://www-eio.upc.es/~jcastro/publications/reports/dr2013-02.pdf http://creativecommons.org/licenses/by-nc-nd/3.0/es/ Open Access Attribution-NonCommercial-NoDerivs 3.0 Spain 14 p. application/pdf