Author:
Angel Eric,Bampis Evripidis,Gourvès Laurent
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. R.K. Ahuja, Ö. Ergun, J.B. Orlin, and A.P. Punnen. A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics,123:75–102, 2002.
2. E. Angel and E. Bampis. A multi-start dynasearch algorithm for the time dependent single-machine total weighted tardiness scheduling problem. European Journal of Operational Research, 2002. in revision.
3. E. Angel and V. Zissimopoulos. On the hardness of the quadratic assignment problem with metaheuristics. Journal of Heuristics, 8(4):399–414, 2002.
4. R.K. Congram, C.N. Potts, and S.L. van de Velde. An iterated dynasearch algorithm for the single-machine total weighted tardiness scheduling problem. INFORMS Journal on Computing, 14:52–67, 2002.
5. P. Czyzak and A. Jaszkiewicz. Pareto simulated annealing — a metaheuristic technique for multiple-objective combinatorial optimization. Journal of multicriteria decision analysis, 7:34–47, 1998.
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献