Definition: Shuttle algorithm
A method for finding lower and upper cell bounds by iterating through dependencies between cell counts. There exist many dependencies between individual counts and aggregations of counts in contingency tables. Where not all individual counts are known, but some aggregated counts are known, the dependencies can be used to make inferences about the missing counts. The Shuttle algorithm constructs a specific subset of the many possible dependencies and recursively iterates through them in order to find bounds on missing counts. As many dependencies will involve unknown counts, the dependencies need to be expressed in terms of inequalities involving lower and upper bounds, rather than simple equalities. The algorithm ends when a complete iteration fails to tighten the bounds on any cell counts.
ESSNet SDC (Network of Excellence in the European Statistical System in the field of Statistical Disclosure Control), under the coordination of Anco HUNDEPOOL, "Handbook on Statistical Disclosure Control", version 1.2 (2010 Edition)