Extensions of Dynamic Programming Approach for Combinatorial Optimization

Extensions of Dynamic Programming Approach for Combinatorial Optimization

Internship Description

We are planning to study extensions of dynamic programming for combinatorial optimization problems whtich allow us to (i) describe the whole set of optimal solutions, (ii) count the number of optimal solutions, (iii) make multi- stage optimization relative to a sequence of criteria and (iv) study relationships between different criteria.

Faculty Name

Field of Study

​​Computer Science