Submitter | Variables | Constraints | Density | Status | Group | Objective | MPS File |
---|---|---|---|---|---|---|---|

Jordi Castro | 24793 | 10112 | 2.56826e-04 | easy | cta | 0 | cbs-cta.mps.gz |

Set of MILP instances of the CTA (Controlled Tabular Adjustment) problem, a method to protect statistical tabular data, belonging to the field of SDC (Statistical Disclosure Control). Raw data of instances are real or pseudo-real, provided by several National Statistical Agencies. We generated the CTA problem for these data.

Detailed explanation of the following tables can be found here.

Original | Presolved | |
---|---|---|

Variables | 24793 | 8293 |

Constraints | 10112 | 10112 |

Binaries | 2467 | 2467 |

Integers | 0 | 0 |

Continuous | 22326 | 5826 |

Implicit Integers | 0 | 0 |

Fixed Variables | 16500 | 0 |

Nonzero Density | 0.000256826 | 0.000374296 |

Nonzeroes | 64388 | 31388 |

Original | Presolved | |
---|---|---|

Total | 10112 | 10112 |

Empty | 0 | 0 |

Free | 0 | 0 |

Singleton | 0 | 0 |

Aggregations | 0 | 0 |

Precedence | 0 | 0 |

Variable Bound | 9868 | 9868 |

Set Partitioning | 0 | 0 |

Set Packing | 0 | 0 |

Set Covering | 0 | 0 |

Cardinality | 0 | 0 |

Invariant Knapsack | 0 | 0 |

Equation Knapsack | 0 | 0 |

Bin Packing | 0 | 0 |

Knapsack | 0 | 0 |

Integer Knapsack | 0 | 0 |

Mixed Binary | 244 | 244 |

General Linear | 0 | 0 |

Indicator | 0 | 0 |

Available nonzero structure and decomposition information. Further information can be found here.

Decomposed structure of original problem (dec-file)

Decomposed structure after trivial presolving (dec-file)

value | min | median | mean | max | |
---|---|---|---|---|---|

Components | 3.392345 | ||||

Constraint % | 0.0395570 | 0.0395570 | 0.0395570 | 0.0395570 | |

Variable % | 0.0361751 | 0.0361751 | 0.0361751 | 0.0361751 | |

Score | 0.975517 |

Find solutions below. Download the archive containing all solutions from the Download page.

ID | Objective | Exact | Int. Viol | Cons. Viol | Obj. Viol | Submitter | Date | Description |
---|---|---|---|---|---|---|---|---|

1 | 0 | 0 | 0 | 5.5e-06 | 0 | - | 2018-10-11 | Solution found during MIPLIB2017 problem selection. |

The following instances are most similar to cbs-cta in the collection. This similarity analysis is based on 100 scaled instance features describing properties of the variables, objective function, bounds, constraints, and right hand sides.

```
@ARTICLE{Castro2006,
author = {J. Castro},
title = {Minimum-distance controlled perturbation methods for large-scale tabular data protection},
journal = {European Journal of Operational Research},
year = {2006},
volume = {171},
pages = {39--52},
}
@ARTICLE{Castro2011,
author = {J. A. González, J. Castro},
title = {A heuristic block coordinate descent approach for controlled tabular adjustment},
journal = {Computers & Operations Research},
year = {2011},
volume = {38},
pages = {1826--1835},
}
@ARTICLE{Castro2012,
author = {J. Castro},
title = {Recent advances in optimization techniques for statistical tabular data protection},
journal = {European Journal of Operational Research},
year = {2012},
volume = {216},
pages = {257--269},
}
@ARTICLE{CastroFrangioniGentile2014,
author = {J. Castro, A. Frangioni, C. Gentile},
title = {Perspective reformulations of the CTA problem with L2 distances},
journal = {Operations Research},
year = {2014},
volume = {62},
pages = {891--909},
}
@ARTICLE{BaenaCastroGonzalez2015,
author = {D. Baena, J. Castro, J. A. González},
title = {Fix-and-relax approaches for controlled tabular adjustment},
journal = {Computers & Operations Research},
year = {2015},
volume = {58},
pages = {41--52},
}
```

Last Update Mai 28, 2020 by Gabriel Kressin

generated with R Markdown

© 2020 by Konrad-Zuse-Zentrum für Informationstechnik Berlin (ZIB)

Imprint