Skip to main content
Log in

Definition of extraction files and their optimization by zero-one programming

  • Published:
BIT Numerical Mathematics Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

References

  1. E. L. Lawler and M. D. Bell,A Method for Solving Discrete Optimization Problems, Operations Research, Vol. 14 (Nov.–Dec. 1966), pp. 1098–1112.

    Google Scholar 

  2. E. L. Lawler and D. E. Wood,Branch-and-Bound Methods: A Survey, Operations Research, Vol. 14 (July–Aug. 1966), pp. 699–719.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01939262

Key words

Navigation