Abstract
In commercial and administrative ADP it often happens that there is one large master file and many output files are to be made from this. One possible solution to avoid using the master file many times is to construct from it a few extraction files and from these compile the output files. In the following paper a method is described to define the extraction files and to optimize their contents by zero-one programming. An algorithm and an example are presented in a simplified case.
Similar content being viewed by others
References
E. L. Lawler and M. D. Bell,A Method for Solving Discrete Optimization Problems, Operations Research, Vol. 14 (Nov.–Dec. 1966), pp. 1098–1112.
E. L. Lawler and D. E. Wood,Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14 (July–Aug. 1966), pp. 699–719.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Seppälä, Y. Definition of extraction files and their optimization by zero-one programming. BIT 7, 206–215 (1967). https://doi.org/10.1007/BF01939262
Issue Date:
DOI: https://doi.org/10.1007/BF01939262