Introduction.- Circuits Without Repetitions. Main Tools.- Combinatorial Optimization Problems. Conventional Circuits.- Multi-Stage and Bi-Criteria Optimization of Matchings in Trees.- Combinatorial Optimization Problems. Syntactical Circuits.- Index.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
EUR 10 expédition depuis Allemagne vers France
Destinations, frais et délaisEUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : Universitätsbuchhandlung Herta Hold GmbH, Berlin, Allemagne
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 réf. du vendeur 2754LB
Quantité disponible : 1 disponible(s)
Vendeur : moluna, Greven, Allemagne
Etat : 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 réf. du vendeur 448686179
Quantité disponible : Plus de 20 disponibles
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Buch. Etat : 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 réf. du vendeur 9783030639198
Quantité disponible : 1 disponible(s)
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Buch. Etat : 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 réf. du vendeur 9783030639198
Quantité disponible : 2 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In. N° de réf. du vendeur ria9783030639198_new
Quantité disponible : Plus de 20 disponibles
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Buch. Etat : 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 réf. du vendeur 9783030639198
Quantité disponible : 2 disponible(s)
Vendeur : California Books, Miami, FL, Etats-Unis
Etat : New. N° de réf. du vendeur I-9783030639198
Quantité disponible : Plus de 20 disponibles
Vendeur : Lucky's Textbooks, Dallas, TX, Etats-Unis
Etat : New. N° de réf. du vendeur ABLIING23Mar3113020025017
Quantité disponible : Plus de 20 disponibles
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Hardcover. Etat : Brand New. 228 pages. 9.25x6.10x0.67 inches. In Stock. N° de réf. du vendeur x-3030639193
Quantité disponible : 2 disponible(s)
Vendeur : dsmbooks, Liverpool, Royaume-Uni
Hardcover. Etat : New. New. book. N° de réf. du vendeur D8F0-0-M-3030639193-6
Quantité disponible : 1 disponible(s)