Paradigms of Combinatorial Optimization

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.