Concepts of Combinatorial Optimization

By Paul Kelly

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

• Format: Hardcover
• Language: English
• ISBN: 1848211473
• ISBN13: 9781848211476
• Release Date: August 2010
• Publisher: Wiley-Iste
• Length: 368 Pages
• Weight: 1.50 lbs.
• Dimensions: 1.0" x 6.1" x 9.2"