IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v171y2006i1p39-52.html
   My bibliography  Save this article

Minimum-distance controlled perturbation methods for large-scale tabular data protection

Author

Listed:
  • Castro, Jordi

Abstract

No abstract is available for this item.

Suggested Citation

  • Castro, Jordi, 2006. "Minimum-distance controlled perturbation methods for large-scale tabular data protection," European Journal of Operational Research, Elsevier, vol. 171(1), pages 39-52, May.
    • Handle: RePEc:eee:ejores:v:171:y:2006:i:1:p:39-52
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377-2217(04)00611-3
    Download Restriction: Full text for ScienceDirect subscribers only
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    References listed on IDEAS

    as
    1. Matteo Fischetti & Juan José Salazar, 2001. "Solving the Cell Suppression Problem on Tabular Data with Linear Constraints," Management Science, INFORMS, vol. 47(7), pages 1008-1027, July.
    2. Michael Bacharach, 1966. "Matrix Rounding Problems," Management Science, INFORMS, vol. 12(9), pages 732-742, May.
    3. James Kelly & Bruce Golden & Arjang Assad, 1990. "Using Simulated Annealing to Solve Controlled Rounding Problems," INFORMS Journal on Computing, INFORMS, vol. 2(2), pages 174-185, May.
    4. Robert E. Bixby, 2002. "Solving Real-World Linear Programs: A Decade and More of Progress," Operations Research, INFORMS, vol. 50(1), pages 3-15, February.
    5. James P. Kelly & Bruce L. Golden & Arjang A. Assad & Edward K. Baker, 1990. "Controlled Rounding of Tabular Data," Operations Research, INFORMS, vol. 38(5), pages 760-772, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Castro, Jordi, 2012. "Recent advances in optimization techniques for statistical tabular data protection," European Journal of Operational Research, Elsevier, vol. 216(2), pages 257-269.
    2. Sage, Andrew J. & Wright, Stephen E., 2016. "Obtaining cell counts for contingency tables from rounded conditional frequencies," European Journal of Operational Research, Elsevier, vol. 250(1), pages 91-100.
    3. Jordi Castro & Antonio Frangioni & Claudio Gentile, 2014. "Perspective Reformulations of the CTA Problem with L 2 Distances," Operations Research, INFORMS, vol. 62(4), pages 891-909, August.
    4. Sedeño-Noda, A. & González-Dávila, E. & González-Martín, C. & González-Yanes, A., 2009. "Preemptive benchmarking problem: An approach for official statistics in small areas," European Journal of Operational Research, Elsevier, vol. 196(1), pages 360-369, July.
    5. Jordi Castro & Jordi Cuesta, 2013. "Solving L 1 -CTA in 3D tables by an interior-point method for primal block-angular problems," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 21(1), pages 25-47, April.
    6. Bocanegra, Silvana & Castro, Jordi & Oliveira, Aurelio R.L., 2013. "Improving an interior-point approach for large block-angular problems by hybrid preconditioners," European Journal of Operational Research, Elsevier, vol. 231(2), pages 263-273.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Juan-José Salazar-González, 2005. "A Unified Mathematical Programming Framework for Different Statistical Disclosure Limitation Methods," Operations Research, INFORMS, vol. 53(5), pages 819-829, October.
    2. Castro, Jordi, 2012. "Recent advances in optimization techniques for statistical tabular data protection," European Journal of Operational Research, Elsevier, vol. 216(2), pages 257-269.
    3. George, John A. & Kuan, Chong Juin & Ring, Brendan J., 1995. "Confidentiality control of tabulated data: Some practical network models," European Journal of Operational Research, Elsevier, vol. 85(3), pages 454-472, September.
    4. Jordi Castro & Antonio Frangioni & Claudio Gentile, 2014. "Perspective Reformulations of the CTA Problem with L 2 Distances," Operations Research, INFORMS, vol. 62(4), pages 891-909, August.
    5. Jordi Castro, 2007. "A Shortest-Paths Heuristic for Statistical Data Protection in Positive Tables," INFORMS Journal on Computing, INFORMS, vol. 19(4), pages 520-533, November.
    6. Ring, Brendan J. & George, John A. & Kuan, Chong Juin, 1997. "A fast algorithm for large-scale controlled rounding of 3-dimensional census tables," Socio-Economic Planning Sciences, Elsevier, vol. 31(1), pages 41-55, March.
    7. Sage, Andrew J. & Wright, Stephen E., 2016. "Obtaining cell counts for contingency tables from rounded conditional frequencies," European Journal of Operational Research, Elsevier, vol. 250(1), pages 91-100.
    8. Bach, Lukas & Hasle, Geir & Schulz, Christian, 2019. "Adaptive Large Neighborhood Search on the Graphics Processing Unit," European Journal of Operational Research, Elsevier, vol. 275(1), pages 53-66.
    9. Duque, Daniel & Lozano, Leonardo & Medaglia, Andrés L., 2015. "An exact method for the biobjective shortest path problem for large-scale road networks," European Journal of Operational Research, Elsevier, vol. 242(3), pages 788-797.
    10. Defeng Liu & Andrea Lodi & Mathieu Tanneau, 2021. "Learning chordal extensions," Journal of Global Optimization, Springer, vol. 81(1), pages 3-22, September.
    11. Daniel Baena & Jordi Castro & Antonio Frangioni, 2020. "Stabilized Benders Methods for Large-Scale Combinatorial Optimization, with Application to Data Privacy," Management Science, INFORMS, vol. 66(7), pages 3051-3068, July.
    12. Andrey M. Lizyayev, 2009. "Stochastic Dominance: Convexity and Some Efficiency Tests," Tinbergen Institute Discussion Papers 09-112/2, Tinbergen Institute, revised 05 Jan 2010.
    13. Timo Berthold & Jakob Witzig, 2021. "Conflict Analysis for MINLP," INFORMS Journal on Computing, INFORMS, vol. 33(2), pages 421-435, May.
    14. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    15. Juan Carlos Duque & Raúl Ramos & Jordi Suriñach, 2007. "Supervised Regionalization Methods: A Survey," International Regional Science Review, , vol. 30(3), pages 195-220, July.
    16. Harrod, Steven & Schlechte, Thomas, 2013. "A direct comparison of physical block occupancy versus timed block occupancy in train timetabling formulations," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 54(C), pages 50-66.
    17. A Corominas & R Pastor, 2011. "Designing greedy algorithms for the flow-shop problem by means of Empirically Adjusted Greedy Heuristics (EAGH)," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 62(9), pages 1704-1710, September.
    18. Im, Haesol & Wolkowicz, Henry, 2023. "Revisiting degeneracy, strict feasibility, stability, in linear programming," European Journal of Operational Research, Elsevier, vol. 310(2), pages 495-510.
    19. Haibing Lu & Jaideep Vaidya & Vijayalakshmi Atluri & Yingjiu Li, 2015. "Statistical Database Auditing Without Query Denial Threat," INFORMS Journal on Computing, INFORMS, vol. 27(1), pages 20-34, February.
    20. Xiao-Bai Li & Sumit Sarkar, 2013. "Class-Restricted Clustering and Microperturbation for Data Privacy," Management Science, INFORMS, vol. 59(4), pages 796-812, April.

    More about this item

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:171:y:2006:i:1:p:39-52. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.