Author:
Boria Nicolas,Paschos Vangelis T.
Subject
Management Science and Operations Research,Computer Science Applications,Theoretical Computer Science
Reference125 articles.
1. S. Albers, On randomized online scheduling, inProceedings of the thiry-fourth annual ACM symposium on Theory of computing, ACM (2002) 134–143.
2. Albers S., Online algorithms: a survey.Math. Program.97(2003) 3–26.
3. Archetti C., Bertazzi L. and Speranza M.G., Reoptimizing the traveling salesman problem.Networks42(2003) 154–159.
4. Archetti C., Bertazzi L. and Speranza M.G., Reoptimizing the 0-1 knapsack problem.Discrete Appl. Math.158(2010) 1879–1887.
5. T. Asano, K. Hori, T. Ono and T. Hirata, A theoretical framework of hybrid approaches to max sat, inISAAC,Lecture Notes in Computer Science1350, edited by H.W. Leong, H. Imai and S. Jain. Springer (1997) 153–162.
Cited by
11 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献