Paradigms of Combinatorial Optimization

<p>Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management.  The three volumes of the Combinatorial Optimization series aim to cover a wide range  of topics in this area. These topics also deal with fundamental notions and approaches as with several classical applications of combinatorial optimization.<br /> <br /> <i>Concepts of Combinatorial Optimization</i>, is divided into three parts:<br /> – On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;<br /> – Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;<br /> – Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.</p>