"Sinopsis" puede pertenecer a otra edición de este libro.
"Sobre este título" puede pertenecer a otra edición de este libro.
Librería: Brook Bookstore On Demand, Napoli, NA, Italia
Condición: new. Questo è un articolo print on demand. Nº de ref. del artículo: 486febdf8148e7864e593647849e0b90
Cantidad disponible: Más de 20 disponibles
Librería: StainesBook, Weybridge, SURRE, Reino Unido
Condición: New. A brand new book in pristine condition. Showing zero signs of shelf wear, creases, or damage. Nº de ref. del artículo: SPRINGERNEW30289
Cantidad disponible: 1 disponibles
Librería: Basi6 International, Irving, TX, Estados Unidos de America
Condición: Brand New. New. Delivery takes 25-30 days. Excellent Customer Service. Nº de ref. del artículo: POD-287084
Cantidad disponible: 10 disponibles
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9783030639198_new
Cantidad disponible: Más de 20 disponibles
Librería: moluna, Greven, Alemania
Condició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. Nº de ref. del artículo: 448686179
Cantidad disponible: Más de 20 disponibles
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Buch. 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. Nº de ref. del artículo: 9783030639198
Cantidad disponible: 2 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. 1st ed. 2021 edition NO-PA16APR2015-KAP. Nº de ref. del artículo: 26386905345
Cantidad disponible: 4 disponibles
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Buch. 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. Nº de ref. del artículo: 9783030639198
Cantidad disponible: 1 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Buch. 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. Nº de ref. del artículo: 9783030639198
Cantidad disponible: 1 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand. Nº de ref. del artículo: 393743070
Cantidad disponible: 4 disponibles