Andere Kunden interessierten sich auch für
![Paradigms of Combinatorial Optimization]( "Paradigms of Combinatorial Optimization")
Paradigms of Combinatorial Optimization413,99 €![Introduction to the Theory of Error-Correcting Codes]( "Introduction to the Theory of Error-Correcting Codes")
Introduction to the Theory of Error-Correcting Codes222,99 €![Discrete Mathematics]( "Discrete Mathematics")
Discrete Mathematics408,99 €![Kompendium der diskreten Mathematik]( "Kompendium der diskreten Mathematik")
Kompendium der diskreten Mathematik34,95 €![Algorithmische Graphentheorie]( "Algorithmische Graphentheorie")
Algorithmische Graphentheorie39,95 €![Combinatorial Number Theory]( "Combinatorial Number Theory")
Combinatorial Number Theory147,99 €![Proofs from the Book]( "Proofs from the Book")
Proofs from the Book12,99 €
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 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.
Concepts of Combinatorial Optimization, is divided into three parts:
On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity;
Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
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.
The three volumes of the Combinatorial Optimization series 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.
Concepts of Combinatorial Optimization, is divided into three parts:
On the complexity of combinatorial optimization problems, that presents basics about worst-case and randomized complexity;
Classical solution methods, that presents the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
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.