- English
- ePUB (mobile friendly)
- Available on iOS & Android
Concepts of Combinatorial Optimization
About This Book
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. Concepts of Combinatorial Optimization, is divided into three parts:
- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- 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.
Frequently asked questions
Information
Table of contents
- Cover
- Table of Contents
- Title Page
- Copyright
- Preface
- Part I: Complexity of Combinatorial Optimization Problems
- Part II: Classical Solution Methods
- Part III: Elements from Mathematical Programming
- General Bibliography
- List of Authors
- Index
- Summary of Volume 2
- Summary of Volume 3