Applications of Combinatorial Optimization

Nonfiction, Science & Nature, Mathematics, Combinatorics
Cover of the book Applications 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: 9781119015246
Publisher: Wiley Publication: August 8, 2014
Imprint: Wiley-ISTE Language: English
Author:
ISBN: 9781119015246
Publisher: Wiley
Publication: August 8, 2014
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 aim 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.

Concepts of Combinatorial Optimization, is divided into three parts:
- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

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 aim 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.

Concepts of Combinatorial Optimization, is divided into three parts:
- On the complexity of combinatorial optimization problems, presenting basics about worst-case and randomized complexity;
- Classical solution methods, presenting the two most-known methods for solving hard combinatorial optimization problems, that are Branch-and-Bound and Dynamic Programming;
- Elements from mathematical programming, presenting fundamentals from mathematical programming based methods that are in the heart of Operations Research since the origins of this field.

More books from Wiley

Cover of the book The Handbook of Global Climate and Environment Policy by
Cover of the book Nikon D60 For Dummies by
Cover of the book Marx and Foucault by
Cover of the book Encyclopedia of Polymer Blends, Volume 2 by
Cover of the book Psychiatry by
Cover of the book Emotional Intelligence Pocketbook by
Cover of the book Laruelle by
Cover of the book Share Investing For Dummies by
Cover of the book Robotic Microassembly by
Cover of the book Essential Tools for Organisational Performance by
Cover of the book Computational Acoustics by
Cover of the book Office 2008 for Mac All-in-One For Dummies by
Cover of the book The Multilevel Fast Multipole Algorithm (MLFMA) for Solving Large-Scale Computational Electromagnetics Problems by
Cover of the book Educational Neuroscience by
Cover of the book Neuroscience-based Cognitive Therapy 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