Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2

Paschos, Vangelis Th

ISBN 10: 1848211481 / ISBN 13: 9781848211483

Editore: ISTE Ltd and John Wiley & Sons Inc, 2010

Riguardo questo articolo

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. Editor(s): Paschos, Vangelis Th. Num Pages: 720 pages. BIC Classification: PBU; TJ. Category: (P) Professional & Vocational. Dimension: 235 x 163 x 44. Weight in Grams: 1184. . 2010. 1st Edition. Hardcover. . . . .

Codice articolo V9781848211483

Dati bibliografici

• Titolo: Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2
• Editore: ISTE Ltd and John Wiley & Sons Inc
• Data di pubblicazione: 2010
• Lingua: Inglese
• ISBN 10: 1848211481
• ISBN 13: 9781848211483
• Rilegatura: Rilegato
• Edizione: prima edizione
• Condizione: New

Descrizione articolo

Riassunto

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.

“Paradigms of Combinatorial Optimization” is divided in two parts:
• Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains;
• Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.

Informazioni sull?autore

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.