Discrete extremal problems

Precise and heuristic algorithms for solving various classes of discrete extremal problems are considered as are the relations between the class of discrete extremal problems and linear programming and are extremal problems from the point of view of the theory of polynomial completeness. A class of bottleneck optimization problems and stability in discrete extremal problems with a linear object function are also considered.