Idioma: Inglés
Publicado por Cham, Springer International Publishing., 2021
ISBN 10: 3030639193 ISBN 13: 9783030639198
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
Original o primera edición
EUR 20,00
Cantidad disponible: 1 disponibles
Añadir al carrito1st ed. 2021. XIV, 214 p. Hardcover. Versand aus Deutschland / We dispatch from Germany via Air Mail. Einband bestoßen, daher Mängelexemplar gestempelt, sonst sehr guter Zustand. Imperfect copy due to slightly bumped cover, apart from this in very good condition. Stamped. Studies in Systems, Decision and Control, 331. Sprache: Englisch.
Librería: Ria Christie Collections, Uxbridge, Reino Unido
EUR 175,88
Cantidad disponible: Más de 20 disponibles
Añadir al carritoCondición: New. In.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 193,99
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: New.
Librería: GreatBookPrices, Columbia, MD, Estados Unidos de America
EUR 201,83
Cantidad disponible: 15 disponibles
Añadir al carritoCondición: As New. Unread book in perfect condition.
Librería: Books Puddle, New York, NY, Estados Unidos de America
EUR 227,02
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP.
Idioma: Inglés
Publicado por Springer International Publishing, 2021
ISBN 10: 3030639193 ISBN 13: 9783030639198
Librería: AHA-BUCH GmbH, Einbeck, Alemania
EUR 171,19
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. Druck auf Anfrage Neuware - Printed after ordering - This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model.As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem.The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses.
Librería: Revaluation Books, Exeter, Reino Unido
EUR 249,78
Cantidad disponible: 2 disponibles
Añadir al carritoHardcover. Condición: Brand New. 228 pages. 9.25x6.10x0.67 inches. In Stock.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
EUR 134,27
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, 2021
ISBN 10: 3030639193 ISBN 13: 9783030639198
Librería: moluna, Greven, Alemania
EUR 144,94
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. Considers extensions of dynamic programming for the study of multi-objective combinatorial optimization problemsProposes a fairly universal approach based on circuits without repetitions in which each eleme.
Idioma: Inglés
Publicado por Springer International Publishing Feb 2021, 2021
ISBN 10: 3030639193 ISBN 13: 9783030639198
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
EUR 171,19
Cantidad disponible: 2 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model.As applications, this book studies eleven known combinatorial optimization problems: matrix chain multiplication, global sequence alignment, optimal paths in directed graphs, binary search trees, convex polygon triangulation, line breaking (text justification), one-dimensional clustering, optimal bitonic tour, segmented least squares, optimization of matchings in trees, and 0/1 knapsack problem.The results presented are useful for researchers in combinatorial optimization. This book is also useful as the basis for graduate courses. 228 pp. Englisch.
Idioma: Inglés
Publicado por Springer International Publishing, Springer International Publishing Feb 2021, 2021
ISBN 10: 3030639193 ISBN 13: 9783030639198
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
EUR 171,19
Cantidad disponible: 1 disponibles
Añadir al carritoBuch. Condición: Neu. This item is printed on demand - Print on Demand Titel. Neuware -This book introduces a fairly universal approach to the design and analysis of exact optimization algorithms for multi-objective combinatorial optimization problems. It proposes the circuits without repetitions representing the sets of feasible solutions along with the increasing and strictly increasing cost functions as a model for such problems. The book designs the algorithms for multi-stage and bi-criteria optimization and for counting the solutions in the framework of this model.Springer-Verlag GmbH, Tiergartenstr. 17, 69121 Heidelberg 228 pp. Englisch.
Librería: Majestic Books, Hounslow, Reino Unido
EUR 237,05
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. Print on Demand.
Librería: Biblios, Frankfurt am main, HESSE, Alemania
EUR 237,63
Cantidad disponible: 4 disponibles
Añadir al carritoCondición: New. PRINT ON DEMAND.