| Description |
1 online resource (213 pages) |
| Series |
Studies in systems, decision and control ; volume 331 |
|
Studies in systems, decision and control ; v. 331.
|
| Contents |
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 |
| Summary |
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 |
| Bibliography |
Includes bibliographical references and index |
| Notes |
Print version record |
| Subject |
Combinatorial optimization.
|
|
Dynamic programming.
|
|
Combinatorial optimization
|
|
Dynamic programming
|
|
Programació dinàmica.
|
|
Optimització combinatòria.
|
| Genre/Form |
Llibres electrònics.
|
| Form |
Electronic book
|
| Author |
Moshkov, Mikhail, author
|
| ISBN |
9783030639204 |
|
3030639207 |
|
