Paradigms of Combinatorial Optimization

VT Paschos

ISBN 10: 1848211481 ISBN 13: 9781848211483
Published by John Wiley & Sons, 2010
New Gebunden

From moluna, Greven, Germany Seller rating 5 out of 5 stars 5-star rating, Learn more about seller ratings

AbeBooks Seller since 9 July 2020

This specific item is no longer available.

About this Item

Description:

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 . Seller Inventory # 556580824

Report this item

Synopsis:

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.

About the Author:

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.

"About this title" may belong to another edition of this title.

Bibliographic Details

Title: Paradigms of Combinatorial Optimization
Publisher: John Wiley & Sons
Publication Date: 2010
Binding: Gebunden
Condition: New

Top Search Results from the AbeBooks Marketplace