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 Optimizationseries aims to cover a wide range of topics in this area. Thesetopics also deal with fundamental notions and approaches as withseveral classical applications of combinatorial optimization.
Concepts of Combinatorial Optimization, is divided intothree parts:
* On the complexity of combinatorial optimization problems, thatpresents basics about worst-case and randomized complexity;
* Classical solution methods, that presents the two most-knownmethods for solving hard combinatorial optimization problems, thatare Branch-and-Bound and Dynamic Programming;
* Elements from mathematical programming, that presentsfundamentals from mathematical programming based methods that arein the heart of Operations Research since the origins of thisfield.
Auflage
Sprache
Verlagsgruppe
Dateigröße
ISBN-13
978-1-118-60019-1 (9781118600191)
Schweitzer Klassifikation
Vangelis Th. Paschos is Exceptional Professor of Computer Science and Combinatorial Optimization at the University Paris-Dauphine and chairman of the LAMSADE (Laboratory for the Modeling and the Analysis of Decision Aiding Systems). His research interests include the complexity theory, the theory of the polynomial approximation of NP-hard problems, the probabilistic combinatorial optimization, the on-line computation and the exact solution of NP-hard problems. He is the author of more than a hundred and fifty research papers. He is also member of the editorial board of several international scientific journals.
