TY  - GEN
N2  - 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.
DO  - 10.1007/978-3-030-63920-4
DO  - doi
AB  - 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.
T1  - Dynamic programming multi-objective combinatorial optimization /
AU  - Mankowski, Michal,
AU  - Moshkov, Mikhail,
VL  - volume 331
CN  - QA402.5
ID  - 1433851
KW  - Combinatorial optimization.
KW  - Dynamic programming.
KW  - Optimisation combinatoire.
KW  - Programmation dynamique.
SN  - 9783030639204
SN  - 3030639207
TI  - Dynamic programming multi-objective combinatorial optimization /
LK  - https://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-63920-4
UR  - https://univsouthin.idm.oclc.org/login?url=https://link.springer.com/10.1007/978-3-030-63920-4
ER  -