Three broad classes of extreme combinatorial problems are outlined: on number partitions, on set systems, and on vector systems. The possibilities of practical use of solutions of extreme combinatorial problems in computer science and computer engineering are demonstrated.