The controlled rounding problem: Complexity and computational experience (Q1261381)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The controlled rounding problem: Complexity and computational experience |
scientific article; zbMATH DE number 404922
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | The controlled rounding problem: Complexity and computational experience |
scientific article; zbMATH DE number 404922 |
Statements
The controlled rounding problem: Complexity and computational experience (English)
0 references
28 September 1993
0 references
censoring
0 references
heuristics
0 references
government
0 references
agencies
0 references
data integrity
0 references
statistical enclosure
0 references
census organizations
0 references
statistical disclosure
0 references
anonymity
0 references
two- dimensional tables
0 references
controlled rounding
0 references
tree-dimensional problem
0 references
binary search procedures
0 references
simulated annealing
0 references
0 references
0.84949756
0 references
0.8417582
0 references
0.8399942
0 references
0 references
0.8375795
0 references
