Author:
Resende Mauricio G.C.,Ribeiro Celso C.
Reference180 articles.
1. Abdinnour-Helm, S., Hadley, S.W.: Tabu search based heuristics for multi-floor facility layout. Int. J. Prod. Res. 38, 365–383 (2000)
2. Abello, J., Pardalos, P.M., Resende, M.G.C.: On maximum clique problems in very large graphs. In: Abello, J., Vitter, J. (eds.) External Memory Algorithms and Visualization, DIMACS Series on Discrete Mathematics and Theoretical Computer Science, vol. 50 pages 199–130. American Mathematical Society Boston, MA (1999)
3. Abello, J. Resende, M.G.C., Sudarsky, S.: Massive quasi-clique detection. In: Rajsbaum, S. (ed.) LATIN 2002: Theoretical Informatics, Lecture Notes in Computer Science, vol. 2286 pp. 598–612. Springer, Cancun (2002)
4. Ahuja, R.K., Orlin, J.B., Sharma, D.: Multi-exchange neighborhood structures for the capacitated minimum spanning tree problem. Math. Program. 91, 71–97 (2001)
5. Ahuja, R.K., Orlin, J.B., Tiwari, A.: A greedy genetic algorithm for the quadratic assignment problem. Comput. Op. Res. 27, 917–934 (2000)
Cited by
166 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献