2016

十二月

27

演講公告 - Fully Polynomial Time Approximation Schemes

演講者：Prof. Mikhail Y. Kovalyov (United Institute of Informatics Problems, National Academy of Sciences of Belarus, 逢甲資工特約講座)

講題: Fully Polynomial Time Approximation Schemes

時間：1月10日(星期二) 上午10:00

地點：交大光復校區 管理二館MB304

Abstract: Definition of a Fully Polynomial Time Approximation Scheme (FPTAS) will be given. General techniques for the development of FPTASes will be described. They are the interval partitioning technique and the rounding technique. A bound improvement procedure will be presented, which allows to make closer arbitrary lower and upper bounds of the objective function optimal value. A generic FPTAS will be given for a case of complex objective functions. The discussion will be supported by the examples from scheduling and lot-sizing.

                            

                                Posted
                                 in
                                                                            學術活動                                                                                                                                         on 十二月 27, 2016 ，有效日期至二月 27, 2017