Approximation of optima of integer programs of the packing—covering type

Articles in the same Issue

1. Titelei
2. Minimal points of a supercritical branching walk on the lattice N^r₀ and many-type Galton-Watson branching processes
3. Convergence conditions for weighted branching processes
4. Matchings up to the permutations which form a Latin rectangle
5. A remark on the Galton-Watson forests
6. On asymptotic expansions in local limit theorems for equiprobable schemes of allocating particles to distinguishable cells
7. Approximation of optima of integer programs of the packing—covering type
8. A local limit theorem for the distribution of a part of the spectrum of a random binary function
9. On the radius of stability of a vector problem of linear Boolean programming
10. A counter-example to the hypothesis on the maximum number of integer vertices of a multi-index axial transportation polytope