메뉴 건너뛰기




Volumn 123, Issue 1, 2000, Pages 29-41

Lower-bounding procedures for the 2-dimensional cell suppression problem

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL METHODS; INTEGER PROGRAMMING; PROBLEM SOLVING; STATISTICAL METHODS;

EID: 0342647299     PISSN: 03772217     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0377-2217(99)00087-9     Document Type: Article
Times cited : (5)

References (10)
  • 4
    • 84924515134 scopus 로고
    • Network models for complementary cell suppression
    • Cox L.H. Network models for complementary cell suppression. Journal of the American Statistical Association. 90(432):1995;1453-1462.
    • (1995) Journal of the American Statistical Association , vol.90 , Issue.432 , pp. 1453-1462
    • Cox, L.H.1
  • 7
  • 8
    • 0030353658 scopus 로고    scopus 로고
    • Data security equals graph connectivity
    • Kao M.-Y. Data security equals graph connectivity. SIAM Journal of Discrete Mathematics. 9(1):1996;87-100.
    • (1996) SIAM Journal of Discrete Mathematics , vol.9 , Issue.1 , pp. 87-100
    • Kao, M.-Y.1
  • 9
    • 0000120975 scopus 로고
    • Cell suppression: Disclosure protection for sensitive tabular data
    • Kelly J., Golden B.L., Assad A. Cell suppression: Disclosure protection for sensitive tabular data. Networks. 22:1992;397-417.
    • (1992) Networks , vol.22 , pp. 397-417
    • Kelly, J.1    Golden, B.L.2    Assad, A.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.