Skip to main content
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
TREES
Extensions of Dynamic Programming, Machine Learning, Discrete Optimization
Main navigation
Home
People
Principal Investigators
Students
All Profiles
Alumni
Former Members
Events
All Events
Events Calendar
News
Pages
Teaching
Collaborators
Books
Contact Us
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).
