Concepts of Combinatorial Optimization

Nonfiction, Science & Nature, Mathematics, Combinatorics
Cover of the book Concepts 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: 9781119015079
Publisher: Wiley Publication: August 8, 2014
Imprint: Wiley-ISTE Language: English
Author:
ISBN: 9781119015079
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 Advanced Building Technologies for Sustainability by
Cover of the book Data Analysis by
Cover of the book Biomolecular Information Processing by
Cover of the book The GL Diet For Dummies by
Cover of the book A Companion to Nazi Germany by
Cover of the book Erneuerbare Energie by
Cover of the book Post-Disaster Reconstruction of the Built Environment by
Cover of the book The 3 Power Values by
Cover of the book Design of Jigs, Fixtures and Press Tools by
Cover of the book Paediatric Advanced Life Support by
Cover of the book Philosophy and Resistance in the Crisis by
Cover of the book We Are All Leaders by
Cover of the book Body Area Communications by
Cover of the book Using Commercial Contracts by
Cover of the book Non-conventional Electrical Machines 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