Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 163,95
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 200,10
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New.
Librería: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
EUR 198,40
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Idioma: Inglés
Publicado por Springer International Publishing, 2018
ISBN 10: 3030075524 ISBN 13: 9783030075521
Librería: preigu, Osnabrück, Alemania
EUR 140,00
Cantidad disponible: 5 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Combinatorial Optimization Problems in Planning and Decision Making | Theory and Applications | Alexander A. Pavlov (u. a.) | Taschenbuch | xiv | Englisch | 2018 | Springer International Publishing | EAN 9783030075521 | Verantwortliche Person für die EU: Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg, juergen[dot]hartmann[at]springer[dot]com | Anbieter: preigu.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing, 2018
ISBN 10: 3030075524 ISBN 13: 9783030075521
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 160,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - 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.
Librería: Kennys Bookstore, Olney, MD, Estados Unidos de America
EUR 246,58
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 126,26
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: new. Questo è un articolo print on demand.
Idioma: Inglés
Publicado por Springer International Publishing Dez 2018, 2018
ISBN 10: 3030075524 ISBN 13: 9783030075521
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 160,49
Cantidad disponible: 2 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 532 pp. Englisch.
Idioma: Inglés
Publicado por Springer International Publishing, 2018
ISBN 10: 3030075524 ISBN 13: 9783030075521
Librería: moluna, Greven, Alemania
EUR 136,16
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Introduces PSC-algorithmsHelps solving operational planning problemsCovers computer-aided production management systemsMichael Z. Zgurovsky and Alexander A. Pavlov, National Technical Univer.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 205,59
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing Dez 2018, 2018
ISBN 10: 3030075524 ISBN 13: 9783030075521
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 160,49
Cantidad disponible: 1 disponibles
Añadir al carritoTaschenbuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Springer Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 532 pp. Englisch.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 223,57
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.