Articoli correlati a Dynamic Programming Multi-objective Combinatorial Optimizati...
Sinossi
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.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dalla quarta di copertina
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.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Compra nuovo
Visualizza questo articolo
EUR 157,17
EUR 6,81 per la spedizione in U.S.A.
Destinazione, tempi e costi
Risultati della ricerca per Dynamic Programming Multi-objective Combinatorial Optimizati...
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization.
Editore:
Cham, Springer International Publishing., 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Antico o usato
Rilegato
Prima edizione
Da: Universitätsbuchhandlung Herta Hold GmbH, Berlin, Germania
Valutazione del venditore 5 su 5 stelle
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. Codice articolo 2754LB
Quantità: 1 disponibili
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Da: Best Price, Torrance, CA, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. SUPER FAST SHIPPING. Codice articolo 9783030639198
Quantità: 2 disponibili
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Da: Lucky's Textbooks, Dallas, TX, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo ABLIING23Mar3113020025017
Quantità: Più di 20 disponibili
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Da: Ria Christie Collections, Uxbridge, Regno Unito
Valutazione del venditore 5 su 5 stelle
Condizione: New. In. Codice articolo ria9783030639198_new
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Dynamic Programming Multi-Objective Combinatorial Optimization
Editore:
Springer International Publishing, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuovo
Rilegato
Da: moluna, Greven, Germania
Valutazione del venditore 5 su 5 stelle
Condizione: 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. Codice articolo 448686179
Quantità: Più di 20 disponibili
Immagini fornite dal venditore
Dynamic Programming Multi-Objective Combinatorial Optimization
Editore:
Springer International Publishing Feb 2021, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuovo
Rilegato
Da: BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783030639198
Quantità: 2 disponibili
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Da: California Books, Miami, FL, U.S.A.
Valutazione del venditore 5 su 5 stelle
Condizione: New. Codice articolo I-9783030639198
Quantità: Più di 20 disponibili
Foto dell'editore
Dynamic Programming Multi-Objective Combinatorial Optimization (Studies in Systems, Decision and Control, 331)
Da: Books Puddle, New York, NY, U.S.A.
Valutazione del venditore 4 su 5 stelle
Condizione: New. 1st ed. 2021 edition NO-PA16APR2015-KAP. Codice articolo 26386905345
Quantità: 4 disponibili
Immagini fornite dal venditore
Dynamic Programming Multi-Objective Combinatorial Optimization
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuovo
Rilegato
Da: buchversandmimpf2000, Emtmannsberg, BAYE, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783030639198
Quantità: 2 disponibili
Immagini fornite dal venditore
Dynamic Programming Multi-Objective Combinatorial Optimization
Editore:
Springer International Publishing, 2021
ISBN 10: 3030639193
ISBN 13: 9783030639198
Nuovo
Rilegato
Da: AHA-BUCH GmbH, Einbeck, Germania
Valutazione del venditore 5 su 5 stelle
Buch. Condizione: 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. Codice articolo 9783030639198
Quantità: 1 disponibili