Paradigms of Combinatorial Optimization

Problems and New Approaches, Volume 2

Nonfiction, Science & Nature, Mathematics, Discrete Mathematics
Cover of the book Paradigms of Combinatorial Optimization by , Wiley
View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart
Author: ISBN: 9781118600184
Publisher: Wiley Publication: May 6, 2013
Imprint: Wiley-ISTE Language: English
Author:
ISBN: 9781118600184
Publisher: Wiley
Publication: May 6, 2013
Imprint: Wiley-ISTE
Language: English

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.

View on Amazon View on AbeBooks View on Kobo View on B.Depository View on eBay View on Walmart

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.

More books from Wiley

Cover of the book Essentials of Disease in Wild Animals by
Cover of the book Graphic Standards Field Guide to Hardscape by
Cover of the book Spark by
Cover of the book The Hedge Fund Book by
Cover of the book ABC of Asthma by
Cover of the book Geotechnical Problem Solving by
Cover of the book Organization Practice by
Cover of the book Advanced Catalytic Materials by
Cover of the book Abdominal-Pelvic MRI by
Cover of the book Hepatology by
Cover of the book Applied Food Protein Chemistry by
Cover of the book War and Political Theory by
Cover of the book A Companion to the City of Rome by
Cover of the book Internet Communications Using SIP by
Cover of the book Monitoring and Modeling the Deepwater Horizon Oil Spill by
We use our own "cookies" and third party cookies to improve services and to see statistical information. By using this website, you agree to our Privacy Policy