Abstract
Starting with the empty container problem a special linear 0-1-programming problem is stated. The application of this problem allows the optimal use of the main storage of a computing system in a certain sense. An approximating algorithm for solving this task is given, and some numerical results are mentioned.
AMS 1980 Subject Classification: