Discrete Optimization. Models, methods, algorithms

This book is for everyone who, without having special mathematical education, wants to know how to apply optimization methods to solve practical tasks. It addresses applied tasks from various fields of activity, their mathematical models and solutions based on the current theory of optimization. Special attention to discrete tasks is due to their practical importance and less study compared with continuous tasks.
New algorithms are given, based on the integrated application of dynamic programming and the method of branches and borders, brought to practical implementations. Their effectiveness is confirmed by the results of solving the problems of large dimension.
The mathematical apparatus used in the book is minimized and is explained in the text, which ensures an understanding of optimization methods by persons who do not have special mathematical training for which mathematics is not a profession.
The book is based on a course of lectures that the author read at the Institute of Cybernetics of the Moscow State University of Information Technologies, Radio Engineering and Electronics (Mirea), and practical experience in the development of algorithms and software to solve the problems of large dimension.
The book can be useful to students and graduate students studying optimization methods, as well as specialists encountered with the problems of finding optimal solutions in various fields of activity.
The application provides information on training computer programs that can be useful when studying optimization methods