Skip to main content
Numerical Methods for PDEs
NumPDE
Numerical Methods for PDEs
Main navigation
Home
People
All Profiles
Principal Investigators
Postdoctoral Fellows
Students
Former Members
Events
All Events
Events Calendar
News
About
Activities
Slides
NumPDE Workshop 2025
CAMWA 50
POEMS 2026
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).
