Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Beier, R., Vöcking, B.: Random knapsack in expected polynomial time. In: Proc. of 35th STOC, pp. 232–241 (2003)
2. Spielman, D.A., Teng, S.H.: Smoothed analysis: Why the simplex algorithm usually takes polynomial time. In: Proc. of 33rd STOC, pp. 296–305 (2001)
3. Hochbaum, D.S. (ed.): Approximation Algorithms for NP-Hard Problems. Wadsworth Publishing Company, Belmont (1997)
4. Kirkpatrick, S., Gelatt, C.D., Vecchi, M.P.: Optimization by simulated annealing. Science 220, 1087–1092 (1983)
5. Baeck, T., Fogel, D.B., Michalewicz, Z. (eds.): Handbook of Evolutionary Computation. Institute of Physics Publishing (1997)
Cited by
58 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献