Name: Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2 (en Inglés)
SKU: 3135196
Price: 393.89 USD
Availability: InStock
Author: Paschos, Vangelis Th

portada Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2 (en Inglés)

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2 (en Inglés)

Formato

Libro Físico

Editorial

Wiley-Iste

Autor

Paschos, Vangelis Th

Idioma

Inglés

N° páginas

687

Encuadernación

Tapa Dura

ISBN

9781848211483

ISBN13

9781848211483

Categorías

Matemáticas discretas
Probabilidad y estadística

Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2 (en Inglés)

Paschos, Vangelis Th (Autor) · Wiley-Iste · Tapa Dura

Libro Nuevo Importado

Envío: 21 a 29 días háb.

$ 787.77$ 393.89

-50%

Costos de importación incluídos en el precio ✅

Libro Nuevo

Quedan 15 unidades

$ 393.89

Llega entre el 17 Sep y el 01 Oct a Quito, Pichincha. Seleccionar ubicación

Agregar a lista de deseos

Reseña del libro "Paradigms of Combinatorial Optimization: Problems and New Approaches, Volume 2 (en Inglés)"

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. "Paradigms of Combinatorial Optimization" is divided in two parts: - Paradigmatic Problems, that handles several famous combinatorial optimization problems as max cut, min coloring, optimal satisfiability tsp, etc., the study of which has largely contributed to both the development, the legitimization and the establishment of the Combinatorial Optimization as one of the most active actual scientific domains; - Classical and New Approaches, that presents the several methodological approaches that fertilize and are fertilized by Combinatorial optimization such as: Polynomial Approximation, Online Computation, Robustness, etc., and, more recently, Algorithmic Game Theory.