Skip to main content
Applied Mathematics and Computational Science
Applied Mathematics and Computational Science
Study
Prospective Students
Current Students
Research
Research Areas
Research Groups
People
All People
Faculty
Affiliate Faculty
Instructional Faculty
Research Scientists
Research Staff
Postdoctoral Fellows
Administrative Staff
Alumni
Students
News
Events
SIAM Student Chapter
CEMSE Division
About
Apply
multi-stage optimization algorithm
Dynamic Programming Multi-Objective Combinatorial Optimization
Michal A. Mankowski, Ph.D., Computer Science
Oct 13, 15:00
-
16:00
KAUST
combinatorial optimization
global sequence alignment
multi-stage optimization algorithm
In this dissertation, we consider extensions of dynamic programming for combinatorial optimization. We introduce two exact multi-objective optimization algorithms: the multi-stage optimization algorithm that optimizes the problem relative to the ordered sequence of objectives (lexicographic optimization) and the bi-criteria optimization algorithm that simultaneously optimizes the problem relative to two objectives (Pareto optimization).
