Name: Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications (Studies in Systems, Decision and Control) (en Inglés)
Price: 756110.00 COP
Availability: InStock
Author: Michael Z. Zgurovsky; Alexander A. Pavlov
ISBN: 9783319989761

portada Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications (Studies in Systems, Decision and Control) (en Inglés)

Formato

Libro Físico

Editorial

Springer

Autor

Michael Z. Zgurovsky; Alexander A. Pavlov

Año

2018

Idioma

Inglés

N° páginas

518

Encuadernación

Tapa Dura

ISBN13

9783319989761

N° edición

2019

Categorías

Cam: manufactura asistida por ordenador
Diseño asistido por ordenador (cad)

Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications (Studies in Systems, Decision and Control) (en Inglés)

Michael Z. Zgurovsky; Alexander A. Pavlov (Autor) · Springer · Tapa Dura

Libro Nuevo

$ 756.110

$ 1.260.183

Ahorras: $ 504.073

40% descuento

Envío normal

Origen: Estados Unidos (Costos de importación incluídos en el precio)

Se enviará desde nuestra bodega entre el Viernes 07 de Junio y el Viernes 21 de Junio.

Lo recibirás en cualquier lugar de Colombia entre 1 y 5 días hábiles luego del envío.

Reseña del libro "Combinatorial Optimization Problems in Planning and Decision Making: Theory and Applications (Studies in Systems, Decision and Control) (en Inglés)"

The book focuses on the next fields of computer science: combinatorial optimization, scheduling theory, decision theory, and computer-aided production management systems. It also offers a quick introduction into the theory of PSC-algorithms, which are a new class of efficient methods for intractable problems of combinatorial optimization. A PSC-algorithm is an algorithm which includes: sufficient conditions of a feasible solution optimality for which their checking can be implemented only at the stage of a feasible solution construction, and this construction is carried out by a polynomial algorithm (the first polynomial component of the PSC-algorithm); an approximation algorithm with polynomial complexity (the second polynomial component of the PSC-algorithm); also, for NP-hard combinatorial optimization problems, an exact subalgorithm if sufficient conditions were found, fulfilment of which during the algorithm execution turns it into a polynomial complexity algorithm. Practitioners and software developers will find the book useful for implementing advanced methods of production organization in the fields of planning (including operative planning) and decision making. Scientists, graduate and master students, or system engineers who are interested in problems of combinatorial optimization, decision making with poorly formalized overall goals, or a multiple regression construction will benefit from this book.