Treffer: The controlled rounding problem: complexity and computational experience

Title:
The controlled rounding problem: complexity and computational experience
Authors:
KELLY, J. P, GOLDEN, B. L, ASSAD, A. A
Source:
European journal of operational research. 65(2):207-217
Publisher Information:
Amsterdam: Elsevier, 1993.
Publication Year:
1993
Physical Description:
print, 24 ref
Original Material:
INIST-CNRS
Subject Terms:
Control theory, operational research, Automatique, recherche opérationnelle, Sciences exactes et technologie, Exact sciences and technology, Sciences et techniques communes, Sciences and techniques of general use, Mathematiques, Mathematics, Probabilités et statistiques, Probability and statistics, Statistiques, Statistics, Théorie de l'échantillonnage, sondages statistiques, Sampling theory, sample surveys, Complexité calcul, Computing complexity, Complejidad cálculo, Modèle 3 dimensions, Three dimensional model, Modelo 3 dimensiones, Programmation linéaire, Linear programming, Programación lineal, Recuit simulé, Simulated annealing, Recocido simulado, Sondage statistique, Sample survey, Ecuesta estadística, Table donnée, Data table, Tabla dato, Arrondissement contrôlé, Controlled rounding, Donnée confidentielle, Flot réseau, Network flow
Document Type:
Fachzeitschrift Article
File Description:
text
Language:
English
Author Affiliations:
Univ. Maryland, coll. business management, College Park MD 20742, United States
ISSN:
0377-2217
Access URL:
http://pascal-francis.inist.fr/vibad/index.php?action=search&terms=4626650
Rights:
Copyright 1993 INIST-CNRS
CC BY 4.0
Sauf mention contraire ci-dessus, le contenu de cette notice bibliographique peut être utilisé dans le cadre d’une licence CC BY 4.0 Inist-CNRS / Unless otherwise stated above, the content of this bibliographic record may be used under a CC BY 4.0 licence by Inist-CNRS / A menos que se haya señalado antes, el contenido de este registro bibliográfico puede ser utilizado al amparo de una licencia CC BY 4.0 Inist-CNRS
Notes:
Mathematics
Accession Number:
edscal.4626650
Database:
PASCAL Archive

Weitere Informationen

Controlled rounding is a procedure whereby tabular data gathered from respondents is perturbed in such a way as to preserve the anonymity of the respondents while maintaining the integrity of the data. Controlled rounding of two-dimensional tables can be represented by a straightforward network flow representation. Three-dimensional controlled rounding problems, on the other hand, have no pure network analog and have been shown to be NP-complete. A number of complexity results associated with the three-dimensional problem and its variants are discussed. In addition, we review several solution procedures for solving two- and three-dimensional problems. The algorithms reviewed are based on network flow models and linear programming techniques embedded within binary search procedures.