Beschreibung
The problems of guillotine rectangular cutting allow pseudo polynomial algorithms for their solution. Intuitive reflection by analogy with integer linear programming lead up to the hypothesis about an existence of a polynomial algorithm for the problem of optimum guillotine cutting of the rectangle into fixed kinds of small rectangles. In this monograph this hypothesis is justified for a few classes of problems.
Autorenporträt
Arslanov M.Z., doctor of physical and mathematical sciences, professor of Informatics, chief of the laboratory of pattern recognition and decision making, Institute of computation and information technologies, Almaty, Kazakhstan.
