Author:
Bautista Joaquín,Pereira Jordi,Adenso-Díaz Belarmino
Publisher
Springer Science and Business Media LLC
Subject
Management Science and Operations Research,General Decision Sciences
Reference19 articles.
1. Bautista, J., Companys, R., & Corominas, A. (1996). Heuristics and exact algorithms for solving the Monden problem. European Journal of Operational Research, 88(1), 101–113.
2. Blum, C. (2005). Beam-ACO—hybridizing ant colony optimization with beam search: an application to open shop scheduling. Computers & Operations Research, 32(6), 1565–1591.
3. Lecture notes in computer science;M. Butaru,2005
4. Della Croce, F., Ghirardi, M., & Tadei, R. (2004). Recovering Beam Search: enhancing the beam search approach for combinatorial optimization problems. Journal of Heuristics, 10(1), 89–104.
5. Dincbas, M., Simonis, H., & van Hentenryck, P. (1988). Solving the car sequencing problem in constraint logic programming. In Proceedings of the 8th European conference on artificial intelligence, ECAI-88, Munich (pp. 290–295). London: Pitman.
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献