摘要
讨论组合优化中的一个迅速发展的领域──在线计算，选出几个典型的未解问题进行方法介绍．
We discuss a rapidly growing research area in combinatorial optimization,on-line computing,together with a successful approach in dealing with these problems,competitive analysis. Several typical open problems are presented to introduce the area and the approach.
出处
《数学理论与应用》
1999年第3期76-79,共4页
Mathematical Theory and Applications
关键词
k-服务员问题
在线算法
排序
Competitive analysis,k-server problem,on-line algorithm,scheduling
