Subject
Management Science and Operations Research,Modeling and Simulation,General Computer Science
Reference65 articles.
1. Ali, I., Essam, D., Kasmarik, K., 2019. New designs of k-means clustering and crossover operator for solving traveling salesman problems using evolutionary algorithms. In: Proceedings of the 11th international joint conference on computational intelligence. pp. 123–130.
2. A machine learning-based approximation of strong branching;Alvarez;INFORMS J. Comput.,2017
3. Online learning for strong branching approximation in branch-and-bound;Alvarez;Optimization-Online,2016
4. An empirical comparison of tabu search, simulated annealing, and genetic algorithms for facilities location problems;Arostegui Jr.;Int. J. Prod. Econ.,2006
5. An effective heuristic for large-scale capacitated facility location problems;Avella;J. Heuristics,2009
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献