1. 제 목 : Inverse combinatorial optimization

2. 연 사 : Yerim CHUNG (Centre d'Economie de la Sorbonne, Université de Paris 1 Panthéon-Sorbonne, France )

3. 내용 :
During the last decades, inverse combinatorial optimization problems have found an increased interest in the optimization community. Whereas an optimization problem asks for a feasible solution with minimum or maximum objective function value, inverse optimization problems are defined with a target solution (or target solution value), and aim to perturb as little as possible the parameters (costs, profits, etc.) of the problem so that the given solution becomes optimum in the new instance. In this talk, we introduce some generalized inverse combinatorial problems, and study the inverse versions of well-known NP-hard problems such as the maximum stable set problem, the minimum traveling set problem and the minimum vertex coloring problem.

3. 약력 :
1995/03-2000/08 연세대학교 경영학과 (수학과 부전공) 학사
2000/10-2003/09 파리1대학 응용수학과 (Applied Mathematics-Informatics)학사
2003/10-2005/09 파리1대학 응용수학과 석사
2005/10-2010/03 파리1대학 응용수학과 박사
2008/10-2010/08 파리1대학 Teaching and Research Assistant

4. 일 시 : 2010년 8월 4일(수) 오후 14:00 ~

5. 장 소 : 39동 309호(세미나실)

6. 문 의 : 산업 조선공학부 홍성필 교수 (880-1477 / sphong@snu.ac.kr)