- We will send in 10–14 business days.
/images/books/12392612/9781848216563.jpg)
- Author: Vangelis Th Paschos
- Publisher: Wiley-ISTE
- ISBN-10: 1848216564
- ISBN-13: 9781848216563
- Format: 15.8 x 23.4 x 2.8 cm, hardcover
- Language: English
- SAVE -10% with code: EXTRA
Reviews
Description
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.
EXTRA 10 % discount with code: EXTRA
The promotion ends in 19d.13:41:41
The discount code is valid when purchasing from 10 €. Discounts do not stack.
- Author: Vangelis Th Paschos
- Publisher: Wiley-ISTE
- ISBN-10: 1848216564
- ISBN-13: 9781848216563
- Format: 15.8 x 23.4 x 2.8 cm, hardcover
- Language: English 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.
Reviews