Three Open On- line CombinatorialOptimization Problems
Three Open On-line Combinatorial Optimization Problems
摘要
：We present three open combinatorial optimization problems from the standpoint of competitive analysis, in the case that there is no complete information.
：We present three open combinatorial optimization problems from the standpoint of competitive analysis, in the case that there is no complete information.
基金
This work is supported by NSF of China and Shandong Province and The Grant of Young and Middle-age Scientists in Shandong Provi
参考文献16
-
1[1]Chrobak M, et al. New results on server problem. SIAM Journal on Discrete Mathematics, 1991, 4:172～181.
-
2[2]Chrobak M, Larmore L. On fast algorithm for two servers. Journal of Algorithms, 1991, 12: 607～614.
-
3[3]Chrobak M, Larmore L. An optimal on-line algorithm fork -servers on tree. SIAM Journal on Computing, 1991 , 20(1):144～148.
-
4[4]Coppersmith D, Doyle P, Raghavan P, Snir M. Randomwalks on weighted graphs and applications to on-line algorithms. J. ACM, 1993, 40(3): 421～453.
-
5[5]Deng X, Gu N, Brecht T, Lu K. Preemptive schedulingof parallel jobs on multiprocessors. Seven Annual ACM SIAM Symposium on Discrete Algorithms, 1996, 159～ 167.
-
6[6]Deng X, Papadimitriou C H. Competitive distribution decision-making. Algorithmica, 1996,16:133～150.
-
7[7]Fiat A, Ravid Y, Rabani Y, Schieber B, Adeterministic O(k3) -competitive k-server algorithm for the circle. Algorithmica, 1994, 11(6): 572～578.
-
8[8]Irani S, Rubinfeld R. A competitive 2-serveralgorithm. Information Processing Letters, 1991, 39:85～91.
-
9[9]Karlin A R, Manasse M S, McGeoch L A, Owicki S. Competitive randomized algorithms for nonuniformproblems. Algorithmica, 1994, 11(6) :542～571.
-
10[10]Karloff H, Rabani Y, Ravid Y. Lower bounds forrandomized k -server and motion-planning algorithms. SIAM J. Comput, 1994,23(2) ,293～312.
-
1贺娟娟,肖建华,邵泽辉.AN ADAPTIVE MEMBRANE ALGORITHM FOR SOLVING COMBINATORIAL OPTIMIZATION PROBLEMS[J].Acta Mathematica Scientia,2014,34(5):1377-1394.
-
2唐应辉.A NEW AND DIRECT METHOD OF ANALYSIS THE DEPARTURE PROCESSES OF SINGLE SERVER QUEUEING SYSTEMS[J].Acta Mathematica Scientia,1996,16(S1):131-138. 被引量：4
-
3刘彦佩.SOME COMBINATORIAL OPTIMIZATION PROBLEMS ARISING FROM VLSI CIRCUIT DESIGN[J].Applied Mathematics(A Journal of Chinese Universities),1993,8(2):218-235. 被引量：2
-
4唐应辉,唐小我.THE QUEUE-LENGTH DISTRIBUTION FOR M^x/G/1 QUEUE WITH SINGLE SERVER VACATION[J].Acta Mathematica Scientia,2000,20(3):397-408. 被引量：2
-
5刘晓玲,王娟.SQL Server中利用触发器实现数据完整性[J].济南职业学院学报,2005(2):66-67. 被引量：1
-
6斯琴.多媒体通信Server-Proxy系统收入分配的Stackelberg模型[J].内蒙古民族大学学报（自然科学版）,2006,21(2):121-122.
-
7D.Elmakias,D.Bykhovsky,S.Arnon.Air turbulence effects on performance of optical wireless communication with crosstalk in server backplane[J].Chinese Optics Letters,2017,15(2):20-24.
-
8唐应辉.THE TRANSIENT SOLUTION FOR M/G/1 QUEUEWITH SERVER VACATIONS[J].Acta Mathematica Scientia,1997,17(3):276-282. 被引量：13
-
9韩海山,夏尊铨.Server和Proxy收入分配的Stackelberg模型及解的存在性[J].运筹与管理,2004,13(1):54-58. 被引量：1
-
10付利军,杨金劳.浅析数据库日志文件的增长[J].吕梁教育学院学报,2012,29(1):61-63.
