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 Production Scheduling by
Cover of the book Analysis and Design of Transimpedance Amplifiers for Optical Receivers by
Cover of the book An Introduction to Language by
Cover of the book Sexual Offending by
Cover of the book Ice Templating and Freeze-Drying for Porous Materials and Their Applications by
Cover of the book Sociobiology of Caviomorph Rodents by
Cover of the book Quantum Teleportation and Entanglement by
Cover of the book Mechanical Instability by
Cover of the book Essential Mathematics for Market Risk Management by
Cover of the book Geothermal Heat Pump and Heat Engine Systems by
Cover of the book Visual Guide to Hedge Funds by
Cover of the book Getting Better at Private Practice by
Cover of the book J.K. Lasser's 1001 Deductions and Tax Breaks 2012 by
Cover of the book Quantum Control of Molecular Processes by
Cover of the book Media Education 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