Concepts of Combinatorial Optimization

Combinatorial optimization is a multidisciplinary scientific area, lying in the interface of three major scientific domains: mathematics, theoretical computer science and management. <p>The three volumes of the <b>Combinatorial Optimization series</b> aims 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.</p> <p><i>Concepts of Combinatorial Optimization</i>, is divided into three parts:</p> <ul> <li>On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity;</li> <li>Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;</li> <li>Elements from mathematical programming, that presents fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.</li> </ul>