Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2ISBN: 978-1-84821-148-3
Hardcover
687 pages
August 2010, Wiley-ISTE
|
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.
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.