Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Mankowski, Michal; Moshkov, Mikhail
ISBN 10: 3030639193 ISBN 13: 9783030639198
Editorial: Springer, 2021
Nuevos
Encuadernación de tapa dura
Librería:
Ria Christie Collections, Uxbridge, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 25 de marzo de 2015
Este artículo en concreto ya no está disponible.
Descripción
Descripción:
In. N° de ref. del artículo ria9783030639198_new
Sinopsis:
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.
De la contraportada:
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.
"Sobre este título" puede pertenecer a otra edición de este libro.
Detalles bibliográficos
Título: Dynamic Programming Multi-Objective ...
Editorial: Springer
Año de publicación: 2021
Encuadernación: Encuadernación de tapa dura
Condición: New
Los mejores resultados en AbeBooks
Imagen de archivo
Dynamic Programming Multi-Objective Combinatorial Optimization.
Publicado por
Cham, Springer International Publishing., 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Antiguo o usado
Tapa dura
Original o primera edición
Librería: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Alemania
Calificación del vendedor: 5 de 5 estrellas
1st 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. Nº de ref. del artículo: 2754LB
Cantidad disponible: 1 disponibles
Imagen del vendedor
Dynamic Programming Multi-Objective Combinatorial Optimization
Publicado por
Springer International Publishing, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuevo
Tapa dura
Librería: moluna, Greven, Alemania
Calificación del vendedor: 5 de 5 estrellas
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
Imagen de archivo
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Librería: Lucky's Textbooks, Dallas, TX, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: ABLIING23Mar3113020025017
Cantidad disponible: Más de 20 disponibles
Imagen del vendedor
Dynamic Programming Multi-Objective Combinatorial Optimization
Publicado por
Springer International Publishing, Springer Nature Switzerland Feb 2021, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuevo
Tapa dura
Librería: buchversandmimpf2000, Emtmannsberg, BAYE, Alemania
Calificación del vendedor: 5 de 5 estrellas
Buch. Condición: Neu. 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: 2 disponibles
Imagen del vendedor
Dynamic Programming Multi-Objective Combinatorial Optimization
Publicado por
Springer International Publishing Feb 2021, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuevo
Tapa dura
Librería: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Alemania
Calificación del vendedor: 5 de 5 estrellas
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
Imagen del vendedor
Dynamic Programming Multi-Objective Combinatorial Optimization
Publicado por
Springer International Publishing, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuevo
Tapa dura
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Calificación del vendedor: 5 de 5 estrellas
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
Imagen de archivo
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Librería: California Books, Miami, FL, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Condición: New. Nº de ref. del artículo: I-9783030639198
Cantidad disponible: Más de 20 disponibles
Imagen de archivo
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Librería: dsmbooks, Liverpool, Reino Unido
Calificación del vendedor: 4 de 5 estrellas
Hardcover. Condición: New. New. book. Nº de ref. del artículo: D8F0-0-M-3030639193-6
Cantidad disponible: 1 disponibles
Imagen de archivo
Dynamic Programming Multi-Objective Combinatorial Optimization
Librería: Revaluation Books, Exeter, Reino Unido
Calificación del vendedor: 5 de 5 estrellas
Hardcover. Condición: Brand New. 228 pages. 9.25x6.10x0.67 inches. In Stock. Nº de ref. del artículo: x-3030639193
Cantidad disponible: 2 disponibles