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 The Pauli Exclusion Principle by
Cover of the book Bio-Based Solvents by
Cover of the book Handbook of Transition Metal Polymerization Catalysts by
Cover of the book Adhesion in Pharmaceutical, Biomedical, and Dental Fields by
Cover of the book Global Displacements by
Cover of the book Mentoring Undergraduate Students by
Cover of the book Supply Chain Performance and Evaluation Models by
Cover of the book The Biology of Parasites by
Cover of the book Occupational Therapy Evidence in Practice for Mental Health by
Cover of the book Generational Selling Tactics that Work by
Cover of the book Essential Option Strategies by
Cover of the book Handbook of Coal Analysis by
Cover of the book Handbook of Cyanobacterial Monitoring and Cyanotoxin Analysis by
Cover of the book Enterprise Risk Management Best Practices by
Cover of the book Advanced Distillation Technologies 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