Concepts of Combinatorial Optimization, Volume 1 (Hardcover). Este artículo no está disponible.
Idioma: inglés
Editorial: ISTE Ltd and John Wiley & Sons Inc, London, 2010
- Tapa dura
- Nuevo

Librería: AussieBookSeller, Truganina, VIC, AustraliaAussieBookSeller
Vendedor de IberLibro desde 22 de junio de 2007
Condición: Nuevo
EUR 304,71
Descripción del artículo del vendedor
Hardcover. 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. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability. …
N° de ref. del artículo 9781848211476
- Título
- Concepts of Combinatorial Optimization, Volume 1 (Hardcover)
- Autor
- Vangelis Th. Paschos
- Editorial
- ISTE Ltd and John Wiley & Sons Inc, London
- Año de publicación
- 2010
- Estado
- new
- Encuadernación
- Hardcover
- Idioma
- inglés
- ISBN 10
- 1848211473
- ISBN 13
- 9781848211476
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.
“Sinopsis” puede pertenecer a otra edición de este título.
Acerca del autor
“Acerca de” puede pertenecer a otra edición de este título.