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 Dewhurst's Textbook of Obstetrics and Gynaecology by
Cover of the book Creative Lighting by
Cover of the book Wind Resource Assessment by
Cover of the book Disordered Pharmaceutical Materials by
Cover of the book Contemplative Practices in Higher Education by
Cover of the book Human Factors in Control Room Design by
Cover of the book Incorporating Your Business For Dummies by
Cover of the book The Wiley Handbook of Ethnography of Education by
Cover of the book Digital Electronics 1 by
Cover of the book An Imaginary Racism by
Cover of the book Pocket Guide to Teaching for Clinical Instructors by
Cover of the book Fundamentals of Statistical Experimental Design and Analysis by
Cover of the book The Law of Fundraising by
Cover of the book Catheter Ablation of Cardiac Arrhythmias by
Cover of the book Effective Project Management 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