Integer Programming and Combinatorial OptimizationThe course is a comprehensive introduction to the theory, algorithms and applications of integer optimization and is organized in four parts: formulations and relaxations, algebra and geometry of integer optimization, algorithms for integer optimization, and extensions of integer optimization.
The human being aspires to the best possible performance. Both individuals and enterprises are looking for optimal - in other words, the best possible - solutions for situations or problems they face. Most of these problems can be expressed in mathematical terms, and so the methods of optimization undoubtedly render a significant aid.
The goal of the Encyclopedia of Optimization is to introduce the reader to a complete set of topics that show the spectrum of research, the richness of ideas, and the breadth of applications that has come from this field.
DYNAMIC OPTIMIZATION AND DIFFERENTIAL GAMES has been written to address the increasing number of Operations Research and Management Science problems (that is, applications) that involve the explicit consideration of time and of gaming among multiple agents. It is a book that will be used both as a textbook and as a reference and guide to engineers, operation researchers, applied mathematicians and social scientists whose work involves the theoretical aspects of dynamic optimization and differential games.
