Skip to main content
Computer, Electrical and Mathematical Sciences and Engineering
CEMSE
Computer, Electrical and Mathematical Sciences and Engineering
Home
Study
Prospective Students
Current Students
Internships
Research
Research Overview
Research Areas
Research Groups
Programs
Applied Mathematics and Computational Sciences
Computer Science
Electrical and Computer Engineering
Statistics
People
All People
Faculty
Affiliate Faculty
Instructional Faculty
Research Scientists
Research Staff
Postdoctoral Fellows
Students
Alumni
Administrative Staff
News
Events
About
Who We Are
Message from the Dean
Leadership Team
Apply
multi-stage optimization algorithm
Dynamic Programming Multi-Objective Combinatorial Optimization
Michal A. Mankowski, Postdoctoral Research Fellow, 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).
