Paradigms of Combinatorial Optimization
413,99 €
inkl. MwSt.
Versandkostenfrei*
Versandfertig in über 4 Wochen
  • Gebundenes Buch

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 tocover a wide range of topics in this area. These topics also dealwith fundamental notions and approaches as with several classicalapplications of combinatorial optimization.
"Paradigms of Combinatorial Optimization" is divided intwo parts: - Paradigmatic Problems, that handles several famouscombinatorial optimization problems as max cut, min…mehr

Andere Kunden interessierten sich auch für
Produktbeschreibung
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 tocover a wide range of topics in this area. These topics also dealwith fundamental notions and approaches as with several classicalapplications of combinatorial optimization.

"Paradigms of Combinatorial Optimization" is divided intwo parts:
- Paradigmatic Problems, that handles several famouscombinatorial optimization problems as max cut, min coloring,optimal satisfiability tsp, etc., the study of which has largelycontributed to both the development, the legitimization and theestablishment of the Combinatorial Optimization as one of the mostactive actual scientific domains;
- Classical and New Approaches, that presents the severalmethodological approaches that fertilize and are fertilized byCombinatorial optimization such as: Polynomial Approximation,Online Computation, Robustness, etc., and, more recently,Algorithmic Game Theory.
Autorenporträt
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.