Author:
Anagnostopoulos A.,Michel L.,Hentenryck P. Van,Vergados Y.
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference10 articles.
1. Benoist, T., F. Laburthe, and B. Rottembourg, “Lagrange relaxation and constraint programming collaborative schemes for travelling tournament problems,” in CP-AI-OR'2001, Wye College (Imperial College), Ashford, Kent UK, April 2001.
2. Connelly, D. T., “General purpose simulated annealing.” Journal of Operations Research, 43, (1992).
3. Díaz, Juan A. and E. Fernández, “A tabu search heuristic for the generalized assignment problem,” European Journal of Operational Research, 132(1), 22–38, (July 2001).
4. Easton, K., G. Nemhauser, and M. Trick, “The traveling tournament problem description and benchmarks,” in Seventh International Conference on the Principles and Practice of Constraint Programming (CP'99), Paphos, Cyprus. Springer-Verlag, LNCS 2239, (2001) pp. 580–589.
5. Glover, F. and M. Laguna, Tabu Search. Kluwer Academic Publishers, 1997.
Cited by
92 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献