Methods and algorithms for solving applied problems of discrete optimization

This book for everyone who, without special mathematical education, wants to learn how to apply optimization methods to solve practical problems. It discusses applied tasks from various fields of activity, their mathematical models and solutions based on modern optimization theory. Particular attention to discrete tasks is due to their practical importance and less knowledge in comparison with continuous tasks. New algorithms are presented, based on the integrated use of dynamic programming and the method of branches and borders, brought to practical implementations. Their effectiveness is confirmed by the results of solving problems of a large dimension. The mathematical apparatus used in the book is minimized, which provides an understanding of methods of optimization by persons who do not have special mathematical training, for whom mathematics is not a profession. The book is based on a course of lectures at the Institute of Cybernetics of the Russian Technical University (MIREA RTU) and practical experience in developing algorithms and software for solving problems of large dimension. The book can be useful to students and graduate students studying optimization methods, as well as specialists faced with problems of searching for optimal solutions in various fields of activity