The book «No644 Combinatorial algorithms» by Boris Vladimirovich Cherkassky is a fascinating and deep dive into the world of combinatorics and algorithms, which are the basis of many modern technologies and scientific research. This work is not just a textbook, but a real find for those who want to understand how algorithms work and how they are applied in various fields, from computer science to mathematical modeling. In his book, Cherkassky explores combinatorial algorithms that help solve complex problems associated with the selection, ordering and distribution of objects. The reader will learn how to effectively find solutions in conditions of limitations and uncertainty, which makes this book especially relevant for students, graduate students and specialists in computer science, mathematics and engineering. If you are interested in topics such as optimization, theoretical computer science or even artificial intelligence, then this book will become a real treasure for you. One of the key topics raised in the book is the importance of combinatorial algorithms in solving practical problems. Cherkassky masterfully demonstrates how theoretical concepts can be applied in practice, which makes the material accessible and understandable to a wide audience. It not only explains complex ideas, but also illustrates them with real-life examples, allowing the reader to see how combinatorial algorithms can change the approach to solving problems in various fields - from logistics to bioinformatics. The book also touches on such important aspects as the effectiveness of algorithms, their temporal and spatial characteristics. Cherkassky pays attention to both classical and modern methods, which makes the material relevant and useful for those who want to be at the forefront in their field. Readers will be able to learn about different approaches to the development of algorithms, their analysis and optimization, which will help them not only in their studies, but also in their professional activities. Cherkassky's style is distinguished by clarity and logical presentation, which makes his work accessible to understanding even for those who are just beginning to get acquainted with combinatorics. His previous work, such as "Algorithms and Data Structures" and "